Abstract: A method for a data capturing and structuring includes determining at least one data capture mode for processing a non-electronic data record into an electronic data record and selecting a record owner having a plurality of existing data records to be associated with the electronic data record. The method also includes capturing the non-electronic data record into the electronic data record and collecting metadata from data associated with the record owner and the electronic data record and data generated during the capturing. Further, the method includes creating structured data records by combining the electronic data record and the metadata and exporting the structured data records.

Abstract: Systems and methods for classifying electronic information or documents into a number of classes and subclasses are provided through an active learning algorithm. In certain embodiments, seed sets may be eliminated by merging relevance feedback and machine learning phases. In certain embodiments, the active learning algorithm forks a number of classification paths corresponding to predicted user coding decisions for a selected document. The active learning algorithm determines an order in which the documents of the collection may be processed and scored by the forked classification paths. Such document classification systems are easily scalable for large document collections, require less manpower and can be employed on a single computer, thus requiring fewer resources. Furthermore, the classification systems and methods described can be used for any pattern recognition or classification effort in a wide variety of fields.

Abstract: Methods and apparatus for populating a contact entry of a user based on information obtained from one or more sources that are external to the contact entry. Some implementations are directed generally to analyzing text of a document associated with the user to identify contact information in the document. In some versions of those implementations, an affinity measure associated with the document may be determined that is indicative of an amount of interest of the user in the document and a contact entry may be populated with one or more aspects of the contact information based on the affinity measure satisfying a threshold.

Abstract: The present invention pertains to a method for selecting a version of a document. The user inputs an identifier of a document at the level of his receiver connected to at least one communication network, and initiates a search request to receive versions of at least one part of this document. The receiver then receives a plurality of versions of the said document. Each version received is analysed by a plurality of evaluation modules so as to calculate an evaluation value for each version received according to a predetermined criterion. The receiver selects for each of the evaluation modules a version of the document having the best evaluation in respect of this criterion, and displays the identifiers of versions having the best evaluations according to each criterion. The user can then easily select the version for reproduction thereof which best meets a criterion. The invention also relates to a receiver implementing the said method.

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: Methods, systems, and devices for associating metadata with a media object that has been published on a plurality of social networks obtain a respective identifier by which the media object is identified on each of the plurality of social networks, retrieve metadata associated with the media object from each of the plurality of social networks using the corresponding identifier, and store the retrieved metadata in association with the media object.

Abstract: Content platform management is enhanced by logically partitioning a physical cluster that comprises a redundant array of independent nodes. Using an interface, an administrator defines one or more “tenants” within the archive cluster, wherein a tenant has a set of attributes including, for example, namespaces, administrative accounts, data access accounts, and a permission mask. A namespace is a logical partition of the cluster that serves as a collection of objects typically associated with at least one defined application. Each namespace has a private file system such that access to one namespace (and its associated objects) does not enable a user to access objects in another namespace. A namespace has capabilities (e.g., read, write, delete, purge, and the like) that a namespace administrator can choose to enable or disable for a given data account.

Abstract: Methods and apparatus are provided for processing data representing three-dimensional points organized in a data structure wherein each point has multiple components, the data is organized in a respective layer per component, each layer is segmented in cells of a two-dimensional grid, the cells are arranged such that the components of a given point are contained in corresponding cells of multiple layers, the cells are grouped in patches by layer, and the patches are arranged such that the components of an array of points is represented by corresponding patches of multiple layers. At least one first criterion and at least one second criterion are obtained. Data are retrieved from cells of patches meeting the at least one first criterion and from layers meeting the at least one second criterion. The retrieved data are processed to obtain a derivative data set.

Abstract: A method, system, and computer program include receiving a request string, and mapping the received request string to a distinguishable request string and a collapsible request string. The received request string may be in the form of a JSP, a servlet, and remote Enterprise Java Bean calls. A user may be prompted to create rules for mapping of a received request string to a distinguishable request string and a collapsible request string.

Abstract: A first backup storage system within a receiving domain receives information from an originating domain distinct from the receiving domain. The first backup storage system includes at least one storage device and the information includes backup data and corresponding lifecycle policy information for the backup data. The first backup storage system automatically performs an operation relating to the backup data, where the operation is specified by the received lifecycle policy information. In some embodiments, the lifecycle policy information may be received by the receiving domain within a header located within the backup data.

Abstract: Exemplary embodiments provide access to an updated file performed by a computer having at least one processor, wherein responsive to an application receiving an update comprising modified content of an old file, a new file is created into which the modified content is copied, while access to the old file is maintained, wherein old file logical block addresses (LBAs) are mapped to old file physical block addresses (PBAs), and new file LBAs are mapped to new file PBAs, the method, comprising: atomically swapping the mapping of the old file LBAs from the old file PBAs to the new file PBAs; trimming the mapping of the old file LBAs to the old file PBAs; and clearing the mapping of the new file LBAs to the new file PBAs.

