Abstract: A system for annotating words of a data corpus based upon their particular concept and their corresponding grammatical sense with Conceptual Numerical Identifiers (CNIs) from a Conceptual Dictionary, pairing the words based on conceptual inter-relating network (CIRN) rules, and determining if a selected plurality of paired words are grammatically, syntactically, and linguistically correct by matching CNIs from each pair of words.

Abstract: Natural language vocabulary generation and usage techniques are described. In one or more implementations, one or more search results are mined for a domain to determine a frequency at which words occur in the one or more search results, respectively. A set of the words is selected based on the determined frequency. A sense is assigned to each of the selected set of the words that identifies a part-of-speech for a respective word. A vocabulary is then generated that includes the selected set of the words and a respective said sense, the vocabulary configured for use in natural language processing associated with the domain.

Abstract: Disclosed is a method and system for identifying and characterizing an analogy in a document. In one implementation, the method comprises identifying a candidate document. The candidate document comprises an analogy for a target concept, a region of interest and a linguistic marker included in the region of interest. Further, the method comprises classifying the candidate document as an analogy document or a non-analogy document based upon a size of a region of interest and a count of linguistic marker. Furthermore, the method comprises identifying a source concept from the analogy document. Subsequently, the method comprises characterizing the source concept with corresponding metadata. The metadata comprises a familiarity of the source concept, a length of the source concept, and a readability of the source concept.

Abstract: Technology is disclosed that improves language coverage by selecting sentences to be used as training data for a language processing engine. The technology accomplishes the selection of a number of sentences by obtaining a group of sentences, computing a score for each sentence, sorting the sentences based on their scores, and selecting a number of sentences with the highest scores. The scores can be computed by dividing a sum of frequency values of unseen words (or n-grams) in the sentence by a length of the sentence. The frequency values can be based on posts in one or more particular domains, such as the public domain, the private domain, or other specialized domains.

Abstract: According to one embodiment, an interpretation apparatus includes a translator, a calculator and a generator. The translator performs machine translation on a speech recognition result corresponding to an input speech audio from a first language into a second language to generate a machine translation result. The calculator calculates a word number based on a first time when the machine translation result is generated and a second time when output relating to a prior machine translation result generated prior to the machine translation result ends, the word number being 0 or larger. The generator omits at least the word number of words from the machine translation result to generate an abridged sentence output while being associated with the speech audio.

Abstract: An approach for enabling mobile device users to acquire information regarding events in their proximity on demand is described. An activity processing platform causes, at least in part, an aggregation of activity information associated with at least one device into at least one activity pool. The activity processing platform further processes and/or facilitates a processing of the at least one activity pool against one or more advancement criteria associated with one or more applications, one or more services, or a combination thereof to determine one or more recommendations with respect to the one or more applications, the one or more services, or a combination thereof.

Abstract: A tool for retargeting content from a web page to one or more devices. The tool issues, by one or more computer processors, a request to configure preferences for retargeting content from the web page. The tool receives, by one or more computer processors, a file from a first device. The tool determines, by one or more computer processors, at least one characteristic of the file. The tool matches, by one or more computer processors, the at least one characteristic of the file to an additional device. The tool outputs, by one or more computer processors, the file to the additional device.

Abstract: User-submitted content (e.g., stories) may be associated with descriptive metadata (intersection metadata), such as a timeframe, location, tags, and so on. Story content is presented in a virtual space, such as a forum, chatroom, or the like. Users submit collaborative content as the story is presented in the virtual space. The collaborative content is synchronized to presentation of the story. An author may replay the presentation and synchronized collaborative content and/or select portions of the collaborative content for inclusion in the story.

Abstract: Generating unique document identifiers from content within a selected page region is disclosed. A selection of a first region within a first page of the documents is received from a user, and is defined by a set of first boundaries relative to the first page. A text string of a first base selection page content within the first region is retrieved from the first page. Then the retrieved text string is assigned to a page location index associated with the first page. A text string of a first replicated selection page content is retrieved from a second page. The first replicated selection page content is included in the same first region defined by the set of first boundaries relative to the second page. The retrieved text string of the first replicated selection page content is assigned to a page location index of the second page.

