Abstract: Methods and apparatus filter out unused information in irrelevant patterns to find an optimized relevancy group key. Such an optimized key occupies a smaller mapping space and functions to identify relevancy groups while requiring fewer computations to perform thereby improving the overall speed and performance of the processing device.

Abstract: A swarm can develop around a piece of content. The swarm can include the original content, changes to the original content, the persons contributing the changes, and metadata, such as comments contributed by members of the swarm. A swarm can also include statistics generated about the content, such as the size of the swarm, the growth and/or death rates of the swarm, the longevity of the swarm, the intensity of the swarm, the persistence of the swarm, and the direction of the swarm. Swarms and their behaviors can be used to validate or invalidate content.

Abstract: Users provide their standard username and password and are authenticated to the system. The system then determines from an object set, such as a container hierarchy, whether the user should have special administrative privileges for any of the resources on the machine to which they are logging in. These administrative privileges can be determined from configurable sets of pre-existing relationships between the user and resources on the system, stored within the object set. If the user is an administrator, then the system sets the UID number for that user to the UID number for administrator users. The system can even be configured to set the administrative UID to be the UID for the super-user “root” (typically, zero). If the user has no administrative privileges, the system sets the UID number for that user to the user's standard UID number.

Abstract: A machine-controlled method may include receiving a file in a designated shared folder on a local device, automatically providing access to the file to a social networking website or service, and directing the social networking website or service to make the file available to users that are allowed to access a particular user account at the social networking website.

Abstract: A machine receives a description of the relationships among members of a data set. The machine constructs a graph that represents the relationships among the members of the data set, organizing the members of the data set into groups. The groups are analyzed to determine their relative strengths. Unbalanced groups can be balanced by splitting off heavy sub-trees that include too large a percentage of the nodes in the group. The machine can then use the graph to answer queries about members of the data set.

Abstract: A machine receives a group of members of a data set. The machine identifies key symbols from the members of the group or the data set. The machine then calculates, for each key symbol, a weighted magnitude for the key symbol in the group. The machine can then sort the key symbols according to their weighted magnitudes, and filter out common key symbols. The uncommon key symbols, as sorted according to their weighted magnitudes, can form a name for the group.

Abstract: Methods and computer program product relate to user input auto-completion. The methods and product are executable on a processing device in a computing system environment so as to provide an auto-completion scheme with enhanced capabilities that improve user efficiency when performing a task.

Abstract: Methods and computer program product relate to the animation of data. The methods and product are executable on a processing device in a computing system environment so as to effectively empower new data files to find and make associations with other applications or principles that already have built up associations or binding with data files that are similar to the new data file.

Abstract: Methods and apparatus teach providing semantic associations between data available on one or more computing devices, including grouping together related files and creating an association between the related grouped files and at least one anchor file to provide a semantic association for the grouped files. Also is taught configuring an agent on the one or more computing devices to undertake the grouping and to create the association without a user request. Also is taught triggering an evaluation of current files against related grouped files, and creating an association between the current files and at least one of the related grouped files and the at least one anchor file. Information may be added to the created association to create additional semantic associations for one or more of the grouped files and the current files. In turn, computer program products and computing systems for accomplishing the foregoing are provided.

Abstract: A user requests to execute an application. The system authenticates the user and determines whether the user is authorized to execute the application. If the user is both authenticated and authorized to execute the application, the system grants the user permission to execute the application. Otherwise, the system denies the user permission to execute the application.

Abstract: Method and system for implementing a virtual automated teller machine (“VATM”) system are described. In one embodiment, the system includes a VATM host connectable to each of a plurality of disbursement entities (“DEs”) via a secure connection. The system further includes an accessing computer connectable to the VATM host via a secure connection, the accessing computer comprising a device for acquiring user account information and having installed thereon VATM client software executable by the accessing computer to interact with the VATM host to validate the acquired user account information and an associated PIN provided by the user. Responsive to the validation, the user is presented with a list of DEs and prompted to select one DE from the list of DEs from which funds are to be disbursed to the user and specify an amount of funds to be disbursed. The VATM host sends a disbursement order to the selected DE indicating the specified amount of funds to be disbursed.

Abstract: A customized installation, e.g. of Linux software, is created by allowing a user to select packages that the user is interested in installing. During the process, the user is informed if two of the packages that were selected will not be interoperable at run-time. The user is then given an opportunity to resolve the conflict. The user is also informed if selected packages depend on other packages that were not selected in order to run properly, and given the opportunity to include those needed packages in the installation. Once the selected packages have been validated that they will interoperate and all dependencies are satisfied, the system can install the installation.

