Abstract: Method, system and apparatus for assembling a recording plan and data driven dialogs for automated communications are provided. At a computing device comprising a memory, a communication interface and a processor, the memory storing a database of statements comprising one or more of first names, last names, greeting statements, sentiment statements, influence statements, call to action statements, and legal statements: one or more statements from the database are automatically assembled, via the processor, into one or more phrases to be recorded; instructions for applying linguistic rules are associated with the one or more phrases, via the processor, including where to insert pauses in the one or more phrases; and, the recording plan, comprising the one or more phrases in association with the instructions, is stored at the memory.

Abstract: A method, system, and computer program product provide a conversation agent to process natural language queries expressed by a user and perform commands according to the derived intention of the user. A natural language processing (NLP) engine derives intent using conditional random fields to identify a domain and at least one task embodied in the query. The NLP may further identify one or more subdomains, and one or more entities related to the identified command. A template system creates a data structure for information relevant to the derived intent and passes a template to a services manager for interfacing with one or more services capable of accomplishing the task. A dialog manager may elicit more entities from the user if required by the services manager and otherwise engage in conversation with the user. In one embodiment, the conversational agent allows a user to engage in multiple conversations simultaneously.

Abstract: A method for assisting a user with one or more desired tasks is disclosed. For example, an executable, generic language understanding module and an executable, generic task reasoning module are provided for execution in the computer processing system. A set of run-time specifications is provided to the generic language understanding module and the generic task reasoning module, comprising one or more models specific to a domain. A language input is then received from a user, an intention of the user is determined with respect to one or more desired tasks, and the user is assisted with the one or more desired tasks, in accordance with the intention of the user.

Abstract: A system and method for assessing translation quality are disclosed. In one example, a computer system receives data associated with a translation from a first text in a first natural language to a second text in a second natural language, wherein the data comprises a first value that is based on one or more semantic errors of the second text, a second value that is based on extraneous content in the second text, and a third value that is based on missing content in the second text; and determining by the computer system, based on the first value, the second value, and the third value, a score that quantifies translation quality of the second text with respect to the first text.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Methods and systems for improving a music experience are described. Multiple users can provide their musical preferences (e.g., favorite artist, group, genre, era, etc.). When the users come within the vicinity of a jukebox, the users' musical preferences are retrieved or determined. Using the combined or shared preferences of the users in the vicinity of the jukebox, the system is able to create or adjust the current playlist of songs, tailoring the music played based on the users listening nearby.

Abstract: Methods, program products, and systems of intelligent data delivery and storage based on data characteristics are disclosed. A database server can receive, from a user device, a request for data. The database server can determine a data size and a data type of the requested data. The database server can identify, based on the data size and data type, and from multiple candidate data delivery protocols for responding to the request, a data delivery protocol designated for delivering data having the data size and data type. The database server can deliver the data to the user device in response to the request using the identified data delivery protocol.

Abstract: Methods and systems for generating concept structures from signature reduced clusters (SRCs) are provided. The method includes retrieving at least one SRC including a cluster of signatures respective of a plurality of multimedia data elements (MMDEs); generating at least one metadata for each signature of the cluster of signatures; identifying a number of repetitions of a metadata of the at least one generated metadata; and determining whether the number of repetitions of the metadata exceeds a predefined repetition threshold; upon determining that the number of repetitions of the metadata exceeds the predefined repetition threshold, identifying the metadata as representative of the SRC; comparing the representative metadata to metadata that is representative of at least one previously generated SRC to determine a metadata match; and upon determining the metadata match, identifying the retrieved SRC and the matching previously generated SRC as a concept structure.

Abstract: A method and system are provided to synchronize an audio program output at a location remote to a site of a visual display such as a fireworks show, a water and light show, or other event or show with a large visual display visible from distances over which the originally sourced audio is delayed, degraded in quality, or lost. The method includes providing a live show including a visual display with components triggered by one or more control signals. The method further includes concurrently providing an audio output that may include playback of a soundtrack associated with the visual display with a sound system of a mobile device. The audio output is provided at a location that is remote from the site of the visual display, and the audio output is synchronized in time with the components of the visual display using the control signals or a preset start time.