Abstract: Software, firmware, and systems are described herein that permit an organization to dock previously-utilized, limited-feature data management modules with a full-featured data management system. By docking limited-feature data management modules to a full-featured data management system, metadata and data from the various limited-feature data management modules can be integrated and utilized more efficiently and effectively. Moreover, additional data management features can be provided to users after a more seamless transition.

Abstract: A method, and associated system, for archiving to a single database table information located across multiple database tables. At least one archival data value is identified, wherein each archival data value corresponds to a unique data value of at least one data value residing in a table of the multiple database tables, wherein each archival data value does not exceed a threshold. An end user provides the threshold used to identify the archival data values prior to execution of the method. After identifying the archival data values, the method continues by storing archive files in the single database table, each archive file comprising at least one archive data value. Finally, after storing the archive files in the single database table, the method concludes by removing from the multiple database tables each archival data value.

Abstract: Systems and methods for a multitenant computing platform. Original data is generated through operation of a computing platform system on behalf of an account of the computing platform system, and the original data is moderated according to a data retention policy set for the account. The moderated data is stored at the computing platform system. The computing platform system moderates the generated data by securing sensitive information of the generated data from access by the computing platform system, and providing operational information from the generated data. The operational information is accessible by the computing platform system during performance of system operations.

Abstract: A computer processor determines a schema that enables splitting of one or more elements of an XML file. The computer processor determines an XML file as a split candidate, based on one or more attributes of the one or more elements of the XML file. The computer processor splits the XML file at run-time into a plurality of subsets of the XML file, based on the one or more attributes of the one or more elements of the XML file, and the computer processor distributes the plurality of subsets of the XML file to a plurality of computing nodes of a computer processing system.

Abstract: Systems and methods for data storage management technology that optimizes the creation and storage of file objects. The method includes: receiving a request to create a file object; storing a first portion of the file object in a buffer in a first data storage; determining a location in a second data storage in view of a predicted size of the file object; migrating the first portion of the file object from the buffer to the location in the second data storage; and in response to receiving a second portion of the file object, storing the second portion in the second data storage without storing the second portion in the buffer in the first data storage.

Abstract: Systems and methods are provided herein for establishing data constructs necessary for efficient and transparent tiering of data from local storage to cloud storage, and there use in transferring data to and from cloud storage. Files data can split into chunks and stored as individual objects in cloud storage. A stub file can replace the local file in local storage and describe a mapping of cloud objects that contain data to specific regions of the file. Upon creation of the stub and transfer of data to cloud storage, local storage capacity previously dedicated to file data can be freed for other uses.

Abstract: Metadata for a plurality of database storage regions within memory are merged, where the metadata for each storage region comprises an interval including first and second interval values indicating a value range for values within that storage region. The first and second interval values are examined to identify overlapping storage regions and produce a sum of overlapped storage regions. The sum of overlapped storage regions is compared to a threshold and the metadata of the overlapped storage regions are merged based on the comparison.

Abstract: Techniques are disclosed for a swipe based file manager navigation mode in electronic computing devices, such as a touch screen device. Digital files may be organized in a hierarchical or treelike file manager capable of having multiple directory or folder levels. Folders (or directories) may allow a user to group files into separate collections, and folders may be organized within other folders. In some embodiments, the navigation mode may allow a user to navigate through or access the directory levels of the file manager using vertical swipe gestures. In some such embodiments, a vertical gesture performed to access a child (lower) directory level may have to be performed over the directory or folder to be accessed. As the user navigates through the directory levels, the navigation mode may be configured, in some embodiments, to provide animations.

