利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

5 条记录 (耗时 0.017 秒)

    Content Placement
    2.
    发明申请
    Content Placement 有权
    内容放置

    公开(公告)号：US20120137336A1

    公开(公告)日：2012-05-31

    申请号：US12955672

    申请日：2010-11-29

    申请人： David L. Applegate ,  Aaron F. Archer ,  Vijay Gopalakrishnan ,  Seungjoon Lee ,  Kadangode Ramakrishnan

    发明人： David L. Applegate ,  Aaron F. Archer ,  Vijay Gopalakrishnan ,  Seungjoon Lee ,  Kadangode Ramakrishnan

    IPC分类号： H04N7/173

    CPC分类号： H04N21/252 ,  H04N21/2225 ,  H04N21/47202

    摘要： A method includes receiving data identifying new media content items to be added to a media distribution system that provides media content on demand to a plurality of endpoints. The media distribution system includes a plurality of distribution nodes, and each of the distribution nodes is coupled to a subset of the endpoints. Historical demand is determined during a particular time period for existing media content items that include content available via at least one of the distribution nodes before the data was received. The method includes forecasting demand for media content items, including new media content items and existing media content items, based on the historical demand. Each media content item is assigned to, and stored at, at least one corresponding distribution node based at least partially on a cost function and the forecasted demand.

    摘要翻译： 一种方法包括接收标识要添加到向多个端点提供媒体内容的媒体分发系统的新媒体内容项目的数据。 媒体分发系统包括多个分发节点，并且每个分发节点耦合到端点的子集。 历史需求是在特定时间段内确定的，该现有媒体内容项包括在接收数据之前通过至少一个分发节点可用的内容。 该方法包括根据历史需求预测媒体内容项目的需求，包括新媒体内容项目和现有媒体内容项目。 至少部分地基于成本函数和所预测的需求将每个媒体内容项目分配给至少一个对应分配节点并存储在其中。

    Content placement
    3.
    发明授权
    Content placement 有权
    内容放置

    公开(公告)号：US08856846B2

    公开(公告)日：2014-10-07

    申请号：US12955672

    申请日：2010-11-29

    申请人： David L. Applegate ,  Aaron F. Archer ,  Vijay Gopalakrishnan ,  Seungjoon Lee ,  Kadangode Ramakrishnan

    发明人： David L. Applegate ,  Aaron F. Archer ,  Vijay Gopalakrishnan ,  Seungjoon Lee ,  Kadangode Ramakrishnan

    IPC分类号： H04N7/173 ,  H04N21/472 ,  H04N21/25 ,  H04N21/2225

    CPC分类号： H04N21/252 ,  H04N21/2225 ,  H04N21/47202

    摘要： A method includes receiving data identifying new media content items to be added to a media distribution system that provides media content on demand to a plurality of endpoints. The media distribution system includes a plurality of distribution nodes, and each of the distribution nodes is coupled to a subset of the endpoints. Historical demand is determined during a particular time period for existing media content items that include content available via at least one of the distribution nodes before the data was received. The method includes forecasting demand for media content items, including new media content items and existing media content items, based on the historical demand. Each media content item is assigned to, and stored at, at least one corresponding distribution node based at least partially on a cost function and the forecasted demand.

    摘要翻译： 一种方法包括接收标识要添加到向多个端点提供媒体内容的媒体分发系统的新媒体内容项目的数据。 媒体分发系统包括多个分发节点，并且每个分发节点耦合到端点的子集。 历史需求是在特定时间段内确定的，该现有媒体内容项包括在接收数据之前通过至少一个分发节点可用的内容。 该方法包括根据历史需求预测媒体内容项目的需求，包括新媒体内容项目和现有媒体内容项目。 至少部分地基于成本函数和所预测的需求将每个媒体内容项目分配给至少一个对应分配节点并存储在其中。

    Compressing rectilinear pictures and minimizing access control lists
    5.
    发明授权
    Compressing rectilinear pictures and minimizing access control lists 有权
    压缩直线图像并最小化访问控制列表

    公开(公告)号：US07958075B1

    公开(公告)日：2011-06-07

    申请号：US11824073

    申请日：2007-06-28

    申请人： David L. Applegate ,  Gruia Calinescu ,  David S. Johnson ,  Howard Karloff ,  Katrina Ligett ,  Jia Wang

    发明人： David L. Applegate ,  Gruia Calinescu ,  David S. Johnson ,  Howard Karloff ,  Katrina Ligett ,  Jia Wang

    IPC分类号： G06F17/00 ,  G06N5/02

    CPC分类号： H04L49/3009 ,  G06N5/025 ,  G06T9/00

    摘要： A geometric model is considered for the problem of minimizing access control lists (ACLs) in network routers. A colored rectilinear pattern is created within an initially white rectangular canvas, and the basic operation is to choose a subrectangle and paint it a single color, overwriting all previous colors in the rectangle. The method operates on rectangular rule lists (RRLs) and access control lists (ACLs) in which all rectangles are strips that extend either the full length or the full height of the canvas. A polynomial-time algorithm optimally constructs such patterns when, as in the ACL application, the only colors are black and white (permit or deny). That algorithm is complemented by a significantly faster approximation algorithm that is guaranteed to be no worse than 3/2 optimal.

    摘要翻译： 考虑到网络路由器访问控制列表（ACL）最小化问题的几何模型。 在最初的白色矩形画布中创建一个彩色的直线图案，基本操作是选择一个子矩形，并绘制一个单一的颜色，覆盖矩形中的所有以前的颜色。 该方法适用于矩形规则列表（RRL）和访问控制列表（ACL），其中所有矩形都是延伸画布全长或全高的条带。 当在ACL应用程序中，唯一的颜色是黑色和白色（允许或拒绝）时，多项式时间算法最佳地构建这样的模式。 该算法由明显更快的逼近算法补充，保证不比3/2最优。