Abstract: The present invention relates to a method in a base station (110a, 110b, 210a, 210b, 210c, 410a, 410b) for managing inter-cell interference in a communications network, comprising a scheduler in each cell which controls a set of shared radio resources, said radio resources being at least near orthogonal to each other. The method comprises the steps of: obtaining (601) data representing path gain measurements, obtaining (602) data representing a cell specific resource price from one or several interfered base stations, combining (603) said information into a user specific resource price value for each radio resource, calculating (604) a user specific weighted channel quality indication value for each radio resource by combining a channel quality indication (CQI) information available for each given user with at least a product of said user specific resource price and the required transmit power for each user, and making (605) a scheduling decision based on said user specific weighted CQI values.

Abstract: An electronic device requires valid control keys to change any usage restriction setting. The device is provided control keys, a secret key, and a signed software object including a batch ID and a hash of the secret key. For each control key, the device generates a cryptographic footprint bound to the device and the secret key. A message authentication code (MAC) of each usage restriction setting is generated, the MAC bound to the device and a control key. To change a usage restriction, the device receives a control key, validates it against the stored footprint, changes the usage restriction settings, and generates a new usage restriction setting MAC. The control key footprints are bound to the secret key, but the device retains only a hash of the secret key.

Abstract: A method may include determining whether a discrepancy exists between scheduling headroom computable by a first device and scheduling headroom computable by a second device, determining one or more load measurements that the second device bases its computation of the scheduling headroom if it is determined that the discrepancy exists, modifying the one or more load measurements, and calculating the scheduling headroom based on the modified one or more load measurements.

Abstract: The invention relates to a data communications network and a method of operation thereof. A data communications network (14) is described which includes a call server (58, 60, 62, 64) for the purpose of signalling, and a routing server (66, 68) for the purpose of routing to permit communication between users of the network. The call server (58, 60, 62, 64) is operable to send a request to the routing server (66, 68) for the purpose of obtaining the identity of another call server (58, 60, 62, 64) to which it is required to communicate. The request is provided with a parameter which relates to the origin of the communication within the data network (14) to enable a desired routing of the communication through the network.

Abstract: A hygienic insert connector assembly that prevents biological contamination within food, beverage and biopharma processes includes an insert to pass through an opening into a fluid chamber, a support assembly, a seal disposed around the insert to seal the opening into the fluid chamber, and a seal compression mechanism. When the seal is axially compressed, the seal radially expands and contacts both the wall of the opening into the fluid chamber and the insert to collectively form a fluid tight seal. This eliminates the potential for product entrapment with the associated biological contamination risk, and allows efficient in-place cleaning and sterilization. The connector assembly can be installed in any orientation and functions such that positive pressure inside the fluid chamber enhances the sealing mechanism. The simple design enables the insert to be easily removed, examined, and re-inserted in conformance with international sanitary design standards.

Abstract: According to the teachings disclosed in this document, a receiver estimates impairment correlations for a received signal using received pilot values. This direct estimation of impairment correlations based on direct pilot observations, provides for a rich capture of all impairment sources bearing on the received signal. Advantageously, however, estimation noise is reduced by generating a structured covariance matrix from the measured covariance matrix, and carrying out structured filtering within the structured covariance matrix. Structured filtering involves averaging matrix elements that correspond to the same processing delay difference as used for measured impairment correlation estimation. In one or more embodiments, averaged net channel estimates are used to obtain a rank one matrix, which is used to convert a measured covariance matrix to a structured covariance matrix, for carrying out structured filtering.

Abstract: A method of and a receiver(20) for detection of a received signal in an optical fiber communication system using Viterbi algorithm methodology in which branch metrics are obtained using approximated expressions to calculate the branch metrics. Use of the expressions results in practically the same performance as a receiver based on exact metrics.

Abstract: A multi-grid tic-tac-toe game herein requires players to strategically plan moves in advance. An associated game apparatus includes a plurality of individual tic-tac-toe grids. Each grid includes playing areas that receive playing pieces. At least one of the grids shares at least one common playing area with another one of the grids. To play, different players use different sets of playing pieces. The players take turns placing their pieces in different playing areas, attempting to form tic-tac-toes. A player forms a tic-tac-toe if he or she places a predetermined number of pieces in a corresponding number of adjacent playing areas that are aligned, irrespective of whether those playing areas belong to different grids. Points are awarded for each tic-tac-toe, and are accumulated over the course of the game. The game apparatus may include a mechanism for tracking each player's points. The winner is the player with the most points accumulated.

Abstract: Methods, systems, and devices for allocating communications-related charges are disclosed. In an exemplary method, a communications device receives notification of an uncompleted incoming call attempt, the notification including a calling a party identifier. The communication device retrieves a call attempt descriptor associated with the uncompleted incoming call, the call attempt descriptor comprising charge-back data. In response to the initiation of a return call to the calling party, the communication device sends a charge-back message, comprising all or part of the charge-back data, to a charge allocation server for use in allocating charges relating to the return call. An exemplary system, including a charge allocation server, for implementing the disclosed methods is also disclosed.