Abstract: Identification of data candidates for data processing is performed in real time by a processor device in a distributed computing environment. Data candidates are sampled for performing a classification-based compression upon the data candidates. A heuristic is computed on a randomly selected data sample from the data candidate, the heuristic computed by, for each one of the data classes, calculating an expected number of characters to be in a data class, calculating an expected number of characters that will not belong to a predefined set of the data classes, and calculating an actual number of the characters for each of the data classes and the non-classifiable data.

Abstract: Various embodiments for differentiating between data and stubs pointing to a parent copy of deduplicated data. Undeduplicated data is stored with a checksum of an initial value. A stub pointing to the parent copy of the deduplicated data is stored with an additional checksum of a differing, additional initial value.

Abstract: A method for sharing documents between on-demand services is provided. In an embodiment, a user of a first on-demand service may be able to view a list of content that includes content stored at the first on-demand service and content stored at a second on-demand service. The content of the second on-demand service may be associated with information about the content, allowing the content to be shared among multiple users of the first on-demand service. The user wanting to view the content, select or click on an indicator identifying the content, a connection to the second on-demand service is established, and images of the content are sent from the second on-demand service to the first on-demand service.

Abstract: In one embodiment, a synchronization engine 116 of an application module 114 may adjust a synchronization scheme 306 based on the implicit data classification of a data item. A synchronization engine 116 may detect a user action 406 executed by a user on a data item 402. The synchronization engine 116 may determine an action type 408 for the user action 406. The synchronization engine 116 may assign an item synchronization priority to the data item 402 based on the action type 406.

Abstract: In some examples, a distributed file system is described. The distributed file system may include multiple data nodes and a director unit. The multiple data nodes may each include one or more data blocks. The director unit may include multiple master nodes configured in a peer-to-peer distributed architecture and operably coupled to the multiple data nodes. Each of the master nodes may be configured to receive a task related to managing data with respect to the distributed file system; to manage a distribution of the task among one or more of the plurality of master nodes; and to communicate a task status and a status of at least a part of the distributed file system to each of the other master nodes.

Abstract: An aspect of the present invention reduces blocking instances in parallel processing systems performing operations on trees. In one embodiment, a change operation is performed in a first execution entity and a traversal operation is performed in a second execution entity, with both the change operation and the traversal operation being designed to operate on a same node of a tree, and with the first execution entity and the second execution entity being executed concurrently in a digital processing system. A non-blocking access of the same node to both of the first execution entity and the second execution entity is permitted, thereby enabling the change operation and the traversal operation to be performed concurrently.

Abstract: For data backup and recovery based on linked file repositories with each of the linked file repositories representing an individual file system capable of storing at least one version of a file and being connected to at least one server system, each of the linked file repositories are placed in a certain position for storing a certain version of the file. Each position of each of the linked file repositories is continuously numbered. A number of the versions of the file are determined by the position of the one of the linked file repositories.

Abstract: Method and computer program product for navigating a map in a browser window of a user device via the Internet are disclosed. The method includes providing a first map for showing geographic context of a general area, providing a second map for showing geographic context of a portion of the general area, superimposing the second map onto the first map, wherein the second map is represented by a highlighted area in the first map, and navigating the first map using the highlighted area. The method further includes displaying points of interest inside the highlighted area of the first map and in the second map for assisting a user in navigating to the points of interest, and displaying additional points of interest outside the shaded area of the first map for assisting a user in navigating to the additional points of interest.

Abstract: Client-side and server-side methods for displaying event data within a map that is displayed on a computing device are presented. In an example, the method includes receiving a request for mapping data including a request location defining a current geographic location of the client computing device, determining a request time corresponding to the request, the request time based on a time the mapping data request was sent by the client computing device. The method also includes retrieving mapping data corresponding to the request location and determining that an event in an event database includes an event time that occurs within a threshold time of the request time. The method further includes retrieving event data corresponding to the event that occurs within the threshold time of the request time and sending the retrieved mapping data and the retrieved event data to the client computing device in response to the request.

