Abstract: One or more searchable repositories of bookmark sets are stored in a computer system, each bookmark set can be downloaded to a client browser as a unit. Each bookmark set contains a set of Uniform Resource Locators (URLs) and is associated with the related information such as a set of key words, one or more topics and user specific information, the bookmark set is downloadable as a unit to the client browser. When a search query from a client containing a set of key words is received, the stored bookmark sets are searched for one or more bookmark sets associated with at least one keyword matching a keyword from the search query. A list of bookmark sets which satisfy the query, i.e. are associated with matching keywords, are returned to the client browser. Responsive to a request for downloading a selected bookmark set the selected bookmark is served to the client. The selected bookmark set is received and used by the client browser to access the set of URLs in the selected bookmark set.

Abstract: A frames-based Web browser is used with existing distributed computing environment (DCE) interfaces to facilitate and simplify management of DCE cells. In the preferred embodiment, administration may be performed from any secure Web browser acting as a client. Management data is typically supported on a target Web server. at the browser, CGI scripts are used to dynamic generate HTML (hypertext markup language) pages based on the network administrator's selections and the current state and defined objects in the DCE cell. The result is a robust and efficient Web-based DCE management scheme.

Abstract: An access control mechanism using a grouping system whereby each group is assigned a unique prime number. The resource objects to be accessed are assigned a value that is determined by multiplying all of the group prime numbers from the groups that have access to that resource. Also, each user is assigned to one or more groups and each user has an access number that is a product of the prime numbers assigned to each group. When a particular user desires access to a particular resource object, the greatest common divisor between the resource product and the user product is determined. If the resulting greatest common divisor is greater than one, then the user is allowed access. If the greatest common divisor is one (the lowest prime), the user is denied access.