Abstract: Various embodiments relate to intelligently generating a playlist and determining attributes of a media player for output when content of the playlist is played. The playlist may be generated dynamically from content from multiple media sources and sensor information from one or more sensors communicating with the media player. The one or more attributes may also be determined from the sensors. The playlist and the attributes may change as the information from the sensors change.

Abstract: Disclosed is a method for creating and reading a contiguous file in an extensible file system. During the creation of a file on the storage media, the file system format check the bitmap to determine if there are areas of free space on the media that would permit the storage of the file in a contiguous manner. By storing the file in a contiguous manner the file may later be read without resorting to the file allocation table, because the file itself would not be fragmented on the storage media. Once an area of free space has been identified, the file is written to the media in a contiguous manner. Further, an associated entry for the file in the directory entry is updated or created to indicate that the file is a contiguous file and also provides basic parameters necessary to read the file without resorting to accessing the file allocation table.

Abstract: A system and method for flashing one or more electronic devices. A flashing program executed by a server is accessed from a computing device. The one or more electronic devices are received for communication with the computing device. The one or more electronic devices are identified in response to receiving the one or more electronic devices. The one or more electronic devices are flashed to remove the customer private information through the computing device as instructed through the server.

Abstract: Technology is disclosed for managing data in a distributed file system (“the technology”). The technology can gather metadata information associated with the data stored within a first file system, store the metadata information in association with a data identifier within a second file system, retrieve the stored metadata information using the data identifier from within the second file system and locate and retrieve the data associated with the metadata information from within first file system.

Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into systems each having multiple nodes. Objects in the systems have access control lists (ACLs) associated therewith. A method of providing a search key to each ACL in any one system comprises: selecting a region for each metadata object pertaining to the objects in the system; and generating, for each ACL associated with an object in the system, an ACL ID (identifier) as a search key which includes the region number of the region selected for the metadata object pertaining to the object, a region map level corresponding to the region selected, and a monotonically increasing counter value that is automatically incremented each time an ACL ID is generated. The ACL ID remains unique during reconfiguration via splitting/merging existing distributed portions of the database.

Abstract: Methods and apparatuses that maintain birth time for a file system to optimize file update operations are described. The file system can include a plurality of snapshots or clones of data stored in one or more extents of blocks allocated in a storage device. Each extent may be associated with a time stamp according to the birth time. A request may be received from an executable using the file system to update data in a particular extent associated with a particular time stamp. In response, the current birth time in the file system and the particular time stamp may be compared to determine if the particular extent is not shared by more than one of the snapshots. If the particular time stamp is equal to the current birth time, the particular extent may be updated directly without performing an expensive operation to check whether a reference count of the particular extent is equal to one.

Abstract: A method and apparatus for tracking purged data includes at least one of a data deletion module and a data deletion registry that are used to compare data, records and files of at least one computing unit to determine of any of the data, records or files stored within the computing unit have previously been purged. If so, the data, record or file is re-purged. Purging can include deleting the entire data, record or file or just a portion to anonymize the data record or file. Alternatively, instead of deleting all or a portion of a data, record or file, an encryption key required to access all or a portion of the data, record or file may be deleted thereby rendering the encrypted information inaccessible. Differing schemes and method for purging data, records and files may be utilized within a network.

Abstract: Provided are a computer program product, system, and method for restoring objects in a client-server environment. An entry is added to an index for each chunk identifier. Each index entry includes one of the chunk identifiers and a reference to the chunk of data in the target storage from which the chunk identifier was calculated. A request is transmitted to a server recovery agent to recover an object from the storage server. Chunk identifiers of chunks of data in the requested object to recover are received from the server recovery agent. A determination is made from the index of whether the received chunk identifiers for the requested object matches the chunk identifiers indicated in the index. A request is made of the chunks from the server recovery agent for the received chunk identifiers not matching chunk identifiers in the index entries.

