Abstract: A genealogical research assistant is provided by receiving a user query at a user interface; classifying the user query using a classification module, refining the classified user query using a refinement module, vectorizing the refined, classified user query using an embeddings module; retrieving, from a vector database, a plurality of results based on the vectorized, refined, classified user query; generating, using a generative machine-learning module, a response to the user query based on the plurality of results; and displaying, at the user interface, the response. The vector database may comprise a plurality of domain-specific content the generative machine-learning module may rely upon to generate the response. The generative machine-learning module may be configured to provide in-line links to the top n results from the vector database in the response.

Abstract: A genealogy online system may cause to display, at a graphical user interface associated with a genealogy online system, a search box, the genealogy online system configured to provide functions comprising family-tree building and historical record search. The genealogy online system may receive a query from a user entered at the search box. The genealogy online system may use a machine learning language model to determine an intent of the user associated with the query. The genealogy online system may cause to display, at the graphical user interface as a result of the query, one or more links to one or more functions of the genealogy online system based on the intent determined by the machine learning language model.

Abstract: A genealogy online system may cause to display, at a graphical user interface associated with a genealogy online system, a search box, the genealogy online system configured to provide functions comprising family-tree building and historical record search. The genealogy online system may receive a query from a user entered at the search box. The genealogy online system may use a machine learning language model to determine an intent of the user associated with the query. The genealogy online system may cause to display, at the graphical user interface as a result of the query, one or more links to one or more functions of the genealogy online system based on the intent determined by the machine learning language model.

Abstract: The present disclosure is directed toward systems, methods, and non-transitory computer-readable media for generating data subclusters for content items stored in a genealogical content database and allocating computing resources to the subclusters on an individual, customized basis. For example, the disclosed systems segment stored content items according to content type to generate a number of type-specific subclusters of content items. In addition, the disclosed systems allocate different (numbers of) virtual machines of a cloud computing system to process data for each of the subclusters independently. The disclosed systems can allocate duplicate virtual machines (along with corresponding processing power and memory) to some subclusters for redundancy while allocating only a single set of virtual machines for others.

Abstract: Data-sharding systems and/or methods for cost- and time-efficient record search are described. Data-sharding embodiments utilize a name-sharding dimension, optionally in combination with one or more additional dimensions such as record type and year, to reduce latency and reduce search-associated costs. The data-sharding systems and methods embodiments utilize an optimization algorithm to determine a distribution of records related to names. The optimization algorithm may use a three-character prefix for surnames in records to distribute shards across documents, with specific shards relating to no-name and multi-name records allocated.

Abstract: Data-sharding systems and/or methods for cost- and time-efficient record search are described. Data-sharding embodiments utilize a name-sharding dimension, optionally in combination with one or more additional dimensions such as record type and year, to reduce latency and reduce search-associated costs. The data-sharding systems and methods embodiments utilize an optimization algorithm to determine a distribution of records related to names. The optimization algorithm may use a three-character prefix for surnames in records to distribute shards across documents, with specific shards relating to no-name and multi-name records allocated.

Abstract: Search-result explanation systems, methods, and computer-program products receive a user search query, expand the search query into a plurality of sub-queries, perform a database search using the expanded user search query, and determine which sub-queries of the plurality of sub-queries matched with a particular search result. Results from the database search are re-indexed in an index generated on-the-fly and in-memory, within which the results are searched using the sub-queries to determine matching fields and match types. A score is determined based on the type of match(es) with a particular search result based on one or more predefined weights and normalized using a denominator comprising a fictitious, on-the-fly record configured to receive a perfect score according to the received user search query. A user interface showing ranked results and explanations for the ranking, including a score for the result based on the expanded user search query.

Abstract: Search-result explanation systems, methods, and computer-program products receive a user search query, expand the search query into a plurality of sub-queries, perform a database search using the expanded user search query, and determine which sub-queries of the plurality of sub-queries matched with a particular search result. Results from the database search are re-indexed in an index generated on-the-fly and in-memory, within which the results are searched using the sub-queries to determine matching fields and match types. A score is determined based on the type of match(es) with a particular search result based on one or more predefined weights and normalized using a denominator comprising a fictitious, on-the-fly record configured to receive a perfect score according to the received user search query. A user interface showing ranked results and explanations for the ranking, including a score for the result based on the expanded user search query.

Abstract: The present disclosure is directed toward systems, methods, and non-transitory computer-readable media for utilizing a sophisticated lifespan filter algorithm for searching genealogical databases to accurately identify genealogical records that match a record query. For example, utilizing the lifespan filter algorithm, the disclosed systems can access and analyze data pertaining to relatives of candidate records (e.g., genealogical records that could match a record query). In some cases, for a given candidate record, the disclosed systems access genealogical data fields for a spouse, one or both parents, and/or one or more children of the individual represented by the candidate record. From the relative-data fields, the disclosed systems can determine a record lifespan for the candidate record and can compare the record lifespan with a query lifespan of the record query to determine whether the candidate record matches the record query.

Abstract: A genealogy online system may cause to display, at a graphical user interface associated with a genealogy online system, a search box, the genealogy online system configured to provide functions comprising family-tree building and historical record search. The genealogy online system may receive a query from a user entered at the search box. The genealogy online system may use a machine learning language model to determine an intent of the user associated with the query. The genealogy online system may cause to display, at the graphical user interface as a result of the query, one or more links to one or more functions of the genealogy online system based on the intent determined by the machine learning language model.

