Abstract: A rotary tablet press having a rotatably driven rotor and a die plate with a plurality of die bores. A plurality of upper and lower punches are configured to produce tablets in the plurality of die bores. The tablets are monitored for one or more characteristics and are sorted by an ejection apparatus according to the one or more characteristics into a reject channel and a satisfactory channel.

Abstract: A rotary tablet press having a rotatably driven rotor and a die plate with a plurality of die bores. A plurality of upper and lower punches are configured to produce tablets in the plurality of die bores. The tablets are monitored for one or more characteristics and are sorted by an ejection apparatus according to the one or more characteristics into a reject channel and a satisfactory channel.

Abstract: A computer implemented method for managing a password is disclosed. The method can include generating a first hash value corresponding to a first password. The method can also include determining whether the first hash value corresponds with a second hash value included in the set of hash values. Further, the method can include suppressing storage of the first password in the set of passwords in response to determining that the first hash value corresponds with a second hash value included in the set of hash values.

Abstract: A computer implemented method for managing a password is disclosed. The method can include generating a first hash value corresponding to a first password. The method can also include determining whether the first hash value corresponds with a second hash value included in the set of hash values. Further, the method can include suppressing storage of the first password in the set of passwords in response to determining that the first hash value corresponds with a second hash value included in the set of hash values.

Abstract: One or more processors provide a first instruction to a first user. One or more processors receive a user input in response to the first instruction provided to the first user. One or more processors determine whether the user input is a correct response to the first instruction. Responsive to determining that the first user input to the first instruction is the correct input, one or more processors provide a second instruction to the first user.

Abstract: A method includes receiving a request from a source service, determining whether the target service associated with the request supports a by-reference evaluation strategy, determining whether an information object associated with the request is a data reference, retrieving data associated with the reference from a database, adding the data to the information object, and invoking the target service and passing the information object to the target service responsive to determining that the target service does not support the by-reference strategy and the information object is a data reference.

Abstract: A computer generates a modified list of search terms by adding synonyms of the search terms and terms that are related to the search terms to a list of search terms. The computer removes frequently used words from the modified list of search terms. The computer responds to a determination that a user has authorization to view a field of a document by adding to the modified list of search terms an encrypted version of a search term included in a list of search terms. A search using the modified list of search terms returns a result that identifies the document as a search result when either the unencrypted or the encrypted version of the search term is found in a list of index terms associated with the first document.

Abstract: Aspects of the present invention disclose a method, computer program product, and system for managing web searching. The method includes one or more processors tracking user activity on the at least one website. The method further includes one or more processors analyzing the tracked user activity on the at least one website. The method further includes one or more processors generating a user profile based on the tracked user activity on the at least one website. The method further includes one or more processors mapping the generated user profile and corresponding user identity information between one or more of: a search service provider, an analytic service provider, and a provider of the at least one website. The method further includes one or more processors storing the generated user profile.

Abstract: A computer generates a modified list of search terms by adding synonyms of the search terms and terms that are related to the search terms to a list of search terms. The computer removes frequently used words from the modified list of search terms. The computer responds to a determination that a user has authorization to view a field of a document by adding to the modified list of search terms an encrypted version of a search term included in a list of search terms. A search using the modified list of search terms returns a result that identifies the document as a search result when either the unencrypted or the encrypted version of the search term is found in a list of index terms associated with the first document.

Abstract: A computer implemented method for managing a password is disclosed. The method can include generating a first hash value corresponding to a first password. The method can also include determining whether the first hash value corresponds with a second hash value included in the set of hash values. Further, the method can include suppressing storage of the first password in the set of passwords in response to determining that the first hash value corresponds with a second hash value included in the set of hash values.

Abstract: A computer implemented method for managing a password is disclosed. The method can include generating a first hash value corresponding to a first password. The method can also include determining whether the first hash value corresponds with a second hash value included in the set of hash values. Further, the method can include suppressing storage of the first password in the set of passwords in response to determining that the first hash value corresponds with a second hash value included in the set of hash values.