Abstract: Techniques are described for automatically determining application composition and application ownership of an application that may include a plurality of files deployed to a plurality of host devices. The determination of application composition may be based on analyzing various types of metadata that may provide evidence of associations between deployed files, such as metadata describing the deployment of files to host devices, metadata describing the files tracked within a source control system, or other types of metadata. The determination of application ownership may also be based on analyzing the various types of metadata that provide evidence of associations between files and individuals or groups of individuals within an organization.

Abstract: An information management system creates data structures based entirely on the content of source files, then compares these data structures to discover synergies and commonalities. In one embodiment, the system accepts a first collection of source files, and extracts text from each source file. The text is compared to tags in one or more dictionaries, which comprise hierarchical listing of tags. Tags matching the text are associated with each source file. The system then generates a virtual relational network in which each source file having matching tags is a node. Tags associated with two or more source files are links between the nodes. This virtual relational network may be compared with another virtual relational network to discover common nodes or links. Source files later added to a collection are massively linked by associating all tags from all source files with the newly added source file, and vice versa.

Abstract: Systems and methods method enabling file actions to be performed on a folder structure in a cloud-based service are disclosed. In one aspect, embodiments of the present disclosure include a method, which may be implemented on a system, for representing the folder structure in a user interface to the cloud-based service as a file and enabling file actions to be performed on file representing the folder structure in the user interface to the cloud-based service. In one embodiment, the folder structure and associated content is stored on a server which provides the cloud-based service in a compressed file format which is able to preserve the metadata associated with the folder structure which indicates its representation as the file in the user interface.

Abstract: Solid-state storage devices may be employed to store data maintained by a database management system, but may have characteristics that reduce the efficiency of interactions between the database management system and the device. A storage subsystem may receive information indicative of internal boundaries within database data. A segment of the database data may be selected for compression, wherein the size of the segment is based at least on one or more the internal boundaries, the memory page size of the solid-state drive, and a predicted rate of compression. The compressed segment may be stored if it has a size less than the memory page size of the device. If it does not, compression may be retried with a smaller segment of data or a portion of the data may be stored in uncompressed form. Additional segments of the data may be stored on the solid-state drive in a similar manner.

Abstract: Input backup data is deduplicated with data of a synthetic backup previously constructed by a deduplication storage. A synthetic backup is constructed by processing metadata instructions provided by a backup application. Deduplication digests are calculated based on the data of the synthetic backup and the deduplication digests are stored in a digests index. When new backup data is processed, deduplication digests of the new data are calculated and searched in the digests index. A data segment of the synthetic backup is partitioned into fixed sized sub-segments. The calculated digests of sub-segment are aggregated to produce the deduplication digest, and the deduplication digest is formed for the synthetic backup.

Abstract: A similarity analysis method, an apparatus, and a system where the method includes acquiring file fingerprint information of a file to be analyzed, sending an analysis request that carries the file fingerprint information to at least two MDSs, selecting at least one group according to an analysis result returned by each MDS, where the analysis result includes a group number and a similarity of at least one group that has the highest similarity with the file fingerprint information and is found by the MDS, and the MDS locally queries a duplicate data block in the selected group. Hence, each MDS needs to query only a file fingerprint information set of a group that the MDS itself is responsible for, which reduces the amount of data retrieval and waiting time of reading, writing, and locking a database file.

Abstract: Apparatus, systems, and methods may operate to grant a renewable lease synchronization lock to a node for a file having copies distributed among a group of nodes that is unsynchronized and for which no write lock has already been granted. The synchronization lock disables modification of the file, and enables synchronization of a file copy on the requesting node to a synchronization master copy on another node in the group. A renewable lease write lock can be granted to a node in the group when the file is synchronized and when the write lock has not already been granted. The write lock disables granting the synchronization lock, and enables file modification. The synchronization lock and write lock are maintained until their respective leases expire. Additional apparatus, systems, and methods are disclosed.