Abstract: Search systems and computer-implemented search methods are described. In one aspect, a search system includes a communications interface configured to access a plurality of data items of a collection, wherein the data items include a plurality of image objects individually comprising image data utilized to generate an image of the respective data item. The search system may include processing circuitry coupled with the communications interface and configured to process the image data of the data items of the collection to identify a plurality of image content facets which are indicative of image content contained within the images and to associate the image objects with the image content facets and a display coupled with the processing circuitry and configured to depict the image objects associated with the image content facets.

Abstract: Image similarity operations are performed in which a seed image is analyzed, and a set of semantic classifications are determined from analyzing the seed image. The set of semantic classifications can include multiple positive semantic classifications. A distance measure is determined that is specific to the set of semantic classifications. The seed image is compared to a collection of images using the distance measure. A set of similar images is determined from comparing the seed image to the collection of images.

Abstract: An image search device includes a common memory and a plurality of parallel processors for executing a same instruction. The image search device transfers, from storage, a plurality of representative feature vectors, which respectively represent a plurality of clusters including a plurality of image feature vectors, stores, in the common memory, one or more query feature vectors extracted from an image serving as a query, calculates a distance between the plurality of transferred representative feature vectors and the query feature vector using the plurality of parallel processors, and selects one or more of a plurality of images based on a distance between the plurality of image feature vectors, which belong to the cluster selected by the calculated distance, and the query feature vector.

Abstract: One or more techniques and/or systems are disclosed for displaying images in a user's online page, such as to provide an engaging and interesting user experience. A subset of one or more images is identified from a set that comprises user accessible images. Images for the subset are identified selecting one or more images from the set of user accessible images that meet a desired user interest threshold. The subset of selected images is then loaded onto the user's online page, such as an online service landing page, in an arrangement (e.g., slide show) of the images.

Abstract: An image display apparatus which displays a list of image data, comprises a selection unit configured to select a classification condition of image data; a designation unit configured to designate a sort condition associated with a sorting order of image data; a grouping unit configured to execute grouping of image data according to the classification condition selected by the selection unit; a determination unit configured to determine whether or not to execute the grouping according to the classification condition selected by the selection unit and the sort condition designated by the designation unit; and a control unit configured to control whether or not image data are grouped and displayed in accordance with a determination result of the determination unit.

Abstract: A method begins by a dispersed storage (DS) processing module ascertaining processing speeds of distributed storage and task (DST) execution units where the DST execution units receive a set of encoded data slices that includes a sub-set of data-based data slices. The method continues with the DS processing module allocating task performance on the sub-set of data-based data slices to a sub-set of DST execution units, where a first DST execution unit is allocated to perform a first partial task on a first data-based data slice of the sub-set of data-based data slices. When a second DST execution unit has a processing speed that is a threshold speed greater than a processing speed of the first DST execution unit, the method continues with the DS processing module identifying at least one encoded block of the first data-based data slice for transferring processing responsibilities to the second DST execution unit.

Abstract: Recovering data to a point in time before pending definition changes are materialized in a relational database management system. One or more definition changes to a database schema are received. Original data base schema attributes are saved as point in time metadata in a catalog table until the one or more definition changes have been materialized. During recovery processing, it is determined for each object being recovered whether the object is being recovered to a point in time prior to which the one or more definition changes were materialized. In response to determining that an object is being recovered to a point in time prior to which the one or more definition changes were materialized, the saved point in time metadata is used for the object in the recovery process.

Abstract: Recovering data to a point in time before pending definition changes are materialized in a relational database management system. One or more definition changes to a database schema are received. Original data base schema attributes are saved and maintained as point in time metadata in a catalog table until the one or more definition changes have been materialized. During recovery processing, it is determined for each object being recovered whether the object is being recovered to a point in time prior to which the one or more definition changes were materialized. In response to determining that an object is being recovered to a point in time prior to which the one or more definition changes were materialized, the saved point in time metadata is used for the object in the recovery process.

