Abstract: A method for low-density parity-check hard decision decoding includes computing, for every decoding iteration, a discrepancy of extrinsic messages responsive to channel inputs of a receiver, performing a flipping of the channel inputs responsive to a comparison of the discrepancy of extrinsic messages to a flipping threshold, the flipping threshold for each decoding iteration being determined based on a threshold computation responsive to a channel error probability estimation in a first iteration of a decoding of the channel inputs, and check node decoding responsive to the flipping of channel inputs.

Abstract: A method for customizable flow management in a cellular basestation including configuring a framework on a cellular basestation; and executing customized flow management functions through the framework by an external entity.

Abstract: Systems and methods are disclosed to analyze a social network by generating a data tensor from social networking data; applying a non-negative tensor factorization (NTF) with user prior knowledge and preferences to generate a core tensor and facet matrices; and rendering information to social networking users based on the core tensor and facet matrices.

Abstract: A method and system for determining whether a given electromagnetic frequency is in use. An incoming signal is sampled and a test statistic is calculated based on the magnitude of the received samples and a predetermined constant. A determination is then made regarding whether the frequency is in use, based on whether the test statistic has exceeded a threshold.

Abstract: Rate matching and rate shaping methods and systems for managing data traffic on wireless channels are disclosed. Rate matching embodiments dynamically determine downlink video data transmission rates based on frame decoding deadlines and frame sizes. In addition, if the channel capacity cannot support the video data transmission rate, the rate matcher can adjust the video stream accordingly so that it is supportable by the channel capacity. In turn, rate shaping implementations can tailor the transmission rate shaping based on the state of the wireless data channel. Shaper operations can be specifically adapted to a saturated state of the wireless channel, to an unsaturated state of the wireless channel and to transitions between the unsaturated and saturated states.

Abstract: Implementations of the present principles include methods and systems for retransmitting un-recovered information within a cognitive radio, anti-jamming system. In accordance with aspects of the present principles, encoding schemes may be optimized for retransmission by utilizing a jamming rate and a number of un-recovered packets to minimize packet loss and thereby enhance throughput. In addition, rateless encoding features may be employed to re-encode un-recovered portions of an information sequence for efficient retransmission.

Abstract: Systems and methods are disclosed to recognize human action from one or more video frames by performing 3D convolutions to capture motion information encoded in multiple adjacent frames and extracting features from spatial and temporal dimensions therefrom; generating multiple channels of information from the video frames, combining information from all channels to obtain a feature representation for a 3D CNN model; and applying the 3D CNN model to recognize human actions.

Abstract: A method and system for training a neural network of a visual recognition computer system, extracts at least one feature of an image or video frame with a feature extractor; approximates the at least one feature of the image or video frame with an auxiliary output provided in the neural network; and measures a feature difference between the extracted at least one feature of the image or video frame and the approximated at least one feature of the image or video frame with an auxiliary error calculator. A joint learner of the method and system adjusts at least one parameter of the neural network to minimize the measured feature difference.

Abstract: A method and system for packet transmission in a hybrid automatic repeat request (ARQ) system. A modulation and a block length for a transmission are determined based on the average mutual information per bit. The average mutual information per bit is computed based on a current channel signal-to-noise ratio and a plurality of previous transmissions, each being transmitted with a respective coded block length, modulation form, and signal-to-noise ratio. A block error rate is computed for the potential block lengths and modulations based on the average mutual information per bit, and a throughput of the current transmission is determined based on the block error rate. The modulation form and the block length of the transmission are determined based on an analysis of the throughput. If the receiver cannot decode the current transmission, the transmitter repeats the computation to determine the modulation and the block length for retransmission.

Abstract: A method and system for use in describing a phenomenon of interest. The method and system computes a decision rule for use in describing the phenomenon of interest using training data relating to the phenomenon of interest, labels for labeling the training data, and hidden information about the training data or directed distances obtained from the hidden information, as inputs.

Abstract: A computer implemented method employing experience transfer to improve the efficiencies of an exemplary configuration tuning in computing systems. The method employs a Bayesian network guided tuning algorithm to discover the optimal configuration setting. After the tuning has been completed, a Bayesian network is obtained that records the parameter dependencies in the original system. Such parameter dependency knowledge has been successfully embedded to accelerate the configuration searches in other systems. Experimental results have demonstrated that with the help of transferred experiences we can achieve significant time savings for the configuration tuning task.

