Abstract: A method and system for detecting and correcting invalid network paths in a network having a plurality of routers and a set of global invariant rules imbedded in the network including querying a subset of a routing table data structure defining network paths wherein said subset includes a plurality of routing table entries and comparing a network routing table entry with an earlier network routing table entry for the same node. The method and system also includes detecting inconsistencies between the newer network routing table entry and the earlier network routing table entry, and invalidating the network entries of the older network routing table that are inconsistent with the newer entries. The method and system also includes reconstructing the routing structure by replacing the invalidated network routing table entries with new routing table entries that minimize violation of the invariant protocols.

Abstract: A mechanism for minimizing effective memory latency without unnecessary cost through fine-grained software-directed data prefetching using integrated high-level and low-level code analysis and optimizations is provided. The mechanism identifies and classifies streams, identifies data that is most likely to incur a cache miss, exploits effective hardware prefetching to determine the proper number of streams to be prefetched, exploits effective data prefetching on different types of streams in order to eliminate redundant prefetching and avoid cache pollution, and uses high-level transformations with integrated lower level cost analysis in the instruction scheduler to schedule prefetch instructions effectively.

Abstract: A computer based method for the preservation of a digital information in a data set includes receiving a data set to be preserved, the data set including a plurality of preservation objects; creating a fixity table, the fixity table including one or more data types corresponding to preservation data types contained in the preservation objects, each data type being assigned an importance rank and one or more fixity function; for each preservation object, creating a Merkle tree corresponding to the preservation object and based on the fixity table.

Abstract: A contact management data processing system can be provided. The system can include a contact manager coupled to a list of contacts and stored staleness criteria stored in connection with the list of contacts. The system also can include stale contact management logic. The logic can include program code enabled to apply the stored staleness criteria to a selected contact to identify a stale contact, and to manage the stale contact in the list of contacts. In aspects of the embodiment, the list of contacts can be stored in a personal computer, in a server remotely disposed from the contact manager, in a telephone such as a cellular telephone or voice over Internet protocol (VoIP) telephone, or in a personal digital assistant to name but a few.

Abstract: A semiconductor fabrication method involving the use of eSiGe is disclosed. The eSiGe approach is useful for applying the desired stresses to the channel region of a field effect transistor, but also can introduce complications into the semiconductor fabrication process. Embodiments of the present invention disclose a two-step fabrication process in which a first layer of eSiGe is applied using a low hydrogen flow rate, and a second eSiGe layer is applied using a higher hydrogen flow rate. This method provides a way to balance the tradeoff of morphology, and fill consistency when using eSiGe. Embodiments of the present invention promote a pinned morphology, which reduces device sensitivity to epitaxial thickness, while also providing a more consistent fill volume, amongst various device widths, thereby providing a more consistent eSiGe semiconductor fabrication process.

Abstract: A method and system provide for secure sharing of arbitrary data between users with limited mutual trust. A user can encode its information by using a Slepian-Wolf code at a rate which enables a second user to correctly decode only if the side-information it has satisfies a conditional entropy constraint. The key advantages are as follows. Firstly, it is very flexible, in that it enables secure sharing for general data including multimedia data. Secondly, by appropriate Slepian-Wolf code selection, it enables compression in conjunction with security. Thirdly, it can be used for the case where the data model is imperfectly known and trust is to be built up incrementally.

Abstract: A method, computer program product or computer system for dynamically controlling the firing of a trigger for a DELETE CASECADE referential constraint in a database management system, which includes defining a DELETE CASCADE Trigger Fire Attribute (DCTFA) for each dependent file of the DELETE CASCADE referential constraint in a database, initializing each DCTFA with a value corresponding to enabling trigger firing or disabling trigger firing, and firing the trigger according to the value of the DCTFA of each dependent file during the DELETE CASCADE.

Abstract: Generating exception delay messages when messages communicated between asynchronous messaging applications are delayed and for forcibly retaining the original message. Specifically, the invention provides methods and systems for generating an exception delay message after a time threshold has expired without deleting the original message. The exception delay message may be sent once when the time threshold first expires or each time that the time threshold expires.

Abstract: A method, system and article of manufacture are disclosed for quiescing multiplexed client messaging conversations. The invention uses plural independent mutexes to stop the application sends from both ends of a client/server channel, while allowing unsolicited control flows from the server to client to also be handled and quiesced. Once the channel is quiesced a channel-wide renegotiation, such as SSL secret key reset, can flow. The channel can then restart, again with the possibility of unsolicited server to client flows. The preferred embodiment of the invention provides a number of important advantages. For example, this embodiment allows channel-wide negotiation flows to occur on a multiplexed channel without the need to wait for application conversations to complete. It also allows channel-wide negotiation flows to occur on a multiplexed channel on which unsolicited server to client flows can occur.

