Abstract: Embodiments in the disclosure are directed to the use of distributed computing to align reads against multiple portions of a reference dataset. Aligned portions of the reference dataset that correspond with an above-threshold alignment score can be assessed for the presence of sparse indicators that can be categorized and used to influence a determination of a state transition likelihood. Various tasks associated with the processing of reads (e.g., alignment, sparse indicator detection, and/or determination of a state transition likelihood) may be able to take advantage of parallel processing and can be distributed among the machines while considering the resource utilization of those machines. Different load-balancing mechanisms can be employed in order to achieve even resource utilization across the machines, and in some cases may involve assessing various processing characteristics that reflect a predicted resource expenditure and/or time profile for each task to be processed by a machine.

Abstract: A maximum lag between data stores can be specified that corresponds to a recovery point objective defined in a service level agreement. Lag can be monitored during a data replication between a primary data store and a secondary data store located in geographically different regions. Activity on the primary data store including incoming data transactions can be throttled as a function of the lag and the maximum lag.

Abstract: Systems and methods dynamically manage replicas of data sets. A collection of data stores is used to redundantly store one or more replicas of one or more data sets. The replicas may be used to respond to read requests from multiple sources. Upon identification of a need to allocate storage space to a data object, space used by one or more of the replicas is allocated to the data object. Various parameters may be utilized in the selection of one or more replicas whose storage space can be allocated to the data object. The parameters may be based at least in part on characteristics of the one or more data sets relative to one another.

Abstract: Disclosed is a micro-blog sorting method, in which micro-blog information requested by a micro-blog requesting user is acquired, micro-blog posting user information and content information are extracted from the micro-blog information to score the micro-blog information, the micro-blog information is sorted according to the score and the micro-blog information is presented according to a sorted result. With the above micro-blog sorting method, the micro-blog posting user information as well as the content information in the micro-blog information are extracted to score the micro-blog information, the micro-blog information is sorted according to the score, and the micro-blog information related to the user is sorted close to the top, and thus it is convenient for the user to view the micro-blog information. In addition, a micro-blog sorting system and a micro-blog searching and presenting method and system are also provided.

Abstract: A method, non-transitory computer readable medium, and device that replicates data and provides instantaneous access to data includes receiving in a destination volume one or more named data extents and one or more references to the one or more named data extents associated with a file in parallel from a source volume. A determination is made to check whether the one or more references arrive before the one or more named data extents arrive. Each of the received one or more references which are determined to have arrived prior to the one or more data extents is allocated as absent by the storage management computing device. An instantaneous access to the file is provided during the allocation.

Abstract: Computer-implemented systems and methods are provided for indexing and serving calendar event information. In accordance with some embodiments, information common to, and unique among, instances of a recurrent event may be determined. A markup document and search document including the common information and unique information may be generated, and a search index may be updated. Also, in accordance with some embodiments, a search query may be received and parsed, and recurrent event information can be scored as a possible search result.

Abstract: The disclosed computer-implemented method for backing up virtual machines deployed in virtual storage area networks may include (1) detecting an attempt to back up a virtual machine deployed in a virtual storage area network, (2) identifying, within the virtual storage area network, a plurality of virtual servers that are each hosting a portion of the virtual machine, (3) obtaining each portion of the virtual machine in parallel from the plurality of virtual servers within the virtual storage area network, and then (4) backing up each portion of the virtual machine obtained from the plurality of virtual servers. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A mechanism is provided in a data processing system for corpus quality analysis. The mechanism applies at least one filter to a candidate corpus to determine a degree to which the candidate corpus supplements existing corpora for performing a natural language processing (NLP) operation. Responsive to a determination to add the candidate corpus to the existing corpora based on a result of applying the at least one filter, the mechanism adds the candidate corpus to the existing corpora to form modified corpora. The mechanism performs the NLP operation using the modified corpora.

Abstract: Systems and methods herein provide for a clustered content management comprising at least two computing nodes. A first node comprises an instance of the content repository. The first computing node may perform content management operations on its instance of the content repository. Changes to the instance of the content repository of the first computing node are synchronized with the content repository by way of a second computing node. The second computing node is communicatively coupled to the first computing node through a network and is operable to synchronize the change with the content repository. The second computing node also determines that synchronization of the change is blocked due to an error. The second computing node identifies the error, determines that the error is correctable, and corrects the error to synchronize the change with the content repository.