Abstract: A computer determines, based on a degree of authorization of a user, that a user has authorization to view a type of field. Based on the degree of authorization of the user, the computer generates a modified list of search terms by adding additional search terms to a list of search terms. The computer executes a search using the modified list of search terms. The computer identifies a search result that includes the first type of field which further includes a search term that is included in the modified list of search terms.

Abstract: A computer determines, based on a degree of authorization of a user, that a user has authorization to view a type of field. Based on the degree of authorization of the user, the computer generates a modified list of search terms by adding additional search terms to a list of search terms. The computer executes a search using the modified list of search terms. The computer identifies a search result that includes the first type of field which further includes a search term that is included in the modified list of search terms.

Abstract: A computer determines, based on a degree of authorization of a user, that a user has authorization to view a type of field. Based on the degree of authorization of the user, the computer generates a modified list of search terms by adding additional search terms to a list of search terms. The computer executes a search using the modified list of search terms. The computer identifies a search result that includes the first type of field which further includes a search term that is included in the modified list of search terms.

Abstract: A computer determines, based on a degree of authorization of a user, that a user has authorization to view a type of field. Based on the degree of authorization of the user, the computer generates a modified list of search terms by adding additional search terms to a list of search terms. The computer executes a search using the modified list of search terms. The computer identifies a search result that includes the first type of field which further includes a search term that is included in the modified list of search terms.

Abstract: A reference string set including a group of strings is set. At least two specific tuples of substring triples is found inside the reference string set of strings. Each tuple is considered as a candidate for representing a related concept. Each concatenation of the substrings triples is an explicit member of the reference string set. Each middle substring of the substring triples is unequal to another middle substring within the substring triples found inside the reference string set. Each prefix substring is equal to all other prefix substrings within the substring triples found inside the reference string set. Each suffix substring is equal to all other suffix substrings within the substring triples found inside the reference string set. Either the prefix substring or the suffix substring is not empty.

Abstract: The present invention relates to the field of computer programming. More specifically the invention relates to a method and a data processing system for editing the source code of a computer program. It is an object of the present invention to provide an easy source code editing technique, by which programming errors and type errors can reliably be avoided in cases where changes to the program are supposed not to change the semantics of the program. This object is achieved according to the invention by a method for editing source code, the method comprising the steps of: receiving a modification to the source code, said modification being made by a user, determining whether the modification would change the semantics of the source code, and handling the modification depending on the result of the determining step.

Abstract: A reference string set including a group of strings is set. At least two specific tuples of substring triples is found inside the reference string set of strings. Each tuple is considered as a candidate for representing a related concept. Each concatenation of the substrings triples is an explicit member of the reference string set. Each middle substring of the substring triples is unequal to another middle substring within the substring triples found inside the reference string set. Each prefix substring is equal to all other prefix substrings within the substring triples found inside the reference string set. Each suffix substring is equal to all other suffix substrings within the substring triples found inside the reference string set. Either the prefix substring or the suffix substring is not empty.

Abstract: A method for editing source code includes receiving a modification to the source code made by a user, determining whether the modification would change the semantics of the source code, and handling the modification depending on the result of the determining.

Abstract: A conceptualization method uses maximum or other substrings of a string pattern to find specific N-tuples of substring triples with N?2 and m=1 . . . N inside a reference set (SET_r_i) of strings (STR_n_i). Each N-tuple is considered as a candidate for representing related concepts. Each concatenation of the substrings triples is an explicit member of the reference set (SET_r_i). Each middle substring out of middle substrings is unequal to another middle substring out of middle substrings within the substring triples found inside the reference set (SET_r_i). Each prefix substring (X_i) is equal to all other prefix substrings (X_i) within the substring triples found inside the reference set (SET_r_i). Each suffix substring (Z_i) is equal to all other suffix substrings (Z_i) within the substring triples found inside the reference set (SET_r_i). Either the prefix substring (X_i) or the suffix substring (Z_i) is not empty.