Abstract: An osteogenic implant with improved osteointegration properties, this implant being made of titanium metal or a titanium-based alloy and being suitable for implantation in bones, said implant having a roughened surface, which in the hydroxylated state has been at least partially covered with a compound which comprises in the molecule at least two groups which are, independently of one another, a primary amino group, a secondary amino group, a carboxyl group, an amide group, a phosphano group and/or hydroxyl, or with a mixture of such compounds.

Abstract: A technique is provided for reducing the number of write barriers executed in mutator code without compromising garbage collector performance. Advantageously, a compiler generates two forms of a mutator code—a first version with write barriers and a second version substantially without write barriers. In operation, the first version of the code may be accessed by a vtable in a “mature” near-class and the second version may be accessed by a vtable in a “nascent” near-class. According to the invention, mapping of functionally equivalent points in the first and second versions of the mutator code may be facilitated by an associated pcmap. Further, each of the first and second versions may also be associated with a respective nr_map that facilitates mapping functionally equivalent points within different branches of guard code sequences corresponding to reference-writes to non-receiver objects.

Abstract: In a garbage collector that employs the train algorithm, the collector identifies cars that are located far back in the collection order but already have large remembered sets, and it advances their collection. One way of doing so includes advancing a car's nominal position in the collection order, placing it nominally ahead of erstwhile “older” cars as well as actually. Another way does not include changing the advanced car's nominal position. The advancement operation is simpler with the latter approach, but normal updating is simpler with the former. Although both approaches tend to increase the number of entries in the remembered set of the car thus advanced, they actually reduce the overall memory cost of remembered-set maintenance.

Abstract: A method and system for evaluating a set of credentials that includes at least one group credential and that may include one or more additional credentials. A trust rating is provided in association with the at least one group credential within the set of credentials and trust ratings may also be provided in other credentials within the set of credentials. Each trust rating provides an indication of the level of confidence in the information being certified in the respective credential. In response to a request for access to a resource or service, an evaluation of the group credentials is performed by an access control program to determine whether access to the requested resource or service should be provided. In one embodiment, within any given certification path a composite trust rating for the respective path is determined. An overall trust rating for the set of credentials is determined based upon the composite trust ratings.

Abstract: An electroluminescent device comprising: a first charge carrier injecting layer for injecting positive charge carriers; a second charge carrier injecting layer for injecting negative charge carriers; and a light-emissive layer located between the charge carrier injecting layers and comprising a mixture of: a first component for accepting positive charge carriers from the first charge carrier injecting layer; a second component for accepting negative charge carriers from the second charge carrier injecting layer; and a third, organic light-emissive component for generating light as a result of combination of charge carriers from the first and second components; at least one of the first, second and third components forming a type II semiconductor interface with another of the first, second and third components.

Abstract: A container made of flexible material with an inherently stable base and a method for manufacturing the container, the container being obtained in the shape of a pouch which has, in the region that will form the base, heat-sealed lateral regions and optionally ribbed guides which, by virtue of the very weight of the material that is introduced or by way of a punch, produce a base which makes the final container inherently stable.

Abstract: A method for generating a digital motion video sequence at a plurality of bit rates uses a transitional coding source when switching between bitstreams having different bit rates during transmission of a video sequence. The transitional data may be frames coded using reconstructed frames reconstructed for a first bitstream using the characteristics of the second bitstream. These “low bit rate insert frames,” or LBIFs, contain the image characteristics of a signal coded at the lower bit rate. With a bitstream having a higher bit rate being periodically coded using an LBIF, a point of image continuity between the two bitstreams is provided. Thus, switching from one bitstream to the other at this point in the video sequence minimizes the production of artifacts caused by differences in bit rate. In another embodiment of the invention, a separate set of transitional data is created, taking the form of “switch” frames, or S-frames.

Abstract: A computer system, method and software for detecting and purging stale entries from remembered sets associated with incrementally collectible regions used in an incremental garbage collection technique like the Trains algorithm is described. Stale entries are detected by a number of techniques, and then purged, eliminated, or scrubbed. These techniques make use of the summarized information about regions such as cards or incrementally collectible regions that indicate age of allocation, time a region was last scanned, last time an entry was inserted into a remembered set, as well as how far forward or backward objects in a given region refer in a generation.

Abstract: A garbage collector for more efficient placement of objects referenced from external references. The expected life times of these objects is measured by trial and error, by the class or type, by how often the object has been evacuated or the external reference processed, by the stability and longevity of the root source, or by the prolificness of the class or type of object. The measured value is held in the header of each object in an AGE field available for this purpose. These objects may be evacuated into existing trains or into new trains, or into a combination of existing and new trains. When new trains are created the trains are distributed among the existing trains according to a distribution contour that may be linear, normal, gamma or any other contour that might be found useful. Also, when new trains are created the youngest train must be a new train.

Abstract: A garbage collector employs the train algorithm to collect a generation in a dynamically allocated heap. When direct allocation of an object into the generation results in the need to allocate a new car section, the collector makes a determination of whether a new collection increment or interval needs to be initiated. It makes this determination by comparing the amount of new allocation in that generation with a threshold value. During each collection increment, it updates the threshold value by determining how much can occur during the next collection increment without exceeding an allowable pause time. It then projects from that value how much memory-space reclamation is likely to occur. From that likely amount of reclamation, it arrives at a limit on the permitted amount of allocation.