Abstract: Information source agent systems and methods for distributed content storage and management using content signatures that use file identicality properties are provided. A data management system is provided that includes a content engine for managing the storage of file content, a content signature generator that generates a unique content signature for a file processed by the content engine, a content signature comparator that compares content signatures and a content signature repository that stores content signatures. Information source agents are provided that include content signature generators and content signature comparators. Methods are provided for the efficient management of files using content signatures that take advantage of file identicality properties. Content signature application modules and registries exist within information source clients and centralized servers to support the content signature methods.

Abstract: The disclosed embodiments disclose techniques for deleting a file from a distributed filesystem. Two or more cloud controllers collectively manage distributed filesystem data that is stored in one or more cloud storage systems; the cloud controllers store metadata for the distributed filesystem, and cache and ensure data consistency for the data stored in the cloud storage systems. During operation, a cloud controller receives a request from a client to delete a file from the distributed filesystem. The cloud controller updates a user view of the distributed filesystem to present the appearance of the target file being deleted to the client, and then initiates a background deletion operation to delete the target file without negatively affecting the performance of the other users of the distributed filesystem.

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.

Abstract: The computer retrieves a list of the data elements contained in a database. The computer performs a static and dynamic analysis on the list to determine which data elements have been active in a static or dynamic Structured Query Language (SQL) statement, then removes active data elements from the list. The computer performs a dependency test to determine which data elements on the list are depended on by data objects not on the list and removes those data elements which are depended on. The computer analyzes application code to extract SQL statements and determine whether data elements on the list are active in application code SQL. Any data elements on the list which are active in application code SQL are removed from the list and the remaining data elements on the list are sorted in descending order based on size.

Abstract: Deduplicated data is packed in a self-contained deduplicated repository having unique data blocks with each being referenced by a globally unique identifier (GUID). The self-contained deduplicated repository has information regarding both deduplicated data files and the unique data blocks of each of the deduplicated data files and a master GUID list containing a location of each of the unique data blocks.

Abstract: Deduplicated data is packed in a self-contained deduplicated repository having unique data blocks with each being referenced by a globally unique identifier (GUID). The self-contained deduplicated repository has information regarding both deduplicated data files and the unique data blocks of each of the deduplicated data files and a master GUID list containing a location of each of the unique data blocks.

Abstract: According to at least one embodiment, a data storage system is provided. The data storage system includes memory, at least one processor in data communication with the memory, and a deduplication director component executable by the at least one processor. The deduplication director component is configured to receive data for storage on the data storage system, analyze the data to determine whether the data is suitable for at least one of summary-based deduplication, content-based deduplication, and no deduplication, and store, in a common object store, at least one of the data and a reference to duplicate data stored in the common object store.

Abstract: Mechanisms are provided for performing network efficient deduplication. Segments are extracted from files received for deduplication at a host connected to a target over one or more networks and/or fabrics in a deduplication system. Segment identifiers (IDs) are determined and compared with segment IDs for segments already deduplicated. Segments already deduplicated need not be transmitted to a target system. References and reference counts are modified at a target system. Updating references and reference counts may involve modifying filemaps, dictionaries, and datastore suitcases for both already deduplicated and not already deduplicated segments.

Abstract: For reducing digests storage consumption in a data deduplication system using a processor device in a computing environment, digest values are calculated for input data. The digest values are used to locate matches with data stored in a repository. The digest values are stored in the repository. The digest values of the data stored in the repository that is determined to be redundant with the input data are removed.

Abstract: Deduplication in a distributed storage system is described. A deduplication manager identifies a data item that includes multiple data chunks. The deduplication manager defines a first extent on a first node in a distributed storage system. The deduplication manager compares the first extent to existing groups of similar extents to find one of the existing groups that has extents that are similar to the first extent. The deduplication manager selects a second extent from the found group of extents. The second closely matches the first extent and removes from the first extent one or more data chunks that are included in the first extent and the second extent. The deduplication manager associates, with the first extent, a pointer to the second extent for the removed one or more data chunks.

Abstract: Embodiments for deduplication of snapshots data in a data storage by a processor. Input snapshot data is partitioned into input similarity units. An input similarity unit is deduplicated with a corresponding similarity unit of a previous snapshot. Deduplication coverage is examined. If a deduplication coverage threshold is not met, a similarity search is conducted and the input similarity unit is deduplicated with a found similarity unit.