Abstract: A method for managing design files shared by multiple users is provided. A plurality of design files are stored in a design library. A lock table is moved to a memory of a first computer when information of the lock table indicates that the design files were locked by a first process corresponding to a first user, wherein the memory is only accessible to performance of the first process. The lock table is moved from the memory to a common memory of the first computer when one design file is locked by a second process corresponding to a second user. The first and second processes are being performed in the first computer. The lock table is moved from the memory to the design library when the one design file is locked by the second process corresponding to the second user, wherein the second process is performed in a second computer.

Abstract: A system for assuredly copying information from a reference database to a remote database. A send server is coupled to a first network. A receive server is coupled to a second network. A one-way data link provides unidirectional transfer of information from the send server to the receive server. A monitor application iteratively forwards update files including sequence information to the send server. An update application receives each update file and updates the remote database based therein. The update files are also sequentially stored in the send server in groups and each group is sent to the receive server and stored in memory. If an update file is not received in proper sequential order, the receive server stops sending update files in the current group and instead reads the missing update file and subsequent update files in the current group from memory and forwards such files to the update application.

Abstract: An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries.

Abstract: A method for file handling in a hierarchical storage environment includes receiving a new document for storage, and triggering and/or initiating a new document notification process upon receipt of the new document. The new document notification process includes scanning the new document for a set of keywords and/or references; creating enhanced metadata for the new document, wherein the enhanced metadata includes the set of keywords and/or references from said scanning; storing the enhanced metadata in a file system; and evaluating the enhanced metadata via a relationship analyzing process to produce a priority list defining a likelihood of possible access. The method also includes storing the new document in a storage tier of a hierarchical storage environment according to the priority list.

Abstract: A record within a destination virtual file is generated on a destination node of a distributed data storage system. The record comprises (i) a link directed to a partition of a source virtual file stored on a source node and (ii) partition criteria characterizing the partition. The source virtual file is mapped to a chain of linked pages stored in a page buffer of the distributed data storage system and the partitioning criteria is used by at least one of the source node and the destination node to identify data associated with the partition. A request is later received at the destination node to access data defined by the destination virtual file. Data is provided, in response to the request, from the partition of the source virtual file stored on the source node using the link and the partitioning criteria. Related apparatus, systems, techniques and articles are also described.

Abstract: A technique of backing up a workload in a virtual environment includes identifying one or more files that are associated with the workload. One or more source volumes that include the one or more files are identified. A respective target volume is provisioned for each of the one or more source volumes identified. Only dirty blocks are copied (in a snapshot mode that prevents an update to the one or more source volumes during the snapshot mode) from each of the one or more source volumes to its respective target volume. The one or more dirty blocks are then copied from each target volume to a backup medium.

Abstract: The invention relates to a method, a map providing device, a computer program and a computer program product for presenting a digital map via a map presenting unit of a user terminal. An object (01) and a first position (P1) of this object are obtained together with a digital map (M1) comprising a reference position (RP) and the first position (P1). A line (L1) is determined, which at one end is to be connected to the reference position and at another opposite end to the first position. Then a geographical area (A1) of the digital map including the reference position is presented. If the first position (P1) is outside of the geographical area then a part (L1A) of the line stretching through the geographical area is presented. If not no line is presented. The appearance of the line when presented is dependent on the distance between the reference position and the first position.

Abstract: A computing device may identify a series of bits representative of a first binary large object (BLOB) for navigation data including road segments and road attributes. The computing device duplicates each bit of the series of bits a predetermined number of times to form a first bit string. The first bit string is larger than the series of bits by a factor of the predetermined number. The computing device performs a binary difference of the first bit string to a second bit string representative of a second BLOB. A result of the binary difference is stored in a navigation patch file.