Abstract: A genealogy online system may cause to display, at a graphical user interface associated with a genealogy online system, a search box, the genealogy online system configured to provide functions comprising family-tree building and historical record search. The genealogy online system may receive a query from a user entered at the search box. The genealogy online system may use a machine learning language model to determine an intent of the user associated with the query. The genealogy online system may cause to display, at the graphical user interface as a result of the query, one or more links to one or more functions of the genealogy online system based on the intent determined by the machine learning language model.

Abstract: Search-result explanation systems, methods, and computer-program products receive a user search query, expand the search query into a plurality of sub-queries, perform a database search using the expanded user search query, and determine which sub-queries of the plurality of sub-queries matched with a particular search result. Results from the database search are re-indexed in an index generated on-the-fly and in-memory, within which the results are searched using the sub-queries to determine matching fields and match types. A score is determined based on the type of match(es) with a particular search result based on one or more predefined weights and normalized using a denominator comprising a fictitious, on-the-fly record configured to receive a perfect score according to the received user search query. A user interface showing ranked results and explanations for the ranking, including a score for the result based on the expanded user search query.

Abstract: Image-faceted search systems and/or methods are described. Image-faceting embodiments receive genealogy records certain of which are imaged genealogy records associated with an image. Metadata of the imaged genealogy records are determined or extracted and used to assign the image genealogy records to one or more categories and optionally subcategories. Machine learning may be used to extract the metadata and/or to categorize the records, along with in embodiments a translation algorithm. A user faceted search query is received, with pertinent search results filtered according to a selected facet, such as an image facet, and according to filtering criteria. The filtered search results, including images matching the faceted search query, are presented to a user.

Abstract: Data-sharding systems and/or methods for cost- and time-efficient record search are described. Data-sharding embodiments utilize a name-sharding dimension, optionally in combination with one or more additional dimensions such as record type and year, to reduce latency and reduce search-associated costs. The data-sharding systems and methods embodiments utilize an optimization algorithm to determine a distribution of records related to names. The optimization algorithm may use a three-character prefix for surnames in records to distribute shards across documents, with specific shards relating to no-name and multi-name records allocated.

Abstract: A computerized system, method, and non-transitory computer-readable medium for simulating an electronic message campaign is disclosed including establishing one or more simulated subscribers and storing an information associated with each of the one or more simulated subscribers in a database, wherein the information comprises a profile information for each of the one or more simulated subscribers, receiving one or more communications addressed to the one or more simulated subscribers, processing the one or more communications based upon the profile information for each of the one or more simulated subscribers to generate a campaign activity, and processing the campaign activity.

Abstract: A computerized system, method, and non-transitory computer-readable medium for simulating an electronic message campaign is disclosed including establishing one or more simulated subscribers and storing an information associated with each of the one or more simulated subscribers in a database, wherein the information comprises a profile information for each of the one or more simulated subscribers, receiving one or more communications addressed to the one or more simulated subscribers, processing the one or more communications based upon the profile information for each of the one or more simulated subscribers to generate a campaign activity, and processing the campaign activity.

Abstract: Methods and materials use template-directed assembly of polypeptides and optionally additional reagents to analyze the functionality of membrane-associated proteins, such as, for example, portions of transmembrane proteins, membrane-associated proteins, and others proteins that bind to transmembrane proteins and membrane-associated proteins, and to analyze the effect of test compounds or mutations on the functionality of same. The methods and materials of the present application provide a more native-like environment for analyzing the functionality of membrane-associated proteins, and thus provide effective tools for studies involving the detection of the level of enzyme activity of such proteins in an environment that closely resembles the native environment in the cell, and for novel manufacturing processes.

Abstract: Transmembrane receptors in the signaling pathways of bacterial chemotaxis systems influence cell motility by forming noncovalent complexes with the cytoplasmic signaling proteins to regulate their activity. The requirements for receptor-mediated activation of CheA, the principal kinase of the Escherichia coli chemotaxis signaling pathway, can be demonstrated using self-assembled clusters of a receptor fragment (CF) derived from the cytoplasmic domain of the aspartate receptor, Tar. Histidine-tagged Tar CF can be assembled on the surface of unilamellar vesicles via a lipid containing the Nickel-nitrilotriacetic acid moiety as a headgroup. The stability of such a complex can be controlled by the properties of the template including the size and composition, which can be used, for example, to vary the 2-dimensional concentration of receptor fragments. Surface-assembled CF is also found to serve as a substrate for receptor methylation, which is catalyzed by the receptor transferase.

Abstract: There is described a process for producing, in a continuous manner, a gradient dyeing across the width of a long strip of a plastic sheet and an apparatus used therefor. In a preferred embodiment of the invention, the orientation of the plastic strip is maintained substantially constant during the passage through a dye bath, and the dye liquid level is repetitively varied by use of a liquid level control means. This invention is particularly useful for making gradient-dyed plastic sheets which in turn are used for making sunglass lenses.

Abstract: There is described a process for producing, in a continuous manner, a gradient dyeing across the width of a long strip of a plastic sheet and an apparatus used therefor. In a preferred embodiment of the invention, the orientation of the plastic strip is maintained substantially constant during the passage through a dye bath, and the dye liquid level is repetitively varied by use of a liquid level control means. This invention is particularly useful for making gradient-dyed plastic sheets which in turn are used for making sunglass lenses.