Abstract: A copying garbage collector evacuates to a to space the objects in a from space that are referred to by references, including references in previously evacuated objects, that are located outside the from space. It divides the to space into local-allocation buffers (“LABs”), and it adopts one of these as a destination LAB, i.e., as the LAB into which it places the objects that it evacuates. When a destination LAB becomes full, the thread adopts a new LAB as its destination LAB. When a destination LAB's contents fill it to some predetermined fill threshold, that destination LAB becomes the source LAB, i.e., the LAB that the collector scans for references to the collection-set objects. If a previous source LAB's contents has not yet been completely scanned when the collector thus adopts a new source LAB, the previous source LAB is placed on a LAB stack.

Abstract: A network appliance for monitoring, diagnosing and documenting problems among a plurality of devices and processes (objects) coupled to a computer network utilizes periodic polling and collection of object-generated trap data to monitor the status of objects on the computer network. The status of a multitude of objects is maintained in memory utilizing virtual state machines which contain a small amount of persistent data but which are modeled after one of a plurality of finite state machines. The memory further maintains dependency data related to each object which identifies parent/child relationships with other objects at the same or different layers of the OSI network protocol model. A decision engine verifies through on-demand polling that a device is down. A root cause analysis module utilizes status and dependency data to locate the highest object in the parent/child relationship tree that is affected to determine the root cause of a problem.

Abstract: An apparatus and method simulates more accurately the natural statistics of a physical reverberation process. A new filter design is provided having a comb shaped group delay. Gain minimums at a plurality of frequencies are combined with a delay line to create a constant reverberation time independent of frequency while allowing for temporal spreading. In addition, the connection topology between the plurality of energy transmission networks is temporally randomized to facilitate energy distribution within the reverberation apparatus. Both the temporal and spectral responses are actively changed on each iteration of the energy recirculation. By making the response have a high echo density and a lack of spectral coloration in the decay, the illusion of a natural process is enhanced.

Abstract: A garbage collector that divides a dynamically allocated heap into car sections grouped into trains in accordance with the train algorithm subdivides large trains into subtrains. When an object that is reachable from the train-algorithm-managed generation of the heap is evacuated from a car being collected during a collection increment, it is placed into the last car in the subtrain in which the reference to it resides, even if that car is not the last car in the train to which the reference's subtrain belongs. The train-algorithm test for dead trains is performed not only on top-level trains but also on sub-trains.

Abstract: A technique for incrementally collecting enormous objects including scanning portions of the enormous objects on different collection steps. The scanning can be accomplished with a number of collection sets where the enormous object is re-linked and older cars remembered sets are updated on subsequent collection steps. Unscanned portions of the enormous object are scanned on subsequent collection cycles until the enormous object has been fully scanned. This incremental collection can be performed concurrently with collections of other generations and applications.

Abstract: The basic concept is that before a resource is accessed, the entity that has the burden of gathering the credentials, pro-actively refreshes the credentials and keeps them current. In one instance, a presenter of credentials, for example, a client, pro-actively refreshes the credentials such that at the time of presentation, the credentials meet the resource-specific constraints of a recipient of credentials, for example, a resource server. For each resource that it protects, a resource server typically establishes various constraints such as a recency requirement, which specifies how recently a credential has to have been issued to be accepted as an adequate credential. Other constraints may include maximum certificate chain length, trust level and so forth. In another instance, a recipient of credentials pro-actively gathers and refreshes credentials to prevent un-authorized access to the various resources it is protecting.

Abstract: During a collection interval, if a multi-threaded generational, copying garbage collector finds that a card contains a reference to a younger generation, it gives a corresponding card table entry a youngergen value selected from a plurality of youngergen values at the beginning of the interval as the “current” youngergen value. The youngergen value chosen for a given collection interval differs from the one that was chosen for the previous collection interval. As a result, a collector thread is able to distinguish between a card in which a reference to the younger generation remained at the end of the previous interval and one identified by some other thread during the current interval as referring to a young-generation object. In that way, the thread is able to avoid unnecessary scanning.

Abstract: A garbage collector operates in increments in which it collects a collection set consisting of one or more segments of a dynamically allocated heap. For each of those segments it maintains a remembered set of locations in which it has previously found references to objects in that associated segment. Each remembered set is stored in a plurality of remembered-set structures, each of which is associated with a separate one of a corresponding plurality of “stripes” into which at least a portion of the heap is divided. The garbage collector executes its remembered-set-updating operations in a plurality of concurrently executing threads, each of which claims exclusive access to a subset of the constituent remembered-set structures. By restricting its access only to that subset of the remembered-set structures that it has claimed, an individual thread is able to perform its portion of the updating operation without the need for synchronization with other threads.

Abstract: A three-tiered data imaging system is used on a distributed computer system comprising hosts connected by a network. The lowest tier comprises management facade software running on each machine that converts a platform-dependent interface written with low-level kernel routines that actually implement the data imaging system to platform-independent method calls. The middle tier is a set of federated Java beans that communicate with each other, with the management facades and with the upper tier of the system. The upper tier of the inventive system comprises presentation programs that can be directly manipulated by management personnel to view and control the system. In one embodiment, the federated Java beans can run on any machine in the system and communicate, via the network. A data imaging management facade runs on selected hosts and at least one data imaging bean also runs on those hosts.

Abstract: A system for making plastic containers includes a source for providing a continuous stream of molten plastic, and a cutter for severing a continuing series of individual mold charges from the continuous molten plastic stream. A compression molder includes a plurality of compression molds arranged in a continuing series for receiving the mold charges in sequence and compression molding the mold charges into a continuing series of individual plastic container preforms. A blow molder includes a plurality of blow molds arranged in a continuing series for receiving the individual plastic container preforms in sequence and blow molding the preforms into a continuing series of plastic containers. A common drive coordinates continuous and synchronous operation of the molten plastic source, the cutter, the compression molder and the blow molder to provide the continuing series of plastic containers from the continuous stream of molten plastic.