Abstract: The present disclosure describes systems and methods for automatic synchronization of recently modified data between a plurality of devices. A device may identify newly utilized files stored on the device, and a synchronization engine may synchronize these files to one or more additional devices. The synchronization engine may record a storage location of the files on the first device, and may transmit the files for storage in a hidden directory on the other devices. After modification, a file may be synchronized back to the initial device. The synchronization engine on the initial device may retrieve the storage location of the modified file, and may replace the previous version of the file with the newly received modified file, in the original storage location. The user may view and edit recently utilized files on any device, while maintaining their original storage locations on each device and without having to manually manage files.

Abstract: Systems and methods are described for backing up files and directories using a common backup format. The files and directories may be represented by objects within a data stream constructed using the common backup format. The data streams may be traversed and updated using a size tree such that modifications are made to individual objects within the data streams without complete traversal. This process results in efficient management of storage systems as read and write operations are not dependent on exhaustive traversal of data streams.

Abstract: An apparatus is operable with a host and a data storage component for controlling expansion of storage, and comprises: an allocating component responsive to a user input for allocating an expanded target storage space to a file system element to thereby make an expanded file system element; a file system metadata component for maintaining file system metadata including metadata for said expanded file system element; a file system I/O component responsive to said file system metadata component for controlling file system I/O between said host and said storage component; and a synchronizing component responsive to said file system metadata component for synchronizing data between a source storage space and said expanded target storage space; wherein said file system I/O component is operable to use said file system metadata component to access said expanded file system element prior to completion of action of said synchronizing component.

Abstract: The disclosed embodiments provide a system that adjusts the characteristics of a distributed filesystem using a locality policy. Two or more cloud controllers collectively manage distributed filesystem data that is stored in one or more cloud storage systems; the cloud controllers cache and ensure data consistency for the stored data. During operation, a cloud controller receives a locality policy that specifies one or more management policies for the cloud controller. The portion of the distributed filesystem's data that is managed, created, and/or cached at the cloud controller is then managed based on this locality policy. Locality policies facilitate customizing and optimizing data management for the distributed filesystem to fit the needs of an organization (e.g., specific sets of users, applications, and/or datasets).

Abstract: A method for digital asset storage can begin with the maintenance of repository profiles and asset profiles by an asset accessibility advisement system for digital asset repositories. A repository profile can comprise attribute values that describe a digital asset repository. An asset profile can comprise attribute values that describe the digital assets contained in the digital asset repository. In response to an advisement request for a digital asset, an accessibility profile can be generated for the digital asset. The accessibility profile can express key attributes of the digital asset with regards to its subsequent accessibility by other entities. One or more digital asset repositories can be identified that best match the accessibility profile using the repository profiles and asset profiles. The determined digital asset repositories can then be presented as an asset accessibility recommendation.

Abstract: Aspects of the present disclosure involve systems and methods for passing optimization information, which may be used to optimize input/output (“I/O”) requests, from a database management system to a file system, using various protocols of a network file system. The optimization information provided by the database management system may relate to various aspects of an I/O request that may be optimized.

Abstract: A method of operating a virtual computer system including a file access interceptor and multiple virtual machines that are logically arranged in a virtualization environment that is managed by a virtualization environment manager is provided. The method includes reading file settings definitions that include identifications and properties of files that are configured to be accessed by a computer application, replacing operations of a file interface in the computer application using with file access interceptor operations that use the file settings to decouple file attributes from the computer application, managing file access via the file access interceptor operations to provide data file storage and read access to the files, and synchronizing file actions in each of a plurality of instances of the files. Related systems and computer program products are disclosed.

Abstract: Systems and methods for presenting social content on a map are provided. In some aspects, a method includes receiving a new content item. The new content item is not associated with a social network group comprising a set of subject members and a set of viewing members. The method also includes determining that the new content item is related to the social network group. The method also includes storing the new content item in association with the social network group. The method also includes associating the new content item with a geographic location. The method also includes providing for display a map and an indication of the social network group. The map includes a representation of the new content item. The representation of the new content item is positioned on the map proximate to the geographic location on the map.

Abstract: Systems and methods are provided for registering, curating, enabling, and controlling the use of non-locational identifiers, such as phone numbers and domain names, as physical addresses and location identifiers (LIDs) for purposes of providing instant access to enhanced cross-platform location information and services imbedded in other devices and services through an LID registry. An exemplary method for registration may include receiving a request from a requester to register a non-locational identifier owned by the requester and create an LID for a physical location, creating the LID within the LID registry by verifying that the LID is unique within the registry, that the requestor owns the LID, and registering the LID to the requestor within the LID registry. Users may then use the LIDs as physical addresses for purposes of navigation and obtaining information related to such physical locations only as authorized and controlled by the owners of such LIDs.

