Abstract: The present invention provides a method and apparatus for implementation of an input/output stream operator in a dynamically typed language. This operator is built into the language, and allows a value of one type to be streamed to a value of another type by taking the form fromvalue?tovalue. Since the programming language is dynamic, the type of values on either side of the ? operator is of any supported type, and can be modified depending upon the type of operands. For example, a value of any type can be streamed to a value of type “stream”. In this instance, the destination value is attached to, for example, a device such as a terminal or disk drive. A value of type “stream” can also be streamed into a value of any type. In this instance an external source is inputted, for example, into a program.

Abstract: An apparatus and method for reducing a number of matched entries to more relevant matched entries. In routers, a destination Internet Protocol address of an incoming packet is matched to a router table of Internet Protocol address prefixes, yielding multiple matching entries in the router table. Less relevant matching entries that contain shorter Internet Protocol address prefixes are automatically removed, leaving only the entry including a longest matching prefix.

Abstract: An electronics assembly, for example a computer that may be employed as a network server, has an enclosure, and a plurality of heat-generating components such as microprocessors located inside the enclosure. One or more fans may be provided for maintaining a through flow of air for cooling the components of the assembly. The heat-generating components are located within the enclosure in line with the direction of the flow of air, and the heat-sinks have a configuration such that the air flows over them in parallel. The heat-sinks may each have a flat base for mounting on the component, and a cantilevered portion having one end located on the base, and another end that extends beyond the base and over the base of the other heat-sink, but not in contact with it.

Abstract: A method of automating enforcement of a data validation rule associated with an input field by a Model View Controller software application includes applying an input constraint embodying the data validation rule to a Model to generate an applied constraint, discovering the applied constraint via examination of the Model by a View-Controller Generator to generate a discovered constraint, generating an input field constraint mechanism using the discovered constraint, and constraining the input field using the input field constraint mechanism to generate a constrained input field.

Abstract: One embodiment of the present invention provides a system that solves a global optimization problem specified by a function ƒ and a set of inequality constraints pi(x)?0 (i=1, . . . , m), wherein ƒ and pi are scalar functions of a vector x=(x1, x2, x3, . . . xn). The system operates by receiving a representation of the function ƒ and the set of inequality constraints, and then storing the representation in a memory within the computer system. Next, the system performs an interval inequality constrained global optimization process to compute guaranteed bounds on the minimum value of the function ƒ(x) subject to the set of inequality constraints. While performing the interval global optimization process, the system applies term consistency at various places in the process over a subbox X, and excludes any portion of the subbox X that violates term consistency.

Abstract: A HTTP request is sent to a web server. A HTTP request including HTTP request data is received. A connection identifier is associated with the HTTP request. The receiving and associating steps are repeated for one or more HTTP requests. The connection identifier and the associated HTTP request data for the one or more HTTP requests are then sent in a single stream to the web server (e.g., HTTP process). When a HTTP request including HTTP request data are processed by a web server, the HTTP request data and an associated connection identifier are received. HTTP response data associated with the HTTP request data is obtained. The HTTP response data and the connection identifier are then sent.

Abstract: An event subscription and publication system for dynamically notifying user level applications of kernel level events. The kernel level events may include hardware and software events as well as system level errors that occur in the kernel. User level applications that need information on these kernel level events subscribe to the event monitoring and publication framework of the present invention and are notified of these kernel level events when they occur. Upon notification of an event, the user application also is provided with specific information classifying the nature and details of the event. The kernel event monitoring and publication system of the present invention allows user level applications to be dynamically notified of kernel level events without requiring the user level application to interrupt the normal processing states to identify these events when the events occur.

Abstract: Mechanisms and techniques provide a system for composing a complex constructs for use on a graphical display of a computerized device. The system receives a selection of basic constructor objects for use in the complex object. The basic constructor objects are chosen from a set of basic constructor object types including a button object type, a dial object type, an edit object type, and a container object type. The systems also receives a selection of one or more personalities to assign to the basic constructor objects. The personalities define extensions to basic constructor object operation and define a view for the object when rendered on an interface. The system combines the personalities and the basic constructor objects to define complex constructs such as menus, a scrollbars and the like. Personalities can be modified to alter the complex construct from one operational state to another.

Abstract: A register window spill technique for an retirement window having an entry size less than a number of spill instructions used in a spill condition is provided. The technique uses modified spill instructions that allow the retirement window to retire a portion of the spill instructions without having to determine whether a remaining portion of the spill instructions will execute without exceptions.

Abstract: Various embodiments of systems and methods for implementing filter-based attribute value access control are disclosed. In one embodiment, a method involves designating a location in the directory server, providing attribute related data that includes a filter expression, and selectively controlling access to an entry situated at the designated location using the filter expression in the attribute related data. For example, access to an attribute of the entry may be denied if a criterion defined by the filter expression associated with the attribute is not met by a first value of the attribute.

