Flexible Remote Node (RN) For Dynamic Traffic Allocation in Passive Optical Networking (PON) and Mobile Backhaul (MBH) Applications
    401.
    发明申请
    Flexible Remote Node (RN) For Dynamic Traffic Allocation in Passive Optical Networking (PON) and Mobile Backhaul (MBH) Applications 有权
    灵活的远程节点(RN)用于无源光网络(PON)和移动回程(MBH)应用中的动态流量分配

    公开(公告)号:US20140314104A1

    公开(公告)日:2014-10-23

    申请号:US14254458

    申请日:2014-04-16

    Abstract: A computer implemented method for dynamically allocating traffic in a passive optical communication system includes employing an individual wavelength channel to carry different data services from an individual transmitter, configuring an optical network unit into optical network unit groups serving at least two community of users; and providing a flexible remote node with wavelength routing flexibility including switching wavelength traffic from optical network user groups with low capacity requirements to optical network user groups with increased wavelength traffic requirements.

    Abstract translation: 一种用于在无源光通信系统中动态分配业务的计算机实现方法包括采用单独的波长信道来承载来自各个发射机的不同数据业务,将光网络单元配置成服务于至少两个用户群的光网络单元组; 并提供具有波长路由灵活性的灵活的远程节点,包括将具有低容量要求的光网络用户组的波长业务切换到具有增加的波长业务需求的光网络用户组。

    INTERPRETABLE SPARSE HIGH-ORDER BOLTZMANN MACHINES
    402.
    发明申请
    INTERPRETABLE SPARSE HIGH-ORDER BOLTZMANN MACHINES 审中-公开
    易于理解的高阶BOLTZMANN机械

    公开(公告)号:US20140310221A1

    公开(公告)日:2014-10-16

    申请号:US14243918

    申请日:2014-04-03

    Inventor: Renqiang Min

    CPC classification number: G06N20/00

    Abstract: A method for performing structured learning for high-dimensional discrete graphical models includes estimating a high-order interaction neighborhood structure of each visible unit or a Markov blanket of each unit; once a high-order interaction neighborhood structure of each visible unit is identified, adding corresponding energy functions with respect to the high-order interaction of that unit into an energy function of High-order BM (HBM); and applying Maximum-Likelihood Estimation updates to learn the weights associated with the identified high-order energy functions. The system can effectively identify meaningful high-order interactions between input features for system output prediction, especially for early cancer diagnosis, biomarker discovery, sentiment analysis, automatic essay grading, Natural Language Processing, text summarization, document visualization, and many other data exploration problems in Big Data.

    Abstract translation: 用于执行高维离散图形模型的结构化学习的方法包括估计每个单元的每个可见单元或马尔科夫毯的高阶交互邻域结构; 一旦识别出每个可见单元的高阶相互作用邻域结构,就将该单元的高阶相互作用相应的能量函数加到高阶BM(HBM)的能量函数中; 并应用最大似然估计更新来学习与识别的高阶能量函数相关联的权重。 该系统可以有效地识别系统输出预测的输入特征之间的有意义的高阶交互,特别是对于早期癌症诊断,生物标志物发现,情绪分析,自动散文分级,自然语言处理,文本摘要,文档可视化以及许多其他数据探索问题 在大数据。

    Selective Max-Pooling For Object Detection
    403.
    发明申请
    Selective Max-Pooling For Object Detection 有权
    用于对象检测的选择性最大池

    公开(公告)号:US20140270367A1

    公开(公告)日:2014-09-18

    申请号:US14108295

    申请日:2013-12-16

    CPC classification number: G06K9/66 G06K9/4614 G06K9/4676 G06K9/6257

    Abstract: Systems and methods are disclosed for object detection by receiving an image and extracting features therefrom; applying a learning process to determine sub-regions and select predetermined pooling regions; and performing selective max-pooling to choose one or more feature regions without noises.

    Abstract translation: 公开了通过接收图像并从其中提取特征的对象检测的系统和方法; 应用学习过程来确定子区域并选择预定的汇集区域; 并执行选择性最大化池选择一个或多个没有噪声的特征区域。

    Low-Complexity Estimation of QAM Symbols and Constellations
    404.
    发明申请
    Low-Complexity Estimation of QAM Symbols and Constellations 有权
    QAM符号和星座的低复杂度估计

    公开(公告)号:US20140270023A1

    公开(公告)日:2014-09-18

    申请号:US14214497

    申请日:2014-03-14

    CPC classification number: H04L27/02 H04L27/3405 H04L27/38

    Abstract: Disclosed are methods and structures for soft symbol and variance estimation for QAM constellations including a big-flipping framework and efficient methods for soft symbol estimation and variance estimation for QAM. Disclosed are efficient Gray mapping which provides a much lower complexity, i.e., log N for N-QAM for both squared and non-squared QAM constellations. Also disclosed is an approximation method that avoids multiplications completely while exhibiting only a slight performance degradation. Finally, a low complexity method for variance estimations, particularly second moment estimations for both squared and non-squared QAM constellations with Gray mapping are disclosed. Advantageously—using the disclosed methods—the complexity of the second moment estimation is reduced to O((log N)̂2) for an N-QAM symbol for both squared and non-squared QAM.

    Abstract translation: 公开了用于QAM星座的软符号和方差估计的方法和结构,包括大翻转框架和用于QAM的软符号估计和方差估计的有效方法。 公开的是高效的格雷映射,其提供了低得多的复杂度,即对于平方和非平方QAM星座的N-QAM的log N。 还公开了一种近似方法,其在仅显示轻微的性能降级的情况下完全避免乘法。 最后,公开了用于方差估计的低复杂度方法,特别是具有灰度映射的平方和非平方QAM星座的二次矩估计。 有利地,使用所公开的方法 - 对于平方和非平方QAM的N-QAM符号,二次矩估计的复杂度被减小到O((log N)2)。

    Generation and optimization of data sharing among multiple data sources and consumers
    405.
    发明授权
    Generation and optimization of data sharing among multiple data sources and consumers 有权
    生成和优化多个数据源和消费者之间的数据共享

    公开(公告)号:US08825506B2

    公开(公告)日:2014-09-02

    申请号:US13666438

    申请日:2012-11-01

    CPC classification number: G06Q10/06 G06Q10/0631 G06Q10/101 H04L41/5003

    Abstract: Systems and methods for data sharing include generating at least one sharing plan with a cheapest cost and/or a shortest execution time for one or more sharing arrangements. Admissibility of the one or more sharing arrangements is determined such that a critical time path of the at least one sharing plan does not exceed a staleness level and a cost of the at least one sharing plan does not exceed a capacity. Sharing plans of admissible sharing arrangements are executed while maintaining the staleness level.

    Abstract translation: 用于数据共享的系统和方法包括以最便宜的成本生成至少一个共享计划和/或用于一个或多个共享安排的最短执行时间。 确定一个或多个共享安排的可接受性,使得至少一个共享计划的关键时间路径不超过平均级别,并且至少一个共享计划的成本不超过容量。 共同安排的共享计划在保持平级的同时执行。

    Network Fragmentation Measurement in an Optical Wavelength Division Multiplexing (WDM) Network
    406.
    发明申请
    Network Fragmentation Measurement in an Optical Wavelength Division Multiplexing (WDM) Network 有权
    光波分复用(WDM)网络中的网络分段测量

    公开(公告)号:US20140226986A1

    公开(公告)日:2014-08-14

    申请号:US14177654

    申请日:2014-02-11

    CPC classification number: H04J14/021 H04J14/0224 H04J14/0257 H04L45/12

    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∈V和| V |≦̸ K,其中V是可重配置光分插复用器(ROADM) 节点,(b)选择未考虑的节点对(s,d),(c)从K个最短路由中的节点s和d之间选择未被考虑的路由k,(d)通过逐位执行寻找路由k的位图 沿着路线k对光纤的位向量进行逻辑与运算,(e)从所提供的线路速率集合L中选择未考虑的线路速率l,以及(f)找到用线路速率l提供连接的概率αls,d,k。 还公开了其他装置,系统和方法。

    Precoding Selection for Retransmission in Uplink MIMO Hybrid ARQ
    407.
    发明申请
    Precoding Selection for Retransmission in Uplink MIMO Hybrid ARQ 有权
    上行MIMO混合ARQ中重传的预编码选择

    公开(公告)号:US20140219379A1

    公开(公告)日:2014-08-07

    申请号:US14247643

    申请日:2014-04-08

    Abstract: A method implemented in a user terminal is disclosed. The method comprises obtaining known precoding matrix P of rank r and modulation and coding scheme assignments used in an original transmission, and a desired retransmission rank r′, forming an approximate channel covariance matrix, estimating a minimum mean square error receiver SINR for each layer to be retransmitted responsive to said forming, and finding a retransmission precoding matrix from a preceding codebook that maximizes a sum-rate for enabling precoding selections for retransmissions in uplink multiple-input multiple-output MIMO hybrid automatic repeat request HARQ. Other methods, apparatuses, and systems also are disclosed.

    Abstract translation: 公开了一种在用户终端中实现的方法。 该方法包括获得秩r的已知预编码矩阵P以及在原始传输中使用的调制和编码方案分配以及期望的重传秩r',形成近似信道协方差矩阵,估计每层的最小均方误差接收机SINR 响应于所述形成重新发送,并从上一个码本中找到重新发送预编码矩阵,其使在上行链路多输入多输出MIMO混合自动重传请求HARQ中进行重新发送的预编码选择最大化的和速率。 还公开了其它方法,装置和系统。

    System and methods for Predicting Query Execution Time for Concurrent and Dynamic Database Workloads
    408.
    发明申请
    System and methods for Predicting Query Execution Time for Concurrent and Dynamic Database Workloads 有权
    用于预测并发和动态数据库工作负载的查询执行时间的系统和方法

    公开(公告)号:US20140214880A1

    公开(公告)日:2014-07-31

    申请号:US14073817

    申请日:2013-11-06

    CPC classification number: G06F17/30442

    Abstract: Systems and methods for predicting query execution time for concurrent and dynamic database workloads include decomposing each query into a sequence of query pipelines based on the query plan from a query optimizer, and predicting an execution time of each pipeline with a progress predictor for a progress chart of query pipelines.

    Abstract translation: 用于预测并发和动态数据库工作负载的查询执行时间的系统和方法包括基于来自查询优化器的查询计划将每个查询分解为查询流水线序列,并使用进度图的进度预测器预测每个流水线的执行时间 的查询管道。

    Cost-Effective Data Layout Optimization Over Heterogeneous Storage Classes
    409.
    发明申请
    Cost-Effective Data Layout Optimization Over Heterogeneous Storage Classes 审中-公开
    经济有效的数据布局优化在异构存储类中

    公开(公告)号:US20140214793A1

    公开(公告)日:2014-07-31

    申请号:US14167506

    申请日:2014-01-29

    CPC classification number: G06F16/2453 G06F16/217

    Abstract: A system to optimize layout of database objects in a relational database management system stored on a plurality of storage classes each characterized by a price and a storage capacity includes a time-based query optimizer and a layout recommender coupled to the time-based query optimizer to estimate a total cost of operation (TCO) for a query workload on each data layout. The layout recommender includes an auxiliary object selection comprising database objects that include auxiliary objects that are optional to place with auxiliary object candidates being given from an auxiliary object recommender component.

    Abstract translation: 一种优化存储在多个存储类别中的关系数据库管理系统中的数据库对象的布局的系统,每个存储类别以价格和存储容量为特征,包括基于时间的查询优化器和布局推荐器,其耦合到基于时间的查询优化器 估计每个数据布局的查询工作负载的总体运营成本(TCO)。 布局推荐器包括辅助对象选择,其包括数据库对象,数据库对象包括辅助对象,所述辅助对象是辅助对象,其辅助对象候选被从辅助对象推荐器组件给出。

    RATE ADAPTIVE IRREGULAR QC-LDPC CODES FROM PAIRWISE BALANCED DESIGNS FOR ULTRA-HIGH-SPEED OPTICAL TRANSPORTS
    410.
    发明申请
    RATE ADAPTIVE IRREGULAR QC-LDPC CODES FROM PAIRWISE BALANCED DESIGNS FOR ULTRA-HIGH-SPEED OPTICAL TRANSPORTS 有权
    用于超高速光学传输的配对平衡设计的速率自适应非线性QC-LDPC编码

    公开(公告)号:US20140208185A1

    公开(公告)日:2014-07-24

    申请号:US14162951

    申请日:2014-01-24

    Abstract: Systems and methods for data transport include encoding one or more streams of input data using one or more Quasi-Cyclic Low Density Parity Check (QC-LDPC) encoders; controlling irregularity of the QC-LDPC encoded data while preserving the quasi-cyclic nature of the LDPC encoded data and eliminating the error floor phenomenon. A parity-check matrix may be partially reconfigured to adapt one or more code rates; and one or more signals are generated using a mapper, wherein the output of the mapper is modulated onto a transmission medium. One or more streams of input data are received, and the streams are decoded using one or more QC-LDPC decoders.

    Abstract translation: 用于数据传输的系统和方法包括使用一个或多个准循环低密度奇偶校验(QC-LDPC)编码器来编码一个或多个输入数据流; 控制QC-LDPC编码数据的不规则性,同时保留LDPC编码数据的准循环性质并消除错误出现现象。 可以部分地重新配置奇偶校验矩阵以适应一个或多个码率; 并且使用映射器生成一个或多个信号,其中映射器的输出被调制到传输介质上。 接收一个或多个输入数据流,并且使用一个或多个QC-LDPC解码器解码流。

Patent Agency Ranking