Abstract: A mechanism is provided for creating modules from an XML schema. The mechanism includes creating a syntax tree from a sample XML fragment of the XML schema, creating a module with a list of parameters based on the syntax tree, identifying variable pieces of information in the syntax tree to be inserted in the list of parameters with a variable sign, and inserting the variable information into the list of parameters. The mechanism includes inserting another module in the syntax tree of the module, in which the other module corresponds to another sample XML fragment and has another list of parameters, and identifying the other module with the variable sign in the syntax tree of the module. The mechanism includes inserting the other module into the list of parameters of the module in which the other module to serve as a parameter, and providing an option for constraining the module.

Abstract: Provided are techniques for determining whether a character code point value of a first plurality of character code point values corresponds to a second character code point value from a second plurality of character code point values, first value associated with a first encoding version and the second value associated with a second encoding. In response to the first value does not corresponding to any of the second character code point values, a determination is made as to whether the value corresponds to a third character code point value of a third plurality of code point values stored in a character value record table (CVRT). In response the value corresponding to the third value, an entry in the CVRT that associates the character with the third value is made; and the character is stored in conjunction with an application associated with the second encoding using the third value.

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: A machine-implemented method includes establishing a virtual or augmented reality entity, and establishing a state for the entity having a state time and state properties including a state spatial arrangement. The data entity and state are stored, and are subsequently received and outputted at a time other than the state time so as to exhibit a “virtual history machine” functionality. An apparatus includes a processor, a data store, and an output. A data entity establisher, a state establisher, a storer, a data entity receiver, a state receiver, and an outputter are instantiated on the processor.

Abstract: A document management apparatus includes a reception unit, an operation information extraction unit, a memory, an executability determination unit, and an operation execution unit. The reception unit receives an operation request for an electronic document from an operator. The operation information extraction unit extracts operation information related to the operation request. The memory stores operation history information which is an accumulation of previous operation information which is operation information related to previous operation requests previously made for electronic documents. The executability determination unit reads the operation history information from the memory to determine whether or not an operation pertaining to the operation request is executable on the basis of the operation information and the operation history information.

Abstract: A method, of managing storage of content of a system (400) in storage units (430) including run units which do not allow spin-down functionality and spin-down units which allow spin-down functionality, comprises: establishing a storage tiering rule (702) which sets a policy indicating what content is eligible to be stored on a run unit and what content is eligible to be stored on a spin-down unit, the storage tiering rule being applicable to at least a group of the contents in the content system to determine stored content eligibility thereof for storage in the storage units and migration between the storage units; and identifying candidates of contents to migrate between the storage units (706), based on the storage tiering rule, state of the content system, and the stored content eligibility of the at least a group of the contents.

Abstract: A sparse dataset structure is created by creating column vectors for one or more columns in a dataset that have at least one significant value. Each column vector includes data values for columns of the dataset. Each column vector that is a sparse column vector includes a look-up index array and a value array. Entries in the look-up index array represent columns. The value array includes values for a row in a column. Each entry in the value array points to a row entry in the look-up index array. A side structure includes a row index and a column index. The row index includes a location for an entry for each row where entries point to a location in the column index that identifies a column that has a first significant entry for a row. Alternatively a sparse dataset could be constructed with sparse rows.

Abstract: A data storage method and apparatus. The method includes: determining a same column attribute of at least two data objects that are to be stored in a KeyValue type distributed database; determining a format of a row identifier of each data object of the at least two data objects, where the row identifier format includes the same column attribute and a data object identifier; determining a row identifier value of each data record of each data object according to the determined row identifier format of each data object; and storing each data record and the row identifier value of each data record, where the row identifier value of each data record is used as a primary index. The data storage method and apparatus in embodiments of the present invention can improve data query efficiency.

