Abstract: A technique for improved score calculation and normalization in a framework of recognition with phonetically structured speaker models. The technique involves determining, for each frame and each level of phonetic detail of a target speaker model, a non-interpolated likelihood value, and then resolving the at least one likelihood value to obtain a likelihood score.

Abstract: A method and arrangements for increased precision in the computation of a reciprocal square root is disclosed. In accordance with the present invention, it is possible to achieve fifty three (53) bits of precision in less processing time than previously possible.

Abstract: To easily identify the owner of an object currently drawn on a collaboration work area, or an object already drawn thereon, to easily carry out an editing operation for the object of each owner by selectively identifying the object drawn by a particular owner. A user management table registers the node identification code and the owner identifier of a user system therein, and an object management table registers the node identification code and object information therein. Based on an event entry for an object, the node identification code of the object management table is obtained, and the owner identifier of the user management table is obtained. This owner identifier is displayed on a screen by relating it to the object.

Abstract: An arrangement for adapting statistical parsers to new data using a mathematical transform, particularly a Markov transform. In particular, it is assumed that an initial statistical parser is available and a batch of new data is given. The initial model is mapped to a new model by a Markov matrix, each of whose rows sums to one. In the unsupervised setup, where “true” parses are missing, the transform matrix is obtained by maximizing the log likelihood of the parses of test data decoded using the model before adaptation. The proposed algorithm can be applied to supervised adaptation, as well.

Abstract: Methods and arrangements for accessing a storage structure. Included are an arrangement for providing a storage access instruction, an arrangement for inputting an address into a storage structure data cache responsive to a storage access instruction, an arrangement for extending a storage access instruction with a predicted register number field, the predicted register number field containing a predicted register number corresponding to a speculative location of a load/store operand associated with a storage access instruction, an arrangement for speculatively accessing a storage structure with a storage access instruction extended by the extending arrangement, and an arrangement for reverting to the arrangement for inputting an address if the load/store operand is not in the speculative location.

Abstract: A computer system is presented which provides a trusted platform by which operations can be performed with an increased level trust and confidence. The basis of trust for the computer system is established by an encryption coprocessor and by code which interfaces with the encryption coprocessor and establishes root of trust metrics for the platform. The encryption coprocessor is built such that certain critical operations are allowed only if physical presence of an operator has been detected. Physical presence is determined by inference based upon the status of registers in the core chipset.

Abstract: An arrangement for providing protection to wireless portable transponders (including resonant tags such as RFID tags) from unauthorized interrogation by employing a mechanical arrangement for disabling reception by or from the antenna of the transponder. The tags can be protected from receiving or providing unauthorized or unwanted information. Contemplated are mechanical arrangements that permit the owner to decide when reception/interrogation of personal or other information is not desired by employing the provided mechanical disable control arrangement. Also broadly contemplated herein is the altering interrogation characteristics of RFID tags to such an extent that they may still be read at a close range instead of the original range, and this result of this altering is visible to the user.

Abstract: A conductor with improved magnetic field per current ratio is disclosed. The conductor includes a magnetic liner lining a second surface and sides thereof. The magnetic liner is preferably a super-paramagnet with high susceptibility or a ferromagnet with a microstructure where the size of the non-exchanged coupled micro domains is so small that their energy content is close to or small compared to kT that such films have super-paramagnetic properties and essentially behave like a paramagnet with high susceptibility.

Abstract: Methods and arrangements for facilitating database access in speech recognition. A plurality of possible subsequences corresponding to a database entry are ascertained, a record of such subsequences and their correspondence to database entries is created, and either or both of the following are carried out: unique signatures are ascertained via determining whether a subsequence corresponding to a given database entry does not also correspond to at least one other database entry; and/or multiple occurrences of a given subsequence are found, with corresponding database entries being grouped into a confusion set.

Abstract: Methods and arrangements for facilitating notification among at least two nodes in a distributed network, involving the designation of one of the nodes as a publisher node, the designation of at least one other of the nodes as at least one subscriber node, and the propagation of a transmission from the publisher node to the at least one subscriber node via at least one link. The propagation is undertaken via only one distinct transmission along any single link.

Abstract: Methods and arrangements for facilitating the integration of devices, such as hardware components, with a computer operating system or the like. Contemplated herein are self-describing devices that serve to eliminate one or more intermediate steps commonly encountered heretofore.

Abstract: Arrangements and method for enabling and disabling cache bypass in a computer system with a cache hierarchy. Cache bypass status is identified with respect to at least one cache line. A cache line identified as cache bypass enabled is transferred to one or more higher level caches of the cache hierarchy, whereby a next higher level cache in the cache hierarchy is bypassed, while a cache line identified as cache bypass disabled is transferred to one or more higher level caches of the cache hierarchy, whereby a next higher level cache in the cache hierarchy is not bypassed. Included is an arrangement for selectively enabling or disabling cache bypass with respect to at least one cache line based on historical cache access information.