Abstract: A method for forming liquid coatings for medical devices such as stents and angioplasty balloons is provided. The liquid coatings can be made from biodegradable materials in liquid, low melting solid, or wax forms, which preferably degrade in the body without producing potentially harmful fragments. The liquid coatings may also contain biologically active components, which are released from the coatings through diffusion from the coatings and the degradation of the coatings.

Abstract: A special bus master, called a configuration host, “walks” a bus system to discover the bus topology and bus bridges that form that topology. Once the bridges have been located, the configuration host assigns a bridge ID to each bridge and enters information into internal bridge registers that control the flow of information between bus segments. The configuration host also populates an address bitmap in each bridge in order to complete the bus system configuration. In one embodiment, the bus topology is a tree configuration and the configuration host performs a recursive procedure that configures each branch of the tree. During this configuration process the internal bridge registers and address bitmap in each bridge are populated.

Abstract: An embolic protection filter system comprises a collapsible embolic protection filter 62 having a collapsed configuration for delivery of the filter, and a deployed configuration and a temporary lumen defining member 60. The lumen defining member 60 is used for loading a filter-containing delivery catheter 63 onto a guidewire 65. After loading, the member 60 can be removed by pulling on a tab 61.

Abstract: A garbage collector employs the train algorithm to collect a heap generation incrementally, collecting “car sections” in a collection order. As it updates the “remembered sets” by which it keeps track of where references to objects in respective car sections are located, it also updates oldest- and youngest-car indicators for each car section. The oldest- and youngest-car indicators for a given car section specify limits in the collection sequence beyond which references to objects in the given car have not been found. The garbage collector uses these indicators to identify cars that contain no objects that are reachable except through a reference chain that includes the collection set for the current collection increment. It adds one or more such cars to the collection set, and it collects the thus-expanded collection set without processing the remembered sets associated with the added cars.

Abstract: A garbage collector divides the garbage-collected heap into “cards.” It maintains a table containing a card-object table entry for each card. A card's entry contains information from which the collector can determine where any references in the card are located and thereby identify objects that may be reachable. The encoding of a card's table entry is not restricted to values that indicate the location of the object in which the card begins. Instead, its possible values additionally include ones that indicate that the card begins with a certain number of references or that an object begins at a given location in the middle of the card. The collector thereby avoids consulting object's class information unnecessarily.

Abstract: A framework based Java naming and lifecycle services system includes a Moniker class which universally identifies an instance of any object model, whether the instance exists or not. Moniker objects instantiated from the Moniker class operate with a set of directory service classes and object adapters to create a directory service framework and a mechanism for connecting the directory service framework to existing directory services. A set of runtime classes provide “in process” services for objects. For example, the Moniker class is automatically substituted for a client reference when the underlying object instance is streamed or persisted. In accordance with one embodiment, life cycle services are provided by associating a predefined policy with each Moniker object, which policy specifies how and when life cycle services should be performed.

Abstract: A display device comprising: a light switching unit comprising an array of pixels each operable to vary the transmission of light therethrough; and a backlight comprising a first series of regions of organic light-emissive material having a first emission color and a second series of regions of organic light-emissive material having a second emission color, each region of organic material being located so as to lie behind a plurality of pixels of the array in the viewing direction for backlighting those pixels; and at least one of the regions of organic light-emissive material being formed by a process of ink-jet deposition.

Abstract: A flow allocation system includes a set of collection agents, a set of restriction agents, a processing agent and at least one usage limit selected from a volume limit set and a rate limit set. The flow allocation system is implemented between a set of usage devices and a service network. The collection agents monitor flows between the usage devices and the service network. The processing agent sums the flows for each of the usage devices, determines whether any of the summed flows reach the usage limit, and selects at least one flow restriction rule for the subset of usage devices reaching the usage limit. The set of restriction agents implement the flow restriction control rule for the subset of usage devices reaching the usage limit. The processing agent also uses exception handling techniques to shift usage quotas for the usage devices.

Abstract: A probe head for nuclear magnetic resonance measurements is disclosed in which at least a first kind of nuclei with a first, higher resonance frequency and a second kind of nuclei with a second, lower resonance frequency are excited within a magnetic field. The probe head comprises a first input/output terminal for the higher resonance frequency and a second input/output terminal for the lower resonance frequency. A measuring coil cooperates with a sample. The measuring coil has a first terminal end and a second terminal end. The first terminal end is coupled to the first input/output terminal and the second terminal end is coupled to the second input/output terminal. A stop circuit tuned to signals of the higher resonance frequency is arranged between the second terminal end and the second input/output terminal. The stop circuit, further, comprises a line having a length equalling a quarter wave length of the higher resonance frequency. The first line is arranged in series with the measuring coil.

Abstract: In response to source code that represents instructions for dynamically allocating memory to objects, a compiler/interpreter produces instructions that implement a garbage collector. The garbage collector operates in garbage-collection cycles, which include parallel-execution operations such as locating reachable objects. Each thread maintains a respective task queue onto which it pushes identifiers of objects thus found and from which it pops those identifiers in order to begin the tasks of locating the further objects to which objects specified by the thus-popped identifiers refer. A thread's access to its respective task queue ordinarily occurs on a last-in, first-out basis, but the access mode switches to a first-in, first-out basis if the number of task-queue entries exceeds a predetermined threshold.