Abstract: At least first nodes and second nodes of a decision tree are stored within a memory of an information handling system. The first nodes include a first parent node and first remaining nodes that descend from the first parent node. The second nodes include a second parent node and second remaining nodes that descend from the second parent node. The first nodes are grouped into a first packed node stored in first physically contiguous locations of the memory. The first nodes are sequenced in the first physically contiguous locations according to respective depth levels of the first nodes within the decision tree. The second nodes are grouped into a second packed node stored in second physically contiguous locations of the memory. The second nodes are sequenced in the second physically contiguous locations according to respective depth levels of the second nodes within the decision tree.

Abstract: An approach is provided to determine one or more dynamic ordered tree structures and transition tree structures (e.g., based on one or more transitions of a device) to facilitate querying and/or accessing data stores. An apparatus and method determines to generate at least one index structure, determines to associate index objects of the generated index structure with one or more data objects of at least one data store, determines to generate at least one transition index structure based on the at least one generated index structure, and determines to associate the transition index structure with index objects corresponding to one or more data objects of at least one data store based on a transition of a device. Also, the method and apparatus determines to generate at least one query, and determines to generate at least one transition index structure where a current index structure to resolve the query is absent.

Abstract: Disclosed herein is a technique for providing status feedback on the execution of a database request. The technique involves receiving a database request that defines an operation to be performed on at least one data record stored in a database. The data record is updated in the database in accordance with the operation, and one or more tasks that are to be performed in connection to the operation are scheduled for execution. A first version of a receipt is generated and provided to the application, and includes, for each of the one or more tasks, a status field that indicates a progress of executing the task. The method further includes the steps of, in response to a change in the execution of any of the one or more tasks, updating the status fields to produce a second version of the receipt, which is then provided to the application.

Abstract: A system and method for performing coarse-grained deduplication of volume regions. A storage controller detects that a first region of a first volume is identical to a second region of a second volume, wherein the first volume points to a first medium and the second volume points to a second medium. In response to detecting the identical regions, the storage controller stores an indication that the first range of the first medium underlies the second range of the second medium. Also in response to detecting the identical regions, the mappings associated with the second range of the second medium are invalidated.

Abstract: In one embodiment, a method includes accessing a mapping that represents a correspondence between a column in a source database and a column in a temporary storage table, in response to receiving a data operation request to execute a data operation on a column of the source database. The method further includes changing the temporary storage table by executing the data operation on the temporary storage table and performing a reconstruction operation using data from the temporary storage table and the source database.

Abstract: Systems and methods for detecting legacy storage devices that may falsely and/or incorrectly report to host systems that they have removable media. Such false or incorrect reporting may cause the host system to periodically poll the storage device as to whether the device is ready for I/O processing. Such polling would be unnecessary and represent a waste of power expended by the host system. In one embodiment, the present system may implement processes that periodically poll storage media and update a database. The database would be a listing of storage devices indicating whether they truly have removable media or falsely report that they have removable media. In another embodiment, the present system may apply some heuristically testing to determine whether a storage device so falsely indicates removable media. In another embodiment, telemetry service may be used by a group of hosts to share data regarding such storage devices.

Abstract: In one embodiment, a method includes accessing a prior structured query previously selected by a first user of an online social network, where the prior structured query corresponds to a first set of search results and comprises references to one or more objects associated with the online social network, identifying changes to the first set of search results corresponding to the prior structured query, and sending, to a client system of the first user, one or more suggested structured queries for display to the first user, where at least one of the suggested structured queries is a dynamic query comprising at least a portion of the prior structured query and a reference to the identified changes to the first set of search results corresponding to the prior structured query.

Abstract: Embodiments include generating data models that may give semantic meaning for unstructured or structured data that may include data generated and/or received by search engines, including a time series engine. A method includes generating a data model for data stored in a repository. Generating the data model includes generating an initial query string, executing the initial query string on the data, generating an initial result set based on the initial query string being executed on the data, determining one or more candidate fields from one or results of the initial result set, generating a candidate data model based on the one or more candidate fields, iteratively modifying the candidate data model until the candidate data model models the data, and using the candidate data model as the data model.