Abstract:
A system, method and computer program product for hierarchical sparse dictionary learning (“HiSDL”) to construct a learned dictionary regularized by an a priori over-complete dictionary, includes providing at least one a priori over-complete dictionary for regularization, performing sparse coding of the at least one a priori over-complete dictionary to provide a sparse coded dictionary, using a processor, updating the sparse coded dictionary with regularization using at least one auxiliary variable to provide a learned dictionary, determining whether the learned dictionary converges to an input data set, and outputting the learned dictionary regularized by the at least one a priori over-complete dictionary when the learned dictionary converges to the input data set. The system and method includes, when the learned dictionary lacks convergence, repeating the steps of performing sparse coding, updating the sparse coded dictionary, and determining whether the learned dictionary converges to the input data set.
Abstract:
A method implemented in an access point (AP) having N antennas used in a wireless communications system including two first client devices each of which has M antennas and two second client devices each of which has N antennas, where M and N are even is disclosed. The method comprises: performing interference alignment (IA) in common vector spaces; and delivering M+N streams. Other methods, systems, and apparatuses also are disclosed.
Abstract:
Systems and methods are disclosed for detecting an object in an image by determining convolutional neural network responses on the image; mapping the responses back to their spatial locations in the image; and constructing features densely extract shift invariant activations of a convolutional neural network to produce dense features for the image.
Abstract:
Various methods are provided directed to a compiler-guided software accelerator for iterative HADOOP® jobs. A method includes identifying intermediate data, generated by an iterative HADOOP® application, below a predetermined threshold size and used less than a predetermined threshold time period. The intermediate data is stored in a memory device. The method further includes minimizing input, output, and synchronization overhead for the intermediate data by selectively using at any given time any one of a Message Passing Interface and Distributed File System as a communication layer. The Message Passing Interface is co-located with the HADOOP® Distributed File System.
Abstract:
Systems and methods of transmitting includes one or more low-density parity-check (LDPC) encoders configured to adaptively encode one or more streams of input data by adjusting error correction strength based upon channel conditions. One or more mappers are configured to map one or more encoded data streams to symbols by associating bits of the symbols to points of an optimum signal constellation design (OSCD) based on one or more encoded data streams, the OSCD being decomposed into two or more sub-constellations. A spectral multiplexer is configured to combine symbol streams for the one or more encoded data streams to provide a plurality of spectral band groups. A mode multiplexer is configured to combine spectral contents of the plurality of spectral band groups allocated to a plurality of spatial modes for transmission over a transmission medium.
Abstract:
A method for performing three-dimensional (3D) localization requiring only a single camera including capturing images from only one camera; generating a cue combination from sparse features, dense stereo and object bounding boxes; correcting for scale in monocular structure from motion (SFM) using the cue combination for estimating a ground plane; and performing localization by combining SFM, ground plane and object bounding boxes to produce a 3D object localization.
Abstract:
Systems and methods are provided for identifying combinatorial feature interactions, including capturing statistical dependencies between categorical variables, with the statistical dependencies being stored in a computer readable storage medium. A model is selected based on the statistical dependencies using a neighborhood estimation strategy, with the neighborhood estimation strategy including generating sets of arbitrarily high-order feature interactions using at least one rule forest and optimizing one or more likelihood functions. A damped mean-field approach is applied to the model to obtain parameters of a Markov random field (MRF); a sparse high-order semi-restricted MRF is produced by adding a hidden layer to the MRF; indirect long-range dependencies between feature groups are modeled using the sparse high-order semi-restricted MRF; and a combinatorial dependency structure between variables is output.
Abstract:
A method for determining use of a second life battery under load conditions to reduce CO2 emissions includes using Monte Carlo simulations to modeling uncertainties of a load profile, a renewable energy profile, and CO2 emissions rate, determining an initial state of charge SOC of the second life battery based on a Gaussian distribution for determining a rate of charging during low emission hours and discharging during high CO2 emission hours of the second life battery and storage size of the second life battery and CO2 emissions reduction.
Abstract:
A wireless communications method implemented in a transmission point (TP) used in a wireless communications system is disclosed. The wireless communications method comprises receiving, from another TP, channel state information (CSI) for a user equipment (UE), and receiving, from said another TP, user identification for the user equipment, wherein the signaling of the CSI for the user equipment enables user identification for the user equipment. Other methods, systems, and apparatuses also are disclosed.
Abstract:
A method implemented in a network apparatus used in a wavelength division multiplexing (WDM) optical network is disclosed. The method includes (a) finding K-shortest routes between each node pair (s, d), where s, dεV and |V|≦K, where V is a set of reconfigurable optical add-drop multiplexer (ROADM) nodes, (b) selecting unconsidered node pair (s, d), (c) selecting unconsidered route k between nodes s and d out of the K-shortest routes, (d) finding a bit map of route k by performing bit-wise logical AND operation on bit vectors of fibers along route k, (e) selecting unconsidered line rate l out of offered set L of line rates, and (f) finding a probability αls,d,k of provisioning a connection with line rate l. Other apparatuses, systems, and methods also are disclosed.
Abstract translation:公开了一种在波分多路复用(WDM)光网络中使用的网络装置中实现的方法。 该方法包括:(a)找到每个节点对(s,d)之间的K个最短路径,其中s,d&egr; V和| V |和nlE; K,其中V是可重配置光分插复用器(ROADM) 节点,(b)选择未考虑的节点对(s,d),(c)从K个最短路由中的节点s和d之间选择未被考虑的路由k,(d)通过逐位执行寻找路由k的位图 沿着路线k对光纤的位向量进行逻辑与运算,(e)从所提供的线路速率集合L中选择未考虑的线路速率l,以及(f)找到用线路速率l提供连接的概率αls,d,k。 还公开了其他装置,系统和方法。