Abstract: Methods and device are disclosed for data retrieval. At first images and reports are analyzed by respective parser units to detect both structures and text passages that are related to respective structures and text passages of a knowledge data-base. The detected structures and text passages are stored together with a unique resource located that identifies the respective structure and/or text passage at the knowledge database in a semantic annotation database. In addition a feature extraction can be performed to provide specific features of the images and/or regions of the images, whereby the features are stored in an image feature database. Finally an input query can ask questions that are used to provide a result to the query based on the semantic annotation database and the image feature database. The methods and devices may be used for data preparation and data retrieval of medical images and associated medical reports.

Abstract: An image recognition approach employs both computer generated and manual image reviews to generate image tags characterizing an image. The computer generated and manual image reviews can be performed sequentially or in parallel. The generated image tags may be provided to a requester in real-time, be used to select an advertisement, and/or be used as the basis of an internet search. In some embodiments generated image tags are used as a basis for an upgraded image review. A confidence of a computer generated image review may be used to determine whether or not to perform a manual image review.

Abstract: A emotion image recommendation system and method are disclosed, where a recommended emotion image is provided in replace with a selected emotion image as conventionally used by a user, thereby an emotion image corresponding to an emotional word used by the user may be provided, so that the efficacy of a reduced frequency for locating the appropriate emotion image for the user may be achieved.

Abstract: Methods, systems, and products help users recall memories and search for content of those memories. When a user cannot recall a memory, the user is prompted with questions to help recall the memory. As the user answers the questions, a virtual recollection of the memory is synthesized from the answers to the questions. When the user is satisfied with the virtual recollection of the memory, a database of content may be searched for the virtual recollection of the memory. Video data, for example, may be retrieved that matches the virtual recollection of the memory. The video data is thus historical data documenting past events.

Abstract: Various embodiments provide an intelligent adaptive content canvas that can enable users to access content, such as photos and videos, and consume the content in an adaptive environment that tailors the user experience in accordance with various parameters. The user experience is personalized to the user and is adaptively predictive in a manner that attempts to surface content that the user would likely wish to consume.

Abstract: A system is disclosed for managing address reflectors. In one example, the system discloses a reflector storage 108, 116, 124, 608, with a set of reflector members 304 associated with a set of reflector names 306. The system also includes a computer 100, 604 programmed with executable instructions 500, 610 which operate a set of modules. The modules includes reflector management module 106, 114, 122 which, receives a character-string from user input 104, 120, and identifies the reflector names 306 whose reflector members 304 are partially defined by the character-string.

Abstract: Scheduling mechanisms for assigning data in a distributed file system to database workers are provided. In one embodiment, a method of and computer program product for assignment of data blocks to database workers are provided. A request for table data is received. Metadata for a plurality of blocks in a file system is retrieved from a metadata store. Each of the plurality of blocks contains a subset of the table data. A request for work is received from a requestor. An assignment of one or more of the plurality of blocks is provided to the requestor.

Abstract: Disclosed herein is a statistical approach, a win share approach, used to assign a win share value to content items. User interaction with content items is tracked, and a win share value is assigned to content items in response to a “winning” action performed by a user. Win shares associated with content items are used to identify content items that are to be presented, and can further be used to identify an optimal presentation, e.g., layout, presentation frequency, etc., of content items that is to be presented.

Abstract: In one embodiment, a method comprises creating and storing, in a revisioning database, one or more data objects; wherein a first plurality of the data objects is associated with a base realm representing data shared across all users of the database; wherein a second plurality of the data objects is associated with one or more child realms, wherein each of the child realms represents data local to a project, wherein each of the users is associated with one or more of the child realms; wherein the revisioning database associates each data object to a realm identifier value and to a version identifier value for a plurality of versions of the data object, wherein each of the versions represents a change to the data object by any of a plurality of users; receiving a request from a first user to view a third plurality of data objects in the revisioning database; selecting, based on the base realm, the particular realm, the version identifier value for the data objects in the third plurality, and one or more rules a

