Abstract: An elliptic curve processing apparatus that performs operations on elliptic curves specified over binary polynomial fields includes a functional unit that has a digit serial multiplier with a digit size of at least two bits. The elliptic curve processing apparatus performs reduction for respective generic curves using arbitrary irreducible polynomials, which correspond to respective ones of the generic curves. The elliptic curve processing apparatus may include hardwired reduction circuits in the functional unit for use with respective named curves. A storage location in the elliptic curve processing apparatus may be used to specify whether an operation is for one of the named curves or for one of the generic curves.

Abstract: In accordance with the present invention a process is provided for allocating and deallocating resources in a distributed processing system having a requester platform and a server platform. The process involves receiving a request from the requestor platform referring to a system resource and specifying a requested lease period, permitting shared access to the system resource for a lease period, sending a return call to the requestor platform advising of the lease period, and deallocating the system resource when the lease period expires.

Abstract: A shape-based geometric database uses R-trees to compactly and efficiently represent design objects. Such R-trees may be populated in an efficient and balanced manner to improve the efficient use of such R-trees in various stages of circuit design, for example. For example, tiles are assigned to bins depending at least partially on orientation of the tiles and on proximity of the tiles to reference tracks having similar orientations. Bin R-trees may be defined, along with direction and layer R-trees using a level sequential process from lower levels to higher levels until a root node is defined in each case.

Abstract: A reduction operation is utilized in an arithmetic operation on two binary polynomials X(t) and Y(t) over GF(2), where an irreducible polynomial Mm(t)=tm+am−1tm−1+am−2tm−2+ . . . +a1t+a0, where the coefficients as are equal to either 1 or 0, and m is a field degree. The reduction operation includes partially reducing a result of the arithmetic operation on the two binary polynomials to produce a congruent polynomial of degree less than a chosen integer n, with m≦n. The partial reduction includes using a polynomial M′=(Mm(t)−tm)*tn−m, or a polynomial M″=Mm(t)*tn−m as part of reducing the result to the degree less than n and greater than or equal to m.

Abstract: An invention is provided for a remote execution system. The remote execution system includes a first application, such as a server application, having a first plurality of virtual service modules, each capable of providing a particular functionality. In addition, a second application, such as a client application, is included that has a second plurality of virtual service modules substantially equivalent to the first plurality of virtual service modules. Each of these virtual service modules is in communication with a substantially equivalent virtual service module of the first plurality of service modules to form a virtual service module set. In this manner, each virtual service module set is capable of interacting with an application as a single software object that is local to the application.

Abstract: An apparatus multiplies a first and a second binary polynomial X(t) and Y(t) over GF(2), where an irreducible polynomial Mm(t)=tm+am−1tm−1+am−2tm−2tm−2+ . . . +a1t+a0, and where the coefficients ai are equal to either 1 or 0, and m is a field degree. The degree of X(t)<n, and the degree of Y(t)<n, and m≦n. The apparatus includes a digit serial modular multiplier circuit coupled to supply a multiplication result of degree ≧m of a multiplication of the first and second binary polynomials. The digit serial modular multiplier circuit includes a first and second register, each being ≦n bits. A partial product generator circuit multiplies a portion of digit size d of contents of the first register and contents of the second register. The partial product generator is also utilized as part of a reduction operation for at least one generic curve.

Abstract: Systems and methods consistent with the present invention provide an automated manager for an electronic mail archive repository. A method of archiving electronic messages consistent with the present invention creates a repository that holds all electronic messages consistent with a set of rules for archive storage. An interface allows clients to retrieve electronic messages from the repository based upon rules limiting access to the repository. Methods and systems, as broadly described herein, comprise a message archive containing a plurality of messages, each having a client identifier and an archive token, and permit a requester access to select messages in the message archive based on an identifier for the requester and consistent with rules for archive retrieval.

Abstract: A circuit board assembly that includes a circuit board and a bracket. The bracket has a first flange, a second flange, and a third flange. The first flange and the second flange are coupled to the circuit board. The circuit board assembly also includes a switch mounting board. The switch mounting board is coupled to the third flange of the bracket. The circuit board assembly also includes a first switch and a second switch, which are coupled to the switch mounting board. The circuit board assembly further includes a connector that is coupled to the circuit board. At least a first portion of the connector is positioned between the circuit board and the first switch. At least a second portion of the connector is positioned between the circuit board and the second switch.

Abstract: The present invention requires a computing device to interact with an authorized host computer on a fairly regular basis in order to maintain operability. In one embodiment, there is stored within the computing device an authorization parameter. This parameter is checked upon the occurrence of certain events to determine whether it has expired. If the authorization parameter has expired, then the present invention renders the computing device inoperable. The only way to update this parameter, and hence to maintain operability, is for the computing device to interact with an authorized host computer. Unless a thief knows which host computer to contact, and how to properly interact with that host computer (both of which are unlikely), the authorization parameter of a stolen device will not be updated. As a result, the stolen device will become inoperable within a relatively short time after the theft.

Abstract: Apparatus, and computer program products are disclosed for constructing dispatch tables. In one embodiment of the present invention, the decision to allocate a new dispatch table entry is sensitive to the accessibility of a class. A dispatch table and dispatch table construction process is described in which the entries for a Vtable are determined such that conflicts between accessibility and class hierarchy are avoided. In particular, a dispatch table and dispatch table construction process is described which takes a method's accessibility and package status into consideration in determining the proper overriding semantics and table building techniques. The dispatch table may have more than one distinct entry for a method.