Abstract: An apparatus for providing standard real world to virtual world links may include a processing element configured to receive indications of an image including an object, determine whether the object corresponds to a particular object having a predefined association based on a recognition of the object, and execute a function corresponding to the predefined association in response to the object corresponding to the particular object.

Abstract: An image processing apparatus receives an input specifying a target in a first captured image group that is obtained by slicing a three-dimensional body into captured images at a first point in time, extracts feature points surrounding the specified target from the captured images of the first captured image group, specifies slice positions of each of the feature points that are extracted in captured images of a second captured image group that is obtained by slicing the three-dimensional body into the captured images at a second point in time, and outputs an image corresponding to a slice position range specified based on the specified slice positions of each of the extracted feature points, and corresponding to a range on a first plane specified based on positions of each of the extracted feature points on a second plane.

Abstract: An index is provided that holds information about each image content item in a collection of items, For each image content item, a first information item identifying the image content item and its location on a network, and at least one of (i) a second information item identifying a signature value of an object in the image content, or (ii) identification of a recognized object in the image content.

Abstract: The invention provides the ability to count symbols within drawings in an automated fashion using a computer processor. This may be accomplished by identifying a particular symbol (representing a drawing part) and then permitting the computer to search for the identified symbol in the drawing. Following the initial search, a secondary search may be performed to increase the accuracy of an initial automated count, and obtaining refined searches results representing similar parts (represented by the same symbol) but being a part type as indicated by an identifier associated with the initial symbol.

Abstract: Provided are an image processing apparatus and an image processing method thereof. The image processing method extracts at least one texture area from an input image according to at least one texture feature of an object, processing, for each texture area of the extracted at least one texture area, the texture area using an image set value respectively corresponding to the texture area, and combining the at least one texture area that is processed by the processing and outputting the combined at least one texture area.

Abstract: Techniques are described for online real time text to image translation suitable for virtually any submitted query. Semantic classes and associated analogous items for each of the semantic classes are determined for the submitted query. One or more requests are formulated that are associated with analogous items. The requests are used to obtain web based images and associated surrounding text. The web based images are used to obtain associated near-duplicate images. The surrounding text of images is analyzed to create high-quality text associated with each semantic class of the submitted query. One or more query dependent classifiers are trained online in real time to remove noisy images. A scoring function is used to score the images. The images with the highest score are returned as a query response.

Abstract: A context based tag recommendation system for annotating stock photography media files, the system configured to: maintain a first database comprising a set of media files and a set of annotations associated with the media file set, maintain a second database comprising a second set of records, each record comprising an annotation, at least one co-occurring annotation, and a count, receive at least one media file tag input (input), query the second database using the input to identify a ranked set of co-occurring annotations and a count associated with each annotation in the ranked set of co-occurring annotations, query the first database to identify a selected set of similar media files, by iteratively retrieving image files associated a selective group of annotations from the ranked set of co-occurring annotations, present a list of recommended annotations based on the ranked set of co-occurring annotations and the selected set of similar media files.

Abstract: A method and apparatus for backing up a profile of in a repository are disclosed. The method of backing up a profile is a method of backing up a profile in a subscriber management server, and includes receiving a backup request for a profile stored in an authentication module from the authentication module, providing information for at least one repository to the authentication module, the information being generated by confirming a state of the at least one repository to back up the profile according to the backup request, and storing the profile in a repository selected by the authentication module based on the information for at least one repository. Therefore, the user can directly select a reliable repository and back up the profile of the authentication module.

Abstract: A system and method for a planned migration of service connections from a first database instance to a second database instance in a clustered database. In accordance with an embodiment, a data source and connection pool enable access by a software application to a service on the first database instance. The data source is associated with a parameter specifying a delay-for-planned-draining, and a parameter specifying a planned-draining-period, which are used to rebalance connections when relocating a service. When a service is stopped on the first database instance, the connection pool receives a “service down” event from a notification service, and maintains the connections up to a time corresponding to the delay-for-planned-draining. When a “service up” event is received, the connection pool spreads migration of the connections from the first to second database instance over the planned-draining-period.

Abstract: As a conflict resolution method for the modification/editing of databases, the mechanism “for assigning priority to editing based on more up-to-date information” is disclosed. The method is effective in both full-fledged “parallel DB editing” in which a computer holds duplicated DBs permanently and the case in which a computer holds the duplicated DBs temporarily. The method is characterized in that “editing based on old information is determined to be ineffective.” When the information for which a conflict is predicted is edited, the possibility that the editing becomes ineffective can be reduced by a “substantially online operation” which performs “the synchronization with the up-to-date information, the editing, and the transmission of the editing records” quickly.