Abstract: Managing free space in a relational database. A data statistics history for the relational database is received, including a distribution of index key columns for a clustering index. Based on the data statistics history, increasing index key columns are identified. A rate of increase of the increasing index key columns is measured. Based on the measured rate of increase and on an estimate of database reorganization frequency, free space for the increasing index key columns is reserved.

Abstract: A search system includes a storage device and a search server. The storage device stores an index database storing an index encrypted with an index key and the index key encrypted with a user key and associated with the encrypted index and stores a document database storing a document encrypted with a document key and the document key encrypted with the user key and associated with the encrypted document. The search server extracts a term for search from a requested search query, decrypts the encrypted index key with a user key which belongs to a user requesting the search query, encrypts the extracted term with the decrypted index key without storing the decrypted index key in a non-transitory storage device, searches the index database with the index encrypted using the encrypted first term, and sends a search result to a terminal.

Abstract: A database has a main table and an auxiliary table. Data are stored by: dividing the data into a sequence of segments each having a size smaller than a predetermined threshold; storing a first segment into a first field of a record of the main table; storing an index indexing the data into a second field of the record of the main table; storing the other segments into first fields of corresponding records of the auxiliary table; generating indexes associated to the other segments and storing each index into a second field of the record of the auxiliary table storing the associated segment of the sequence and also in a third field of the record of the auxiliary table storing a preceding segment in the sequence. A third record of the main table stores the index of a first segment of the sequence which is stored in the auxiliary table.

Abstract: A search index for searching a graph-based data store can include triple entries, each triple entry having a posting list value, at least one intersection identifier associated with the posting list value, and at least one result identifier associated with the intersection identifier. The index may also include search entries having a posting list value that corresponds to a text search aid. The search index may also include pre-computed path entries, such as chain path entries and converge path entries. The index may also include bucket posting lists representing ranges of object values for a particular predicate and proximity posting lists that include one or more entities and the areas of a location hierarchy with locations within the proximity of the entity. Queries for the data graph may have at least two stages, each stage being associated with a posting list from a graph index.

Abstract: A system includes circuitry configured to: read a plurality of character information and a plurality of identifiers that are included in a text file; determine whether a character information among the plurality of character information is included between the at least one pair of identifiers among the plurality of identifiers in the text file; and associate the character information with the at least one pair of identifiers when it is determined that the character information is included between the at least one pair of identifiers.

Abstract: The exemplary embodiments described herein are related to techniques for automatically generating narratives about data based on communication goal data structures that are associated with configurable content blocks. The use of such communication goal data structures facilitates modes of operation whereby narratives can be generated in real-time and/or interactive manners.

Abstract: In various embodiments, a system and related method for organizing transactional data from an application environment is disclosed. In some embodiments, a system includes a file system and one or more daemon indexers in electrical communication with the file system. The file system is arranged as a non-relational and serverless file system to allow for cost-effectiveness with ready scalability. The file system is to receive, in substantially real-time, unsorted transactional data from a publishing module. The one or more daemon indexers are arranged to receive the unsorted transactional data from the file system, organize the unsorted transactional data by operational characteristics, and store the organized transactional data on the file system. Other systems and methods are disclosed.

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: A method, apparatus, and system for hierarchical organization of tablespace free space metadata in a database are provided. The hierarchy is divided into at least two levels: level 1 or L1 bitmap blocks are stored as a shared data structure and map free space in a tablespace, whereas level 2 or L2 bitmap blocks are stored as separate local copies at each database instance and map to the L1 bitmap blocks. This hierarchical organization provides a mechanism for finer grained concurrency control, enabling highly parallel tablespace metadata processing to accommodate the performance requirements of large tablespaces with big data sets. By integrating the hierarchical organization as part of the tablespace stack layer in a database management system (DBMS), implementations can be provided transparently to database end users without demanding any additional administrative, maintenance, or development burdens.