Abstract: Disclosed is a system, method, and article of manufacture for agent processing. In particular, an agent may be executed within an address space of an invoking process that invoked the agent or may be executed in a separate address space. While the agent is processing, the execution of the agent within the address space of the invoking process may be switched to execution of the agent within the separate address space. Similarly, while the agent is processing, the execution of the agent in the separate address space may be switched to execution of the agent in the address space of the invoking process. Moreover, if the invoking process terminates before completing processing, when the invoking process restarts, the invoking process redetermines which agents should be executed in separate address spaces based on information stored before the invoking process terminated.

Abstract: A compact spectroscope is sufficiently lightweight for use in combination with a microscope for analyzing samples using Raman analytical techniques. The Raman spectroscope includes a housing detachably mountable to the microscope. The housing contains at least one source of radiation. One or more filters are positioned at desired angles across the beam path provided by the source of radiation. The spectroscope includes a variety of components operatively connected to source of radiation capable of providing one or more Raman beams, as well as a variety of components for processing beam constituents for microscope analysis. A fiber optic probe is provided for examining large samples or samples at remote sites. A computer or other electronic reader may also be attached to the Raman spectroscope for viewing analytical data.

Abstract: A multiport switching valve for a liquid flow system is described, comprising a first member having a plurality of ports for connecting liquid lines thereto, a second member, connected with a first member and movable relative to the first member, the second member comprising a plurality of channels, wherein the channels are arranged such that, according to a selected relative position between the first and second member, one or more of said channel connect predetermined ones of the ports of the first member with one another in a liquid conducting manner. The first member comprises at least one group of ports arranged in one substantially straight line or at least two adjacent substantially parallel and substantially straight lines, and the second member comprises a plurality of segments, wherein the segments have one or more channels arranged therein, the channel or channels of each segment representing a predetermined connection scheme for connecting predetermined ones of the ports with one another.

Abstract: A container includes a hollow body having a finish extending from the body. The finish has an open end, at least one external thread for securement of a closure, and a pair of spaced external circumferential flanges on a side of the thread remote from the open end of the finish. A bale handle includes a ring having resilient internal tabs captured beneath the lower of the flanges remote from the open end of the finish, and a handle extending from the ring for carrying the container. The upper flange, which preferably has a greater outside diameter than the lower flange, has an undersurface that is free of obstruction from the bale handle and therefore is adapted to perform support functions for the container after attachment of the bale handle to the container finish.

Abstract: In a garbage collector that more efficiently places newly promoted objects into a generation managed by the train algorithm, a promotion train is established near the oldest train and the objects are placed therein. If some objects are referenced from existing trains in the generation those objects are placed into those trains, and if any such objects are referenced from several existing trains, the objects are placed at the end of the youngest referencing train. The promotion train may be a new train that is placed, or a existing train that is selected, between the oldest train and the youngest train at a position based on the amount of memory compared to the size of a collection set. In the case of multiple collector threads, multiple cars in a promotion train or multiple promotion trains may be formed.

Abstract: A distributed system and method generate “layered routes” that reflect a layered representation of a network, which representation provides deadlock-free routes. The layered representation consists of an ordered set of layers, where each layer is a deadlock-free sub-topology of the network. In determining routes, the links used in each route are constrained to be taken from layers of non-decreasing order as the route extends from source to destination. A device that determines a better or equal cost path to a destination node with respect to its current path to that node sends a route information message to its neighbor devices. The receiver of a route information message may then accept the message and begin using the new path described by the message, or reject the message without using the new path.

Abstract: A garbage collector collects a generation of a dynamically allocated heap in a computer's memory incrementally. A collection set within the generation is associated with each collection increment. The collector reclaims for reuse the memory space occupied by any collection-set object not reachable by a reference chain that extends from outside the collection set. The collector monitors the total amount of allocation that occurs within the generation between collection increments, and it bases the collection-set size on those allocation amounts.

Abstract: A technique for applying time compression to simulate long-term execution of a software application in the short time frames includes providing simulated events to a software application under test and selectively advancing the system clock. The subject system utilizes two utility modules to interact with a software application under testing. The first module, the Event Simulation module, generates a range of predefine events which simulate the nature and frequency of events to which the software application would react. The second module, the Clock Modification module, intercepts the time signal generated by the operating system under which the software application is executing and modifies the clock signal, typically by advancing the time at a rate which is faster than one second per second, i.e., normal time rate. With the subject system, the behavior of an application over a simulated period may be observed in just a fraction of the simulated period duration, e.g.

Abstract: A copying-type garbage collector operates in multiple concurrent threads. Each thread evacuates potentially reachable objects from the from space to the to space in a depth-first manner: if a thread has evacuated an object containing references to any from-space objects, it evacuates all of that object's descendants before it evacuates any other reachable objects. To keep track of descendants that must be evacuated before non-descendants can be, the thread places objects containing references to non-evacuated objects into a linked list maintained by pointers that it installs in the from-space locations from which the objects on the list were evacuated. Additionally, it divides the to space into local-allocation buffers (“LABs”) to which respective threads exclusively evacuate objects, and each thread maintains a LAB stack representing all the LABs it has filled that still contain references to unevacuated from-space objects.