Abstract: Detection of redundant or duplicate method calls in a running program is provided. One or more methods can be selectively called when a program is running. Specified data is collected each time that a call to a given one of the methods occurs, wherein a given call to the given method is associated with a set of arguments comprising one or more particular argument values for the given method. The collected data includes an element uniquely identifying each of the particular argument values. The collected data is stored at a selected location, and a call threshold is selected for the given method, wherein the call threshold comprises a specified number of occurrences of the given call to the given method. The collected data is selectively analyzed at the storage location, to determine whether an occurrence of the given call to the given method has exceeded the call threshold.

Abstract: Embodiments of the invention use an automated procedure to detect the occurrence of redundant or duplicate method calls in a running program. Software developers may then be notified of the redundant calls, and correct the redundancies if necessary. One embodiment, directed to a process or inventive method, is associated with a program disposed to run on a data processing system, wherein the program is provided with one or more methods that can be selectively called when the program is running. The process includes the step of collecting specified data each time that a call to a given one of the methods occurs, wherein a given call to the given method is associated with a set of arguments comprising one or more particular argument values for the given method, and the collected data includes an element uniquely identifying each of the particular argument values.

Abstract: The present invention is a system, method and apparatus for self-tuning cache management. In a preferred aspect of the invention, a self-tuning cache can include a primary cache and at least two test caches. A first one of the test caches can have a cache size which is smaller than a size of the primary cache. A second one of the test caches can have a cache size which is greater than the size of the primary cache. A cache engine can be programmed to manage the primary cache and the test caches. importantly, a cache tuner can be coupled to the primary and test caches. The cache tuner can include a configuration for resizing the primary cache when one of the at least two test caches demonstrates cache performance which justifies resizing the primary cache.

Abstract: The present invention is a system and method for handling personally identifiable information, using a rules model. The invention involves defining a limited number of privacy-related actions regarding personally identifiable information; constructing a rule for each circumstance in which one of said privacy-related actions may be taken or must be taken; allowing for the input of dynamic contextual information to precisely specify the condition for evaluation of a rule; creating a programming object containing at least one of said rules; associating the programming object with personally identifiable information; processing a request; and providing an output. The invention does not merely give a “yes-or-no answer. The invention has the advantage of being able to specify additional actions that must be taken. The invention may use a computer system and network. One aspect of the present invention is a method for handling personally identifiable information.

Abstract: The present invention is a system and method for handling personally identifiable information, using a rules model. The invention involves defining a limited number of privacy-related actions regarding personally identifiable information; constructing a rule for each circumstance in which one of said privacy-related actions may be taken or must be taken; allowing for the input of dynamic contextual information to precisely specify the condition for evaluation of a rule; creating a programming object containing at least one of said rules; associating the programming object with personally identifiable information; processing a request; and providing an output. The invention does not merely give a “yes-or-no answer. The invention has the advantage of being able to specify additional actions that must be taken. The invention may use a computer system and network. One aspect of the present invention is a method for handling personally identifiable information.

Abstract: A graphical user interface tool is provided to help users design privacy policies. The interface allows the user to group, manipulate, and describe the data used by a Web site. A data elements portion of the interface allows the user to view predefined data elements and to create additional data elements. The properties of the data elements may be viewed and modified. The data elements are displayed according to the hierarchical schema defined by the P3P specification. A groups portion of the interface allows the user to create groups of data elements that share common properties, such as how the recipient will use the data. A group may be populated with instances of data elements from the data elements portion of the interface. A policy portion of the interface displays descriptions of the policy in several forms. Statements in the policy are formed from the groups in the groups portion of the interface.

Abstract: A graphical user interface tool is provided to help users design privacy policies. The interface allows the user to group, manipulate, and describe the data used by a Web site. A data elements portion of the interface allows the user to view predefined data elements and to create additional data elements. The properties of the data elements may be viewed and modified. The data elements are displayed according to the hierarchical schema defined by the P3P specification. A groups portion of the interface allows the user to create groups of data elements that share common properties, such as how the recipient will use the data. A group may be populated with instances of data elements from the data elements portion of the interface. A policy portion of the interface displays descriptions of the policy in several forms. Statements in the policy are formed from the groups in the groups portion of the interface.

Abstract: A technique, system, and computer program for improving access to shared resources in a computing system. The shared resources are grouped into application-defined resource sets. Mutual exclusion semaphores are used. A semaphore is associated with each resource set to provide mutually-exclusive (serialized) access to the resources in the set. The number of semaphores will be smaller (typically, much smaller) than the number of resource sets, so that a given semaphore will be associated with multiple of such sets. Thus, the set of semaphores is striped across the collection of resource sets. This greatly increases allowable parallelism in accessing shared resources, while reducing the number of semaphores that are required.