Abstract: A seating unit that includes a linkage mechanism adapted to adjust between closed, extended, and reclined positions is provided. The linkage mechanism includes a seat-mounting plate mounted to a footrest assembly, a back-mounting link and a rear bellcrank both rotatably coupled to the seat-mounting plate, an activator bar that controls a footrest drive link, and a linear actuator for carrying out automated adjustment of the linkage assembly. In operation, a stroke in a first phase of the linear actuator generates a torque on the activator bar. The footrest drive link converts the torque into a laterally-directed force that pushes the footrest assembly into the extended position. A stroke in the second phase acts to push the activator bar forward and translate the seat-mounting plate forward at a consistent inclination angle. The forward translation causes the rear bellcrank to rotate, thereby biasing the back-mounting link rearward into the reclined position.

Abstract: A method and arrangement for failure handling in a tree-structured communications network having interconnected edge nodes and switching nodes. VLANs may be established by using spanning trees to provide connectivity in case of a failure in the network. Emitters in the edge nodes periodically broadcast alive messages on the VLANs, and notifiers note the alive messages. A missing alive message indicates a failure on one of the VLANs, and the notifier broadcasts corresponding failure messages on the VLANs. When the alive messages are restored, the notifier broadcasts corresponding repair messages. If a notifier fails to note a failure, one of the edge nodes performs a similar function although somewhat slower.

Abstract: A method of load balancing zero-bandwidth Traffic Engineering Label Switching Paths (0-bw TE LSPs) in a communication network having a plurality of network nodes and a plurality of network links connecting the nodes. The method may be implemented in a centralized Path Computation Element (PCE) or in an ingress router. Each equal cost path from a source node to a destination node is identified from network topology information. A probability of selecting each equal cost shortest path is determined using an iterative Global Load balancing Algorithm (GLA) and each 0-bw TE LSP is provisioned with a specific probability such that the 0-bw TE LSPs are uniformly distributed over all network links.

Abstract: The invention provides a reconfigurable module allowing morphological operations to be carried out for image processing. The module includes an operational block having five inputs, three outputs, three adders/subtracters and four logic blocks. The logic blocks provide various routings between the three adders/subtracters to enable the outputs to deliver the result of basic operations carried out on the five inputs. The reconfigurable module has a reduced number of components while at the same time allowing various morphological operations to be performed whose parameters can be modified. Furthermore, the reconfigurable module is serially combined to carry out more complex morphological operations. The invention also provides a method for implementing the reconfigurable module allowing an integral image, an eroded image, an expanded image, a distance image or projections along the rows and columns of the original image to be determined starting from an original image.

Abstract: Breathable, water resistant protective articles, such as garments, sleeping bags, and the like, which are readily packable into small volumes. The articles are constructed from an outer layer comprising a laminate of a textile bonded to a barrier layer, an insulation layer and an inner layer comprising an air permeable textile.

Abstract: An apparatus, method, and system for dynamically assigning orthogonal codes to different information signals communicated between a Node B and user equipment in a cellular radio communication system in which a fixed number of codes are allocated between dedicated transport channels (DCHs) and high speed downlink shared channels (HS-DSCHs). A radio controller (RNC) allocates a minimum number of codes for HS-DSCH physical channels (HS-PDSCH codes) to the Node B. The Node B determines HS-PDSCH codes that are not currently being utilized and allocates HS-PDSCH codes from the unused codes without having to communicate with the RNC. When the additional HS-PDSCH codes are needed for DCH codes, the Node B reallocates the codes for DCH purposes without reducing the number of HS-PDSCH codes below the allocated minimum.

Abstract: Networks, network devices and methods of synchronization using transfer of synchronization packets are provided. Some network devices are configured to use either a timing reference extracted based on GPS signals or an imported timing reference, as an operative time reference. A network device from which to import the time reference is selected and may be updated to meet a selection rule related to the quality of receiving the transfer of synchronization packets.

Abstract: An oscillation detector having an RF oscillator configured to be synchronized with a first frequency and a comparator for distinguishing the synchronized state from the non-synchronized state of the radiofrequency oscillator on the basis of an oscillating signal produced by the radiofrequency oscillator and indicating the presence of oscillations in a frequency band around the first frequency in response to identifying the synchronized state and, in alternation, indicating the absence of oscillations in this frequency band otherwise.

Abstract: The present invention is directed towards a composition comprising, in an aqueous medium: (a) at least one anti-dandruff agent; (b) at least one viscosity modifying agent; (c) at least acrylic-based polymeric compound different from the viscosity modifying agent; (d) at least two surfactants chosen from amphoteric surfactants and zwitterionic surfactants; and (e) optionally, at least one conditioning agent. The present invention also relates to a process for the care of hair and/or scalp.

Abstract: A method and telecommunication node for authenticating with an IP Multimedia Subsystem (IMS) network, a nomadic user in an access network. The node receives from the access network, an access identifier defining a mobile terminal's physical location. In response, the node retrieves from a database, a registered access identifier associated with the user and determines whether the received identifier matches the registered identifier. If the identifiers match, the node authenticates the user in the IMS network. If the identifiers do not match, the node performs an alternate authentication method.