Abstract: A rendering unit positions a supertile so that it intersects a primitive. The rendering unit repeatedly walks over bins of the supertile, applying a layer of texture to the bins of the supertile in each iteration of said repeated walking. The rendering unit advances to the next texture layer after having applied the current texture layer to each candidate bin of the supertile. The results of each texture layer application to the bins may be stored in a texture accumulation buffer. The size of the supertile corresponds to the size of the texture accumulation buffer. After applying a last layer of texture to the bins of the supertile, the supertile may be advanced to a new position. The rendering unit traverses the primitive with the supertile so that the union of areas visited by the supertile covers the primitive.

Abstract: Method and apparatus are disclosed that allow boot code within the apparatus to be updated using a system controller. The apparatus includes a central processing unit (CPU) and a programmable memory that contains boot code at a predetermined location for use in booting the CPU. The apparatus further includes a bus and a bus master for the bus. The CPU accesses the boot code via the bus and the bus master. The apparatus further includes a system controller. This is operable to write boot code into the programmable memory over the bus. In one embodiment, the above components form a single subsystem within an array of such subsystems. A single control point for the array can transmit updated boot code to the system controller for loading into the programmable memory. This then provides a single interface for simultaneously updating the boot code in all subsystems.

Abstract: A distributed system provides for separate management of dynamic cluster membership and distributed data. Nodes of the distributed system may include a state manager and a topology manager. A state manager handles data access from the cluster. A topology manager handles changes to the dynamic cluster topology. The topology manager enables operation of the state manager by handling topology changes, such as new nodes to join the cluster and node members to exit the cluster. A topology manager may follow a static topology description when handling cluster topology changes. Data replication and recovery functions may be implemented, for example to provide high availability.

Abstract: A video routing system including a plurality of video routers VR(0), VR(1), . . . , VR(NR?1) coupled in a linear series. Each video router in the linear series may successively operate on a digital video stream. Each video router provides a synchronous clock along with its output video stream so a link interface buffer in the next video router can capture values from the output video stream in response to the synchronous clock. A common clock signal is distributed to each of the video routers. Each video router buffers the common clock signal to generate an output clock. The output clock is used as a read clock to read data out of the corresponding link interface buffer. The output clock is also used to generate the synchronous clock that is transmitted downstream.

Abstract: The present invention provides a method and apparatus for a bandwidth adaptive image compression/decompression scheme. In one embodiment, the present invention uses a special protocol between the sender and the receiver to measure the latency of the connection. This protocol and its result are sent and received at an interval based on a dynamic feedback loop algorithm. Based on the results of the protocol, a compression scheme is chosen. This scheme uses CPU time conservatively, and also transmits the most interesting data first. In another embodiment, the present invention throws away data that is repetitious, especially when the connection is down for a short period of time. In yet another embodiment of the present invention, measurements are taken for the perceptual degradation of the image for various compression schemes, and the results are supplemented with the results of the protocol to choose a viable compression/decompression scheme.

Abstract: A garbage collector that operates in accordance with the train algorithm designates some cars as “special” cars into each of which at most a single object is allowed. When an object in a car being collected is referred to by a reference located in such a special car, the collector may depart from the conventional evacuation approach of placing the evacuated object into the train containing the reference referring to it. If the reference is located in an object referred to from a train younger than the train in which the reference is located, the referred-to object in the car being collected is not evacuated to the train that contains the reference to it. Instead, it is evacuated to the train from which the object containing that reference is referred to.

Abstract: A method is provided, the method comprising defining an actual size of each variable in a programming language at a declaration time when the actual size of the respective variable can be defined and declaring at least one variable in the programming language to have a dynamic size at the declaration time when the actual size of the at least one variable is not known. The method also comprises defining the actual size of the at least one variable in the programming language when the actual size of the at least one variable becomes known after the declaration time.

Abstract: Improved techniques for loading class files into virtual computing machines are disclosed. These techniques provide a mechanism that will generally improve the efficiency of virtual machines by selectively loading information into a virtual machine. As will be appreciated, this allows a better use of the resources of the virtual machine. This is especially effective in virtual machines that operate with limited memory resources (e.g., embedded systems). In one embodiment, class files suitable for loading into a virtual machine are initially loaded into a memory portion (e.g., heap memory). Then, information that is needed to be loaded into the virtual machine is selected. Finally, only the selected information is loaded into the virtual machine.

Abstract: An ejector mechanism. The ejector mechanism includes an ejector pair, pivotally mounted on a surface of the carrier. Each ejector of the ejector pair comprises an ejector slot that is engageable with an ejector pin that is located on a chassis, which accommodates the carrier. A plurality of gear teeth are configured into each ejector wherein the gear teeth on one ejector engage or disengage with the gear teeth on another ejector as the ejector pair pivotally rotates about a point on the carrier. A handle is affixed to one ejector to facilitate the moving of the ejector pair.

Abstract: Provided is a method, system, and program for maintaining a database of data objects. A first data object implemented in a first programming language including attributes and attribute values for a class is received. The first data object is transformed to a second data object implemented in a second programming language, wherein the second data object includes the attributes and attribute values of the class included in the first data object. The second data object is added to the database, wherein the database is capable of storing multiple data objects implemented in the second programming language.