Abstract: Methods and apparatus teach a digital spectrum of a file representing underlying original data. The digital spectrum is used to map a file's position. This position relative to another file's position reveals closest neighbors. When multiple such neighbors are grouped together they can be used to indicate relevance in current data under consideration on a same or different computing device. Also, relevance can be found without traditional notions of needing structured data or users initiating searching for relevance or by examining metadata/administrative information associated with the files. A plurality of original files represent underlying original bits of data from which a key is created in a mapping space for a relevancy topic. If new data is sufficiently close to this, it is related to the topic and presented to users. Various closeness measures are defined as are methods for key creation. Still other features contemplate computing arrangements and program products.

Abstract: Methods and apparatus teach defining an access policy to digital data available on one or more computing devices, including identifying one or more semantic attributes of at least one first digital data set and using the identified attributes to define policy dictating user access privileges. On receipt of a user request to access at least one second digital data set, semantic attributes are compared to the at least one first digital data set and access is allowed or not allowed based on the policy. Semantic attributes are selected from at least one of a closeness attribute, a relatedness attribute, and a semantic vector attribute. Also is taught configuring a policy enforcement agent on the one or more computing devices to undertake the comparing and to allow or not allow access. In turn, computer program products and computing systems for accomplishing the foregoing are provided.

Abstract: Methods and apparatus teach a digital spectrum of a file representing underlying original data. The digital spectrum is used to map a file's position. This position relative to another file's position reveals closest neighbors. When multiple such neighbors are grouped together they can be used to indicate relevance in current data under consideration on a same or different computing device. Also, relevance can be found without traditional notions of needing structured data or users initiating searching for relevance or by examining metadata/administrative information associated with the files. A dynamic relevancy agent is configured for installation on the same or different computing device to monitor events regarding the current data and to initiate the examination of relevancy. It also presents to a user suggestions of data closest to the current data. Various triggering events to undertake a relevancy examination are also described as are predetermined criteria to define relative closeness.

Abstract: Method and system for implementing a virtual automated teller machine (“VATM”) system are described. In one embodiment, the system includes a VATM host connectable to each of a plurality of disbursement entities (“DEs”) via a secure connection. The system further includes an accessing computer connectable to the VATM host via a secure connection, the accessing computer comprising a device for acquiring user account information and having installed thereon VATM client software executable by the accessing computer to interact with the VATM host to validate the acquired user account information and an associated PIN provided by the user. Responsive to the validation, the user is presented with a list of DEs and prompted to select one DE from the list of DEs from which funds are to be disbursed to the user and specify an amount of funds to be disbursed. The VATM host sends a disbursement order to the selected DE indicating the specified amount of funds to be disbursed.

Abstract: Method and system for implementing a virtual automated teller machine (“VATM”) system are described. In one embodiment, the system includes a VATM host connectable to each of a plurality of registered disbursement entities (“DEs”) via a secure connection, such as an SSL connection. The system further includes an accessing computer connectable to the VATM host via a secure connection, such as an SSL connection, the accessing computer comprising a card reader for reading user information from an ATM card and having installed thereon VATM client software executable by the accessing computer to interact with the VATM host to validate user information read from the ATM card and an associated PIN entered by a user and, responsive to the validation, present the user with a list of DEs comprising at least one of the registered DEs, prompt the user to select one DE from the list of DEs from which funds are to be disbursed to the user, and specify an amount of funds to be disbursed.

Abstract: Methods and apparatus teach a digital spectrum of a data file. The digital spectrum is used to map a file's position in multi-dimensional space. This position relative to another file's position reveals closest neighbors. Certain of the closest neighbors are grouped together, while others are differentiated. Grouping ceases upon application of a stopping function so that rightly sized, optimum numbers of file groups are obtained. Embodiments of stopping functions relate to curve types in a mapping of numbers of groups per sequential rounds of grouping, recognizing whether groups have overlapping file members or not, and/or determining whether groups meet predetermined numbers of members, to name a few. Properly grouped files can then be further acted upon.

Abstract: Methods and apparatus teach a digital spectrum of a data file. The digital spectrum is used to map a file's position in multi-dimensional space. This position relative to another file's position reveals closest neighbors. Certain of the closest neighbors are grouped together to define a set. Overlapping members in the groups may be further differentiated from one another by partitioning. An optimized partition of set S of N overlapping groups yields a maximum strength for groups and members in that partition. Among other things, the optimized partition includes relative strengths of every individual member in every possible partition and weighting functions applied to the relative strengths and to subgroups of files within the partitions.

Abstract: Methods and apparatus teach a digital spectrum of a file. The digital spectrum is used to map a file's position. This position relative to another file's position reveals closest neighbors. When multiple such neighbors are arranged, first “patterns” of data are created that further define digital spectrums of new files. It is within this sorted new data that emergent relationships or second “patterns” are examined, according to the techniques for its underlying files, or “patterns of patterns.” Representatively, original files are stored on computing devices. If encoded, they have pluralities of symbols representing an underlying data stream of original bits of data. The original files are examined for relationships between each of the files. The original relationships are converted to new files. The new files are representatively encoded and examined for other relationships.