Abstract: A system may receive a request for comments associated with a particular document, identify a comment associated with the particular document, generate an objective score for the comment that is independent of a user associated with the request, identify the user associated with the request, generate a subjective score for the comment based on parameters associated with the identified user, generate a combined score for the comment by combining the objective score and the subjective score, and provide the comment, ranked based on the combined score, to the user for presentation with the particular document.

Abstract: A system may include one or more databases to store comments relating to documents, the comments originating from first and second sources, where the comments from the first source include comments received from users via commenting functionality associated with browsers installed on client devices, and the comments from the second source include comments received from users independent of the commenting functionality associated with the browsers installed on the client devices. The system may also include one or more server devices to receive a request for comments relating to a particular document, search at least one of the one or more databases to identify comments relating to the particular document, and provide the identified comments for presentation in connection with the particular document.

Abstract: One or more server devices may determine a first reputation for a user acting in a first role and determine a second reputation for the user acting in a second role. The second role is different than the first role. The one or more server devices may further associate, in a memory associated with the one or more server devices, an identifier of the user with a first value representing the first reputation and a second value representing the second reputation. The one or more server devices may also provide a ranked list of users, the user being placed in the ranked list at a location based on the first reputation or the second reputation.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for searching for a string of characters on a web page. A user input is received containing a text search string to be identified on a web page loaded in a web browser on a computer. A common substring between the text search string and a hypertext markup language representation of the web page is determined. A document object model tree node that includes the common substring is identified. It is verified a remainder of the text search string is included in one or more surrounding nodes of the document object model tree.

Abstract: A system may identify a comment that includes a number of links, each of the links points to a corresponding document; identify one or more factors associated with each of the links, the one or more factors including at least one of: a click through rate associated with the links, explicit user feedback regarding the links, a length of an address associated with the links, a measure of popularity associated with the document corresponding to the links, or a comparison of a topic associated with the comment and a topic associated with the document corresponding to the links; assign a score to the links based on the one or more factors; select one of the links based on the assigned scores; and provide information regarding the comment to a client device for presentation in connection with presentation of the document corresponding to the selected link.

Abstract: A generational journaling data store can synchronize write accesses so that previous generation masters do not corrupt current generation journals. A master maintains a journal and accesses a data store on behalf of clients. When a master disappears a new master must take its place to ensure reliable and continuous access to the data store. Without generations, a previous master can reappear and corrupt journals and data stores. With generations, a newer generation journal can not be corrupted by a previous generation master.

Abstract: Space occupied by native code associated with a first method and stored within a native code space is reclaimed by determining whether the native code space exceeds a threshold in response to the invocation of a second method. Once the determination is made, byte code is compiled into native code associated with the second method and the native code associated with the first method may be reclaimed. In one embodiment, this reclamation occurs in response to a determination that the threshold has been exceeded and that the first method is inactive. In another embodiment, reclamation occurs in response to a determination that the threshold has been exceeded and that the first method is cold.

Abstract: An arrangement is provided for improving the performance of a computing system, specifically for improving the efficiency of code cache management for a system running platform-independent programs with a small memory footprint. The code cache of such a system is continuously monitored during runtime. When a condition warrants performing code cache management, the priority-based code cache management is performed based on selective code garbage collection. The code garbage collection is conducted selectively for dead methods in the code cache based on probabilities of the dead methods being reused.

Abstract: Lock reservation methods and apparatus for multi-threaded environments are disclosed. An example method disclosed herein comprises determining whether the thread is a lock reservation owner of a lock corresponding to the object, at least one of acquiring the lock and releasing the lock if the thread is the lock reservation owner, and directing the lock reservation owner to unreserve the lock if the thread is not the lock reservation owner.

Abstract: An arrangement is provided for improving the performance of a computing system, specifically for improving the efficiency of code cache management for a system running platform-independent programs with a small memory footprint. The code cache of such a system is continuously monitored during runtime. When a condition warrants performing code cache management, the priority-based code cache management is performed based on selective code garbage collection. The code garbage collection is conducted selectively for dead methods in the code cache based on probabilities of the dead methods being reused.

Abstract: A system includes an interface and a class configured to implement the interface. The system includes a function, the function a member of the class and a member of the interface. The system include an interface vtable, the interface vtable including a first pointer, the first pointer configured to point to the function. The system includes an object, the object an instance of the class. The object includes a second pointer, the second pointer configured to point to the interface vtable.

Abstract: Space occupied by native code associated with a first method and stored within a native code space is reclaimed by determining whether the native code space exceeds a threshold in response to the invocation of a second method. Once the determination is made, byte code is compiled into native code associated with the second method and the native code associated with the first method may be reclaimed. In one embodiment, this reclamation occurs in response to a determination that the threshold has been exceeded and that the first method is inactive. In another embodiment, reclamation occurs in response to a determination that the threshold has been exceeded and that the first method is cold.