Abstract: Version control for a document can include receiving from a user a request to commit one or more revisions to a master document in a document repository. The one or more revisions can be included in a local copy of the master document. A processor can determine whether an accept only designation is assigned to at least a portion of the local copy. In response to a determination that an accept only designation is assigned to at least a portion of the local copy, the respective revisions assigned an accept only designation can be disallowed from incorporation into the master document. Revisions made to the master document can be sent to the user for incorporation into the user's local copy of the master document. Such sending is not prevented by the assignment of an accept only designation to at least a portion of the local copy of the master document.

Abstract: A content-name-resolution (CNR) system can resolve IP addresses for named data objects (NDOs) based on their name. During operation, a CNR server can receive a query from a client device for a source to a named data object. The query can include at least a name prefix for the named data object. The CNR server can identify a cache server that corresponds to the named data object's name prefix, and determines one or more sources associated with the named data object's name prefix. The CNR server then returns, to the client device, a query response that includes a network address for the cache server, and includes a content record specifying the one or more sources.

Abstract: Based on a request, a processor may identify a multi-dimensional dataset stored in the at least one of a plurality of data tables and identify each dimension of the multi-dimensional dataset. For each respective identified dimension, the processor may sort the identified dataset on values of the respective identified dimension, partition the sorted dataset into a predetermined number of intervals associated with the respective identified dimension, determine a number of rows for each interval and select a lower boundary value and an upper boundary value for each interval. The upper boundary value may be the highest value in each interval. The lower boundary value for an interval having lowest sorted values may be the lowest value in the interval or the upper boundary value of an interval having immediately preceding partitioned values. The processor may further store the boundary values and rows for each interval of each identified dimension as the histogram.

Abstract: Venn diagrams are computed for a given plurality of input sets. The process of computing the Venn diagrams is executed on columnar database systems for efficient execution. The computation of various subsets of the Venn diagrams is performed by determining subsets of various combinations of the input sets and computing set differences of the intersection sets. The process orders the execution of various steps of computing the subsets for the Venn diagram in an order that reduces the number of times an input set is loaded. Information describing various subsets of a Venn diagram is used to render the Venn diagram for display, for example, on a client device.

Abstract: A consensus search device is provided, which includes a semantic data indexing unit configured to divide text data of an electronic document written about at least one object into segments, to extract at least one semantic descriptor from the each segmented text data, and to generate a semantic data index matching each of the extracted semantic descriptor to the object and the each segmented text data. The consensus search device also includes a semantic searching unit configured to retrieve an object related to a query, based on the semantic data index. The text data is divided into the segments by units of meaning.

Abstract: A method and an apparatus for creating and using recursive index in search engines. In particular, extracting text from an index of a search engine starting at an arbitrary position in the text, and analyzing texts for co-occurrence of words, and using said extraction and analysis for inferring implicit relationships among objects in sequences thereof. As such, utility of search engines to index and retrieve information represented by a sequence of objects different from text information objects are extended. A method and an apparatus extends the basic hit with at least two word identifications, one for the previous word and one for the next word.

Abstract: A concurrent transaction validate phase with the transaction operations read, compute, and write allows for a rendezvous-based optimistic concurrency control process.

Abstract: Techniques for taking one or more nodes of a multi-node database system offline are provided. Initially, the multi-node database system uses a first data access management system (e.g., a distributed lock management system) to manage access to data stored in a database. In response to determining that one or more nodes need to be taken offline or otherwise become unavailable, the remaining nodes implement a second data access management system (e.g., an affinity-based access system) to manage access to data stored in the database. After the offline nodes are brought back online, all the nodes in the multi-node database system implement the first data access management system again. The transitions between the two data access management system may involve multiple phases that involve communicating different types of information between nodes that are taken offline and nodes that are not taken offline.

Abstract: The invention relates to a client computer for querying a database stored on a server via a network, the server being coupled to the client computer via the network, wherein the database comprises first data items and suffix items, wherein each suffix item describes a suffix of at least one first data item of the first data items, wherein for each suffix item a first referential connection exists in the database assigning said suffix item to the at least one first data item comprising the suffix of said suffix item, wherein each suffix item is encrypted with a suffix cryptographic key in the database, wherein each first data item is encrypted with a first cryptographic key in the database, wherein the client computer has installed thereon an application program, the application program being operational to: receiving a search request, the search request specifying an infix search expression, said expression comprising a first wildcard term on the left side of a search criterion and a second wildcard term o