Abstract: Methods and systems of the present invention include providing a connection between a first computer and a second computer by receiving, at a third computer, information regarding one of the first and second computers to facilitate establishment of a secure connection between the first computer and the second computer, creating a first end-to-end security link between the first computer and third computer, and creating a second end-to-end security link between the second computer and the third computer to establish the secure connection. The first and second computers could be a client and a server on the Internet, and these methods and systems can, for example, increase the possible number of new secure connections to the server. The third computer also permits processing of information transmitted between the client and server in the third computer. For example, the information could be reformatted or used in testing a process of one of the first and second computers.

Abstract: A frequency multiplier design that uses a flip-flop to output (1) a first edge on an output clock signal upon receipt of a first transition of an input clock signal and (2) a second edge on the output clock signal before receipt of a second transition of the input clock signal is provided. The frequency multiplier design uses circuitry dependent on the output clock signal to reset the flip-flop after some delay but before the second transition of the input clock signal, wherein the resetting of the flip-flop causes the flip-flop to output the second edge on the output clock signal.

Abstract: A system and method for searching for documents within spaces in a distributed computing environment are provided. A client sends a lookup message to a space which stores documents. The lookup message may specify desired characteristics, such as a name or partial XML schema, of the stored documents. The documents may include XML service advertisements and XML device advertisements as well as general-purpose XML documents. A set of zero or more documents which match the lookup message are discovered. In one embodiment, the lookup message may include a desired name. If the lookup message includes both a desired name and a desired schema, the set of discovered documents may include both discovered documents having a name that matches the desired name and discovered documents having a schema that matches the desired schema. If the lookup message includes neither a desired name nor a desired schema, the set of discovered documents may include substantially all the documents stored in the space.

Abstract: A system and method is provided of placing components on a chip for performing a function in order to minimize wire length and wire congestion. In a preferred embodiment of the present invention, a plurality of components, which are adapted to receive a plurality of bits, are arranged in lines that are substantially parallel to one another. Within each line, the components are arranged such that the component adapted to receive the least-significant bit (“LSB”) for that line is positioned at a first end of the line, and a component adapted to receive the most-significant bit (“MSB”) for that line is positioned at a second end of the line. The lines are then oriented such that the first end of all odd numbered lines are adjacent the second end of all even-numbered lines (i.e., in a serpentine fashion). The plurality of components are then electrically connected.

Abstract: Provided are a method, system, and article of manufacture for processing requests in a server side application. The server side application receives a request in a communications protocol from a client. The server side application modifies the request to create a communications protocol independent request. The server side application generates a response by processing the communications protocol independent request. Subsequently, the server side application sends the generated response in the communications protocol to the client.

Abstract: Provided are a method, system, and program for managing a configuration file including device parameters that define attributes of the device accessed by a device driver executing in a computer. The device driver uses the device parameters to control one or more devices in communication with the computer. A determination is made of device parameters provided with the device driver for a device, wherein the device parameters are maintained external to the configuration file. User selection of at least one of the determined device parameters is received and a parameter code for each selected device parameter is written to the configuration file.

Abstract: Methods, systems, and articles of manufacture consistent with certain principles related to the present invention enable a computing system to layer the packaging and deployment of a web service endpoint on a standard servlet component model. To define a web service endpoint, the computing system may develop a service endpoint class that implements a configured service endpoint interface. The interface and endpoint class may be packaged by the computing system into an archive file. The computing system may use the information stored in the archive file to define the service endpoint modify the archive file with class information associated with the defined service endpoint. The modified archive file may be deployed on a container operating within the computing system.

Abstract: In accordance with the principles of the present invention, management of a data replication system is provided by a three-tiered arrangement. The lowest, or agent, tier comprises Common Information Model (CIM) provider objects that reside in the hosts providing the data replication service and that can make method calls on the low-level kernel routines. The middle, or logic, 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, or presentation, tier of the inventive system comprises web-based presentation programs that can be directly manipulated by management personnel to view and control the data replication system.

Abstract: A system for executing a software application comprising a plurality of hardware independent bytecodes is provided comprising a computing system that generates bytecodes, a virtual machine, remote to the computing system, that receives a plurality of bytecodes from said computing system, and executes said plurality of bytecodes, a system for testing said bytecodes against a set of predetermined criteria in which the testing is securely distributed between said virtual machine and said computing system so that the bytecode verification completed by the computing system is authenticated by the virtual machine prior to the execution of the bytecodes by said virtual machine. A method for distributed bytecode verification is also provided.

Abstract: A method for displaying color values in a plurality of images on a display screen in a computer graphics system, wherein the images correspond to a plurality of applications. The graphics system includes a primary frame buffer for pixel values to be displayed in the images, and a plurality of colormap tables related to the images for providing color values to be displayed in the images. A pseudo frame buffer is provided for the applications to store source pixel values for display in the corresponding images. To display the source pixel values in the pseudo frame buffer, for each source pixel the graphics system performs the steps of: identifying the image corresponding to the source pixel value; selecting a colormap table corresponding to the identified image; using the source pixel value as an index to select a color value from the selected colormap table; and storing the selected color value as a pixel value in the primary frame buffer to be displayed.