Abstract: Systems and methods are disclosed for scheduling one or more queries for execution with one or more cloud computers by applying a service level agreement (SLA) analysis using an SLA-tree data structure to each query in a query queue; using the SLA-tree data structure to determine an overall profit in the query queue; and generating a profit-oriented schedule to select the next query for execution by the cloud computers.

Abstract: Methods and apparatus are disclosed for applying successive multi-rank beamforming strategies (e.g., successive precoding strategies) for the design of precoders over a set of parallel channels. Successive beamforming is applied to a narrow band channel model and is also applied for finer quantization of a single beamforming vector (e.g., recursive beamforming). A first embodiment provides the optimal approach with high complexity. An alternative embodiment provides successive beamforming for near optimal precoding selection with medium complexity. A low complexity method for precoder selection is also provided wherein a channel representative matrix for the set of parallel channels is determined and successive beamforming on the calculated channel representative is applied.

Abstract: A method includes performing quantum state tomography from the statistics of a collection of measurements, each of which has only two possible outcomes and has the feature of being a measurement of a single qubit. By carefully choosing the measurements it becomes possible to infer the state of a quantum system from the statistics. Moreover, the function which computes the state from the measurement statistics can be computed efficiently in the dimension of the underlying system. Reconstructing the quantum state is performed in accordance with the following expression: ? = ( 2 d ? ? i = 1 d 2 - 1 ? ? p i ? P i + ( 1 - p i ) ? ( 1 - P i ) ) - ( d 2 - 2 d ) ? I d , where d is the dimension of the quantum mechanical system, ? is the state of the quantum mechanical system, Id denotes the identity operator, Pi is one of the plurality of measurement projectors, and pi is the probability for the measurement projector Pi.

Abstract: For each path in a first plurality of paths in said communication network, a respective first weighted path length is determined based at least in part on a number of pure wireless links in the path. From among the first plurality of paths, a second plurality of paths having first weighted path lengths less than a threshold value is selected. For each path in the second plurality, a respective second weighted path length is determined based at least in part on a number of pure optical links in the path, and from among the second plurality of paths, a transmission path is selected having a highest second weighted path length. Information is transmitted via the transmission path.

Abstract: Systems and methods are disclosed to partition a multicast group into a plurality of partitions where each partition has a mutually exclusive subset of users or clients; scheduling beam transmission with switched beamforming antennas; and performing the multicast transmission in accordance with the beam scheduling.

Abstract: Systems and methods are disclosed for determining 3D human pose by generating an Appearance and Position Context (APC) local descriptor that achieves selectivity and invariance while requiring no background subtraction; jointly learning visual words and pose regressors in a supervised manner; and estimating the 3D human pose.

Abstract: Methods and systems for reusing macro cell resources in femto cell base stations or relay stations in a non-collaborative manner are disclosed. In addition, orthogonal resource allocation between a macro cell base station and femto cell base stations/relay stations may be dynamically adjusted by considering user-population variance. Moreover, an additional level of spatial reuse by femto cell base stations or relay stations can be provided by employing macro cell user location information.

Abstract: A system and method for program verification by model checking in concurrent programs includes modeling each of a plurality of program threads as a circuit model, and generating a full circuit for an entire program by combining the circuit models including constraints which enforce synchronous execution of the program threads. The program is verified using the synchronous execution to reduce an amount of memory needed to verify the program and a number of steps taken to uncover an error.

Abstract: Multi-user (MU-) MIMO systems with quantized feedback are designed to maximize the sum-rate via scheduling and linear precoding. To maximize throughput over the network, quantized CSIT is sent through a low-rate feedback link feedback from a plurality of users back to a base station. The base station then determines a subset of the plurality of users to transmit one or more signals to based on the received feedback and determines a preceding matrix based on the received feedback from the plurality of users wherein the precoding matrix maximizes a sum-rate throughput for the subset of the plurality of users. Additionally, based on the received feedback, the base station designs a quantization codebook. This codebook may be designed off-line and/or online. The codebook and/or precoding matrix are used to transmit signals to the users.