Methods, systems, and devices for dynamic response entry are disclosed herein. In some embodiments, a dynamic response entry system can include a user device that can be a proctor device or a testee device. The testee device can display a list to a testee for a predetermined time period. After the passing of the predetermined time period, the displaying of the list to the testee can be terminated. The testee can provide response to one or several questions, which responses can be input into the proctor device. The input responses can be evaluated and categorized and displayed according to the evaluation and categorization.

In an example, data from a source location is merged into a target location containing existing data, in which the source location and the target location contain tuples of data. For each tuple in the source location, during a single operation, a determination is made as to whether there is a matched tuple in the target location that satisfies a predetermined condition. For each matched tuple that satisfies the predetermined condition, the matched tuple in the target location is updated with a count value that is equal to a count of the matched tuple in the source location and the target location. In addition, for each tuple that does not have a matched tuple that satisfies the predetermined condition, the unmatched tuple is inserted into the target location.

Methods, systems, and devices for dynamic response entry are disclosed herein. In some embodiments, a dynamic response entry system can include a user device that can be a proctor device or a testee device. The testee device can display a list to a testee for a predetermined time period. After the passing of the predetermined time period, the displaying of the list to the testee can be terminated. The testee can provide response to one or several questions, which responses can be input into the proctor device. The input responses can be evaluated and categorized and displayed according to the evaluation and categorization.

A method, computer program product, and system for enhancing dynamically enhancing query results. A processor(s) obtains an inquiry from a user and determines response types and condition elements, to use to determine the unique response type of the inquiry. The processor(s) generates, per type, a response form of slot(s) for condition elements. The processor(s) utilizes the response forms to generate a sum of products expression which it transforms into a product of sums expression. The processor(s) utilizes a first sum term to generate a prompt for a further question to the user. The processor(s) obtains data responsive to the question and interprets the data into condition primitive(s). The processor(s) identifies sum terms comprising the interpreted condition primitive(s), based on comparing the interpreted condition primitive(s) to the condition elements of each sum term. If deleting the sum terms renders the expression empty, the processor(s) identifies the unique response type.

Various technologies for performing Boolean valuation of a vector of input literals over a clause set representing a search space are described herein. For each of a plurality of literals in a literal vector, state vector entries that correspond to clauses in which the literal appears are incremented. Clauses are output as results based upon determining that state vector entries corresponding to the clauses meet or exceed target vector entries corresponding to the clauses.

A portable electronic device according to the present disclosure may include a memory configured to store video data, a touch screen configured to receive a touch input related to a summary of the video data, and a controller configured to generate the summary of the video data in response to the touch input, wherein the controller extracts objects included in the video data, and detects a section in which at least one of the extracted objects appears and then disappears, and edits the video data based on the detected section to generate a summary of the video data.

A method for training system to perform text-based search among plurality of documents. The method including receiving starting document, having at least one reference-identifier associated with the document; selecting reference-text from starting document; generating search-string by using a plurality of keywords using at least one first machine learning algorithm and at least one search-operator using at least one second machine learning algorithm; performing search among plurality of documents using search-string to fetch set of relevant documents; deriving reference-identifier distribution, corresponding to the at least one reference-identifier associated with document, for the set of relevant documents; and corelating at least one reference-identifier associated with starting document with reference-identifier distribution to determine performance-score for system. The steps of method are iteratively performed until performance-score exceeds a predetermined threshold, wherein at each iteration at least one of: different search-string is generated, different reference-text is obtained, different document is received.

Systems and methods of the present invention provide for one or more server computers communicatively coupled to a network and configured to: create a data table of characters, where each character in the data table is assigned a false Boolean value; for each character found in each domain name in a DNS file, update the Boolean value to true; receive a domain search request comprising a token and a TLD; generate candidate domain names using the token and the TLD; query the database to determine if any character in the domain name has the false Boolean value in the data table; and if so, remove the domain name from the candidate domain names.

A method and system are provided. The method includes separating a predicate that specifies a set of events into a temporal part and a non-temporal part. The method further includes comparing the temporal part of the predicate against a predicate of a known window type. The method also includes determining whether the temporal part of the predicate matches the predicate of the known window type. The method additionally includes replacing (i) the non-temporal part of the predicate by a filter, and (ii) the temporal part of the predicate by an instance of the known window type, responsive to the temporal part of the temporal predicate matching the predicate of the known window type. The instance is parameterized with substitutions used to match the temporal part of the predicate to the predicate of the known window type.

A search engine optimizer which works independently and in parallel with a browser and search engine supercomputer to gather, analyze, and distill input information interactively. The optimizer reorganizes the input, and providing an optimized version as an output. The optimized version of the input (e.g. output) is sent to the search engine which responds to the end user with search results. The optimizer recognizes each request as a pattern and stores the pattern in an advanced Glyph format. This permits the optimizer to identify a left and ride side check mate combination required to achieve certitude.