Abstract: A method and incorporated assembly for enhancing structural rigidity of a computer rack used for housing electronic components is provided. In one embodiment, the assembly comprises a casing made of a lighter weight material and having protrusions. The protrusions are formed to receive one or more ruggedized inserts that is made of a heavier and/or stiffer material. The casing and the inserts together can be then used as a ruggedized side of a computer rack or cage.

Abstract: A coolant control unit for a liquid cooled electronics system is provided, which includes an external coolant inlet and outlet for receiving and returning external coolant; an internal coolant loop for circulating coolant to the electronics system; a first and second control valve coupling the external coolant inlet and outlet to the internal coolant loop; a heat exchanger connected between the first and second control valves; and control logic for controlling operation of the coolant control unit in one of an external coolant mode and an internal coolant mode. In the external coolant mode, the first and second control valves allow passage of external coolant through the internal coolant loop to the electronics system, and in the internal coolant mode, the first and second control valves isolate coolant within the internal coolant loop from the external coolant inlet and outlet, and pass the coolant therein through the heat exchanger.

Abstract: An event data update capability for a data frame of a browser-displayed page is provided by periodically retrieving event data using a refresh frame of the page and updating the data frame with the event data. The updating of the data frame uses code understood natively by the browser. Periodic retrieval of event data by the refresh frame uses the same network connection used to download the refresh frame from a server.

Abstract: The likelihood of significant errors in a decoded sequence is determined based on at least one criterion that is both extrinsic and intrinsic to the decoded sequence. In particular, this determination is preferably made by comparing a signal corresponding to the decoded sequence with a so-called error mitigation signal.

Abstract: A path-oriented approach is provided to determine surviving paths in a decoder. The paths that are retained as the surviving paths are some number, M, of the paths which have the smallest path metrics, even if two or more of those paths come into a given state. This approach provides significantly improved performance in at least those applications in which branch metrics are a function of the surviving path from which the branch emanates.

Abstract: Flow-induced noise affecting microphones used in such applications as cellular phones is reduced by providing a deflector, made of an acoustically transmissive, high flow resistance material, disposed at a certain distance from the microphone pressure sensing area. The distance between the pressure sensing are and the deflector may be determined experimentally in consideration of any space constraints imposed by the specific application, and for cellular phones in particular, is approximately as little as 2 or 3 mm from the outside surface of the deflector.

Abstract: List Viterbi algorithms are provided for decoding blocks or frames of convolutional coded information transmitted and received in a continuous mode, i.e., without blockwise termination with a tail. Viterbi decoding is utilized to estimate, for each respective one of a sequence of blocks of symbols, a terminating (and optionally a starting) state which is(are) used in subsequent application of a List Viterbi algorithm. The path memory should be sufficient to enable both the starting state and the terminating state used by the subsequent List Viterbi decoding to be estimated with reasonable accuracy and at the same time to keep track of the best paths between those states.

Abstract: An equivalence rule having the multiset version of the relational algebraic theta-semijoin operator is used in effectuating Constraint Magic rewriting on a computer programming language query having non-equality, as well as equality, predicates. In particular, the rule effectuates Constraint Magic rewriting for a single join. When applied repeatedly on a sequence of joins, Constraint Magic rewriting is effectuated for a single block query. The rule may be used to generate relational algebraic expressions to optimize or determine the equivalency of queries. Cost estimates for alternative ways of evaluating a complex query can be efficiently computed. Based on these computed cost estimates, the least costly implementation of a complex query is determined.