Abstract: A cooking appliance device includes a heating unit including an induction coil having an electric conductor, a substrate unit, and a fastening unit configured to fasten the induction coil to the substrate unit. The fastening unit fastens the electric conductor in at least one region on the substrate unit such that the electric conductor is movable relative to the substrate unit.

Abstract: A fence cap system, comprising a cover, a cap claw, a securing screw, wherein the cover includes an upper portion that is pyramid-shaped with an apex and a base, the apex including a cover hole designed to receive the securing screw, wherein the cap claw includes a center portion that includes a claw hole designed to receive the securing screw, and wherein the securing screw secures the cap claw to the cover when it is received through the cover hole and the claw hole.

Abstract: Use of simple acyclic polyamines for the treatment of parasites of the family Trypanosomatidae The present invention provides the use of certain single acyclic polyamines of Formula (I), attached to heterocycles, for the treatment of leishmaniasis and trypanosomiasis. All the compounds studied show antiparasitic activity against Leishmania species, comparable or superior to that of the active ingredient of the drug commonly used to treat this disease, but with a macrophage toxicity similar to or, in most cases, lower than that of the commercial reference compound, and with higher selectivity indices against strains representative of the three clinical forms of the disease: cutaneous, mucocutaneous and visceral. The compounds show ability to inhibit parasite superoxide dismutase, generally at concentrations lower than those required to inhibit human superoxide dismutase. All this supports its usefulness for treating leishmaniasis and also trypanosomiasis.

Abstract: An antenna array module for a communication system on a cargo ship, includes at least a first, a second and a third antenna element, each mounted on a ground plane and containing an antenna feed. The first antenna element is tilted with respect to the second antenna element. The first and the second antenna element are arranged to radiate mainly towards a first path along the cargo ship and the third antenna element is arranged to radiate mainly towards a second path opposite to the first path.

Abstract: A fence cap system, comprising a cover, a cap claw, a securing screw, wherein the cover includes an upper portion that is pyramid-shaped with an apex and a base, the apex including a cover hole designed to receive the securing screw, wherein the cap claw includes a center portion that includes a claw hole designed to receive the securing screw, and wherein the securing screw secures the cap claw to the cover when it is received through the cover hole and the claw hole.

Abstract: Certain embodiments enable improved encoding and decoding of a vector of coefficients by associating a vector element of a signed pyramid with an encoded value that includes a first portion and a second portion, where the first portion identifies a corresponding vector element of an unsigned pyramid and a second portion characterizes sign values for nonzero components of the vector element of the signed pyramid. As a result, computational constraints such as word size apply to the unsigned pyramid instead of the signed pyramid. The smaller size of the unsigned pyramid enables extending the range of signed pyramid parameters that are operable within the computational constraints.

Abstract: Certain embodiments enable improved encoding and decoding of a vector of coefficients by associating a vector element of a signed pyramid with an encoded value that includes a first portion and a second portion, where the first portion identifies a corresponding vector element of an unsigned pyramid and a second portion characterizes sign values for nonzero components of the vector element of the signed pyramid. As a result, computational constraints such as word size apply to the unsigned pyramid instead of the signed pyramid. The smaller size of the unsigned pyramid enables extending the range of signed pyramid parameters that are operable within the computational constraints.

Abstract: A post guard system, comprising a guard sleeve attached to a base portion of a fence type post, the guard sleeve composed of a front panel with a front right lateral edge, a front left lateral edge, a right side panel extending at ninety degrees from the front right lateral edge and a left side panel extending at ninety degrees from the front left lateral edge. The front panel dimensioned to cover fully the width of a front or back face of the fence type post at the bottom portion, the front right lateral edge and the front left lateral edge each having a rounded surface that cover an edge of the fence type post at the bottom portion and the right side panel. The left side panel each dimensioned to cover approximately half the width of a side face of the fence type post at the bottom portion.

Abstract: Use of Generalized Context Trees to assign a unique state from a finite set to any string is provided. The method optionally refines the generalized context tree into a refined generalized context tree having a finite state machine (FSM) property. Refining occurs whenever the generalized context tree does not have the finite state machine property. Alternately, a method for constructing a representation of a source usable within an FSM is provided, comprising evaluating a node comprising a suffix tail and verifying the suffix tail is included in the representation, and inserting at least one node to the representation when the suffix tail is not in the representation.

Abstract: A method for encoding and decoding a sequence is provided. The method comprises searching a set of candidate trees varying in size for a tree T having a plurality of states. Tree T provides a structure that relatively minimizes code length of the sequence from among all the candidate trees. The method further comprises encoding data conditioned on the tree T, which may be a generalized context tree (GCT), using a sequential probability assignment conditioned on the states of the tree T. This encoding may use finite state machine (FSM) closure of the tree. Also provided are methods for decoding an encoded binary string when the encoded string includes a full tree or generalized context tree, as well as decoding an encoded string using incomplete FSM closure, incremental FSM, and suffix tree construction concepts.

Abstract: Use of Generalized Context Trees, a means for assigning a unique state from a finite set to any string, is provided. The method optionally refines the generalized context tree into a refined generalized context tree having a finite state machine (FSM) property. Refining occurs whenever the generalized context tree does not have the finite state machine property. Alternately, a method for constructing a representation of a source usable within an FSM is provided, comprising evaluating a node comprising a suffix tail and verifying the suffix tail is included in the representation, and inserting at least one node to the representation when the suffix tail is not in the representation.

Abstract: A method for encoding and decoding a sequence is provided. The method comprises searching a set of candidate trees varying in size for a tree T having a plurality of states. Tree T provides a structure that relatively minimizes code length of the sequence from among all the candidate trees. The method further comprises encoding data conditioned on the tree T, which may be a generalized context tree (GCT), using a sequential probability assignment conditioned on the states of the tree T. This encoding may use finite state machine (FSM) closure of the tree. Also provided are methods for decoding an encoded binary string when the encoded string includes a full tree or generalized context tree, as well as decoding an encoded string using incomplete FSM closure, incremental FSM, and suffix tree construction concepts.