Abstract: Control entity and method for setting up a session in a communications network, subscriber database and communications network The invention relates to a control entity for setting up a session in a communications network, comprising an input device for receiving a request to set up a session in the communications network, a processor unit for processing the request, and an output device for sending messages. The control entity further comprising or having access to a memory for storing information. The processor unit is arranged to determine if the request comprises a valid Communication Service Identifier, CSI, the Communication Service Identifier identifying the type of communication service of the session that is to be established over the communications network. And if the request does not comprise a valid Communication Service Identifier to execute a default CSI procedure using default CSI information stored in the memory.

Abstract: A Distributed Antenna System employs a downlink transmission method that requires limited channel information feedback and less coherency between signals than is required for information broadcast. Distributed antennas are treated as diversity antennas with a given power allocation. Each antenna can transmit to multiple UEs by transmitting a weighed sum of their signals, and multiple antennas can transmit to one UE by transmitting weighed space-time (or space-frequency) coded signals. The power allocation weights are determined as an optimum power allocation policy with per-antenna power constraints.

Abstract: A method of variable rate vector quantization reduces the amount of channel state feedback. Channel coefficients of a communication channel are determined and second order statistics (e.g., variances) of the channel taps are computed). Bit allocation for the channel taps are determined based on the coefficients statistics. The channel taps are individually quantized at rates determined based on said bit allocations.

Abstract: In a robotic tool coupler, a rotating cam member having a plurality of surfaces formed therein urges a plurality of ball members in one tool coupling unit radially to contact an angled surface in the other tool coupling unit. Further rotation of the cam member exerts a radial force through the ball members onto the angled surface. A component of that force is directed by the angled surface toward the opposite tool coupling unit, locking the two units together. The cam member may include a failsafe surface and/or a failsafe lobe to maintain the two units locked together in the event of a loss of power to positively actuate the cam member.

Abstract: According to one aspect, the present invention advantageously provides a method and apparatus that increase communications throughput by manipulating the order or manner in which CQI values are reported in a multi-rank CQI report that constrains one or more such values according to reporting order. As a non-limiting example, the present invention provides that the reporting order used for reporting multiple CQI values is chosen to eliminate or at least reduce under-reporting and over-reporting errors arising from the use of differential reporting formats for one or more of the reported CQI values. Additionally, the present invention provides for selection between single-rank or multi-rank CQI reporting, based on determining which one corresponds to the highest channel capacity, in view of the differential reporting constraints.

Abstract: A receive station of the present invention despreads a received signal over both long and short despreading periods to determine individual channel estimates over each symbol period of an extended period for multiple pilot signals. As a result, the present invention provides channel estimates sufficient for both slow and fast fading conditions. The receive station determines an average channel estimate for each of the pilot signals over the extended period by despreading the received signal over the extended period using mutually orthogonal extended spreading sequences. The receive station further determines a combined channel estimate for the pilot signals over each symbol period of the extended period by despreading the received signal over each symbol period using a common spreading sequence. Based on the average and combined channel estimates, the receive station determines individual channel estimates for each pilot signal over each symbol period of the extended period.

Abstract: Methods and apparatus for adaptively transmitting data in a wireless communication network are disclosed, in which channel conditions between a mobile terminal and two or more base stations in an active set are evaluated and used to select a transmission mode from a set of available downlink transmission modes including a non-interference-coordinated point-to-point transmission mode as well as at least one of a multi-cell single-frequency-network transmission mode and an interference-coordinated point-to-point transmission mode. Using the dynamic transmission mode selection described herein, a higher cell-edge throughput in HSDPA systems may be achieved.

Abstract: The teachings herein present a method and apparatus for protecting usage restriction data that governs usage of an electronic device. A cryptographic circuit supports secure and non-secure accesses. When non-securely accessed, it is operable only to verify the stored usage restriction data, and, when securely accessed, it is operable to generate a new message authentication code for changed usage restriction data, for subsequent authentication of that data. The usage restriction data may be stored in non-secure memory and may include static and dynamic parts. One or more embodiments include a secure circuit indicating whether the device has been initialized. The cryptographic circuit outputs a message authentication code for the static part using a permanent device key from the secure circuit, only if the device has not been initialized, and outputs a message authentication code for the dynamic part as needed to support authorized changes to the dynamic part.

Abstract: A stud spacer for a metal wall having a series of spaced apart studs with each stud having a pair of flanges and an interconnected web with the web having an opening therein. Connected between each pair of consecutive studs is a stud spacer. Each stud spacer includes a pair of end flanges that are secured to the web of an adjacent stud. In addition, each stud spacer includes a projection that projects through an opening in the adjacent stud and extends into an opening or slot in an adjacent stud spacer such that the respective stud spacers are effectively linked or connected by the projections of the various stud spacers found in the metal wall.

Abstract: A communication network protection system made up of interconnected networks, at least one of which has an automatic control plane (for example ASTN) among which are terminal interconnecting nodes. With the terminal interconnection nodes, termed primary nodes, are associated corresponding secondary terminal nodes wherein a secondary terminal node is used to realize a protection circuit in case of failure of the associated primary node.

Abstract: Methods and apparatus for securely streaming multimedia packets, such as RTP packets, are disclosed, in which the payloads of the packets are shuffled. This reordering is performed using a shuffling function that depends on sequence numbers associated with each of the packets, a pre-determined group size N, and a pre-determined initialization value; in some embodiments this shuffling function comprises a cryptographic hashing function or other one-way function. A receiving device may reverse the shuffling, using a similar shuffling function, if the pre-determined group size N and the pre-determined initialization value are known.