Abstract: In an embodiment of the invention, a method for REST service importation in a distributed application development data processing system can be provided. The method can include the specifying a sample uniform resource locator (URL) in a graphical user interface to a REST service importation editor and invoking the REST service at the sample URL in order to receive a response object from the REST service. The method further can include parsing both the sample URL and the response object to identify different request fields and field types of a request object for the REST service and also response fields and field types of the response object. Finally, the method can include displaying a description of the request fields and field types of the request object and also a description of the response fields and field types of the response object in the graphical user interface to the REST service importation editor.

Abstract: A method of handling a message in a messaging system is provided. The messaging system comprises a message source, a message receiver and a message service.

Abstract: A method, apparatus, and program product checkpoint an application in a parallel computing system of the type that includes a plurality of hybrid nodes. Each hybrid node includes a host element and a plurality of accelerator elements. Each host element may include at least one multithreaded processor, and each accelerator element may include at least one multi-element processor. In a first hybrid node from among the plurality of hybrid nodes, checkpointing the application includes executing at least a portion of the application in the host element, configuring and executing at least one computation kernel in at least one accelerator element, and, in response to receiving a command to checkpoint the application, checkpointing the host element separately from the at least one accelerator element upon which the at least one computation kernel is executing.

Abstract: A database query is received that includes a logical query indicator at a distributed database node within a distributed network of databases. The logical query indicator includes at least one physical database query and at least one database node identifier that allows at least one distributed database node to identify at least one physical database to execute the physical database query against. It is determined that the at least one database node identifier matches a local node identifier. The at least one physical database query is executed against at least one local physical database table. A local query response is formed including data retrieved from the at least one local physical database table. The database query is responded to with at least the local query response. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: Alloys of silver and an alloying element that diffuses to the surface of the high conductivity metal and is oxidizable to form an alloying element oxide such as beryllium are provided along with electronic structures employing the alloys and methods of fabrication.

Abstract: An objective function is dynamically chosen from a pool of available objective functions, and a prediction model is dynamically chosen from a pool of available prediction models. Points of inflection are determined for the chosen objective function, based on past values of a metric, to obtain a set of equations that can be solved to obtain model parameters associated with the chosen prediction model. The equations are solved to obtain the model parameters, and a future value of the metric is predicted based on (i) at least some of the past values of the metric and (ii) the chosen prediction model, with the obtained associated model parameters.

Abstract: The present invention is a patterned metal thermal interface. In one embodiment a system for dissipating heat from a heat-generating device includes a heat sink having a first surface adapted for thermal coupling to a first surface of the heat generating device and a thermal interface having at least one patterned surface, the thermal interface being adapted to thermally couple the first surface of the heat sink to the first surface of the heat generating device. The patterned surface of the thermal interface allows the thermal interface to deform under compression between the heat sink and the heat generating device, leading to better conformity of the thermal interface to the surfaces of the heat sink and the heat generating device.

Abstract: An apparatus, system, and method are disclosed for backing up data across a plurality of clients on a grid computing system. A sequence management apparatus includes a client request module, a sequence module, and packet storage module. The sequence module is configured to receive data to be backed up from a source client. The sequence module is configured to generate a non-transparent sequence key that identifies one or more target clients on the grid computing system. The packet storage module is configured to store a backup copy of the data from the source client on the plurality of target clients according to the non-transparent sequence key. The non-transparent sequence key may be generated by and known only to the sequence management apparatus in order to maintain a minimum security level for the data backed up on the plurality of target clients.

Abstract: A method for providing secure access to information held in a shared repository, for example to electronic business cards stored on a server. A data owner registers with the server and provides information to be shared with selected data users. The server returns public-key cryptography keys. To access the information, a data user sends its public key to the data owner. The data owner encrypts the public key using the data owner private key, and sends the result to the server, along with permission to transfer information to the data user. The server decrypts the received result using the data owner public key, and compares the outcome with the data user public key. If they match, the server records permission on an access list. In response to a request for information the server checks the access list to determine whether the data user has permission. If so, the server encrypts the information using the data user public key, and transfers the result to the data user.

Abstract: A fault tolerant capability for the reliable collection and aggregation of disparate data from multiple processing units. Data of a processing unit is collected and locally aggregated at that processing unit. The locally aggregated data is stored in a local database, and periodically forwarded to a central manager. In response to receiving the data, the central manager determines whether the data should be included in a total aggregate of data for the processing environment.

Abstract: Methods and heterostructure barrier varactor (HBV) diodes optimized for application with frequency multipliers at providing outputs at submillimeter wave frequencies and above. The HBV diodes include a silicon-containing substrate, an electrode over the silicon-containing substrate, and one or more heterojunction quantum wells of alternating layers of Si and SiGe of one or more electrodes of the diode. Each SiGe quantum well preferably has a floating SiGe layer between adjacent SiGe gradients followed by adjacent Si layers, such that, a single homogeneous structure is provided characterized by having no distinct separations. The plurality of Si/SiGe heterojunction quantum wells may be symmetric or asymmetric.