Abstract: The computation of code-specific channel matrices for an Assisted Maximum Likelihood Detection (AMLD) receiver comprises separately computing high rate matrices that change each symbol period, and a low rate matrix that is substantially constant over a plurality of symbol periods. The high and low rate matrices are combined to generate a code-specific channel matrix for each receiver stage. The high rate matrices include scrambling and spreading code information, and the low rate matrices include information on the net channel response and combining weights. The low rate matrices are efficiently computed by a linear convolution in the frequency domain of the net channel response and combining weights (with zero padding to avoid circular convolution), then transforming the convolution to the time domain and extracting matrix elements. Where the combining weights are constant across stages, a common code-specific channel matrix may be computed and used in multiple AMLD receiver stages.

Abstract: A client terminal and method for receiving Internet Protocol (IP) media packets over an IP distribution network. The client terminal includes a plurality of interfaces to the IP distribution network, the interfaces configured to receive media packets according to multicast, unicast, and peer-to-peer media distribution protocols. A media cache controller determines whether the media packets received over the interfaces are tagged as non-cacheable. If so, the media cache controller passes the media packets to a decoder for decoding and transmission to a video renderer. When the received media packets are not tagged as non-cacheable, the media cache controller caches the media packets in a local cache, and subsequently distributes the cached media packets to another client terminal or to a caching node using the unicast or the peer-to-peer media distribution protocol. Media packets received using one media distribution protocol may be distributed using a different media distribution protocol.

Abstract: Line cards receive control packets and perform a hierarchical rate limiting on those control packets. A set of identifier keys are extracted from the control packets and the protocol of those control packets are determined. At a first level, the control packets are rate limited per unique set of identifier keys per protocol. Those packets which fail the first rate limiting level are dropped. Those packets which pass the first rate limiting level are rate limited at a second level per protocol type. Those packets which fail the second level rate limiting are dropped while those packets which pass the second level rate limiting are sent to the control card for further processing.

Abstract: An image (1) is decomposed into multiple superblocks (20, 22), each encompassing multiple pixel blocks (30A-30D, 32A-32D) having multiple pixels (40). The property values of a superblock (20) is fixed rate compressed to get a compressed block having a target bit length. The compressed block is stored in the memory locations (310, 320) assigned to the multiple pixel blocks (30A-30D) encompassed by the superblock (20) to thereby get multiple copies of the compressed block in the memory (300). The multiple copies collectively constitute a compressed representation of the superblock (20). When accessing a compressed block in a memory location (310) using random access during decoding, property values for neighboring pixel blocks (30B-30D) are obtained for free without the need for any further memory access.

Abstract: A method for calibrating coefficients of an observer of a variable state of a physical system from measurements of physical quantities of the system, at different instants includes measuring a variable of the physical system at several instants, the variable being a function of a system state variable, and determining a vector of coefficients that minimizes a sum of the number of measurements of a square of a norm of a vector that is the difference between the measured variable and a function of the system state variable and the vector of coefficients. The minimization is subject to a constraint that the trajectory of the measured variable be within a corridor of uncertainty on either side of a trajectory of its estimate, at least for the measurement instants.

Abstract: A system for a conjugate gradient iterative linear solver that calculates the solution to a matrix equation comprises a plurality of gamma processing elements, a plurality of direction vector processing elements, a plurality of x-vector processing elements, an alpha processing element, and a beta processing element. The gamma processing elements may receive an A-matrix and a direction vector, and may calculate a q-vector and a gamma scalar. The direction vector processing elements may receive a beta scalar and a residual vector, and may calculate the direction vector. The x-vector processing elements may receive an alpha scalar, the direction vector, and the q-vector, and may calculate an x-vector and the residual vector. The alpha processing element may receive the gamma scalar and a delta scalar, and may calculate the alpha scalar. The beta processing element may receive the residual vector, and may calculate the delta scalar and the beta scalar.

Abstract: A system, method, and owner node for securely changing a mobile device from an old owner to a new owner, or from an old operator network to a new operator network. The old owner initiates the change of owner or operator. The old owner or operator then commands the mobile device to change a currently active first key to a second key. The second key is then transferred to the new owner or operator. The new owner or operator then commands the mobile device to change the second key to a third key for use between the mobile device and the new owner or operator. Upon completion of the change, the new owner or operator does not know the first key in use before the change, and the old owner does not know the third key in use after the change.

Abstract: A method and device for determining an adaptive filter having multiple filter parameters, wherein a first filter parameter has a first level of adaptivity and a second filter parameter has a second, different level of adaptivity. Parameter values for the first filter parameter are determined among a first set of allowable filter parameter values. Parameter values for the second filter parameter are correspondingly determined among a second, different set of allowable filter parameter values. The different levels of adaptivity in the filter parameters are achieved because the second set includes more allowable filter parameter values than the first set. The adaptive filter is advantageously used in filtering in intra- or inter-predication during video encoding and decoding.