Abstract: Various automated data flow tracking techniques can involve obtaining metadata identifying the data items from multiple data sources and using that information to identify the relationships among the data items. This information can then be provided to users. For example, a method can involve receiving a query; accessing metadata, which identifies data items generated by multiple data sources; identifying a set of responsive data items from among the available data items; identifying one or more relationships between the data items in the set of responsive data items, and responding to the query with information identifying the set of responsive data items and the one or more relationships.

Abstract: Implementations relate to storing a data file in data storages. In some implementations, a method for storing a data file in n data storages includes dividing the data file into data file parts such that at least n?1 data file parts are equal in size, and for each n?1 data file part, combining the n?1 data file parts by XOR to obtain a first data file result. The method deranges the first data file result and combines each of n?2 data file parts of the n?1 data file parts and the deranged first data file result by XOR to obtain second data file results. The method combines the first data file result and the second data file results by XOR to obtain a third data file result, and stores each of the first, second and third data file results in one of the n data storages.

Abstract: A method for synchronizing file paths associated with computer files based on file path modifications is provided. The method may include detecting a file path modification to a referenced file path associated with a computer file. The method may also include identifying a type of the file path modification. The method may further include identifying a generated file path based on the type of the file path modification. Additionally, the method may include synchronizing the referenced file path to the generated file path. The method may also include modifying the file path information associated with the computer file. The method may further include generating association information in a file properties window associated with the referenced file path and the at least one generated file path. The method may also include validating and extracting the file path information associated with the computer file for use by at least one application.

Abstract: A schema for a dataset is identified by identifying a dataset comprising data and relationships between data pairs. An original schema is identified for the dataset. This original schema comprises an organizational structure. An initial fit between the dataset and the original schema is determined. The initial fit quantifying a conformity of the data in the dataset to the organizational structure of the original schema. A plurality of additional schemas are identified. Each additional schema is a distinct organizational schema. The dataset is partitioned into a plurality of subsets. Each subset comprises a modified fit quantifying a modified conformity of subset data in each subset to one of the original schema and the additional schemas. The modified fit is greater than the original fit.

Abstract: Embodiments relate to systems and methods employing personalized query expansion to suggest measures and dimensions allowing iterative building of consistent queries over a data warehouse. Embodiments may leverage one or more of: semantics defined in multi-dimensional domain models, user profiles defining preferences, and collaborative usage statistics derived from existing repositories of Business Intelligence (BI) documents (e.g. dashboards, reports). Embodiments may utilize a collaborative co-occurrence value derived from profiles of users or social network information of a user.

Abstract: Techniques for a method for efficiently extracting data from multidimensional databases are disclosed herein. When extracting data from a subset of a multidimensional database, the method first extracts data from high-level cells within the subset. If there are any empty high-level cells, the method removes lower-level cells that roll-up into the empty high-level cell, without extracting data from these lower-level cells. The method improves the data extraction efficiency by reducing the overhead of extracting data from empty cells of multidimensional databases.

Abstract: Various embodiments provide a file processing method and system. An exemplary file processing method can include receiving a request for opening a file, applying for a memory area corresponding to the file requested for opening and setting a property of the memory area as non-readable and non-writable. After receiving a request for reading the file, the memory area corresponding to the file requested for reading can be accessed. If the accessing fails for a failure reason that the property of the memory area is non-readable and non-writable, file data requested for reading can be obtained from a disk by calling a memory access exception handler function registered in an operating system. The obtained file data can be stored in the memory area. The property of the memory area can be set as readable and writable and the file data can be read from the memory area.

Abstract: An online educational publishing platform generates an effective grade point average for respective users of the platform by aggregating data describing educational activities of the users. The educational activity data includes users' interactions with pages of content distributed by the online educational platform, as well as data retrieved from user profiles of the users and external databases. The educational activity data is filtered into a plurality of categories and scored based on scoring metrics associated with the categories. Using the scored user activity data, the publishing platform generates the effective grade point averages. Each user may have multiple eGPAs whose value depends on how the eGPA was generated. Accordingly, an eGPA provides a quantitative representation of a student's academic engagement, achievements, and experiences.

Abstract: A media device and user interface for selecting media. In one embodiment, the media is selected based upon a desired relationship measure between at least two media files. In another embodiment, the media is selected based upon a skip command control functions.

Abstract: Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries.

Abstract: A method for in-band de-duplication, the method may include receiving by a hardware accelerator, a received packet of a first sequence of packets that conveys a first data chunk; applying a data chunk hash calculation process on the received packet while taking into account a hash calculation result obtained when applying the data chunk hash calculation process on a last packet of the first sequence that preceded the received packet; wherein the calculating of the first data chunk hash value is initiated before a completion of a reception of the entire first data chunk by the hardware accelerator.