知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

5 条记录 (耗时 0.012 秒)

    Apparatus And Method for Supporting Content Exchange Between Different DRM Domains
    3.
    发明申请
    Apparatus And Method for Supporting Content Exchange Between Different DRM Domains 审中-公开
    支持不同DRM域之间的内容交换的装置和方法

    公开(公告)号：US20100257370A1

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

    申请号：US11665985

    申请日：2005-10-20

    申请人： Ki Song Yoon ,  Yeon Jeong Jeong ,  Seong Oun Hwang ,  Do Won Nam ,  Jeong Hyun Kim ,  Ji Hyun Park ,  Sang Won Jeong ,  Jun II Kim ,  Seong Min Ahn ,  Seong Han Kim ,  Wan Ho Jang

    发明人： Ki Song Yoon ,  Yeon Jeong Jeong ,  Seong Oun Hwang ,  Do Won Nam ,  Jeong Hyun Kim ,  Ji Hyun Park ,  Sang Won Jeong ,  Jun II Kim ,  Seong Min Ahn ,  Seong Han Kim ,  Wan Ho Jang

    IPC分类号： G06F21/24 ,  G06F12/14

    CPC分类号： G06F21/10 ,  G06F2221/0759

    摘要： Provided is a system for exchanging contents between a first DRM apparatus and a second DRM apparatus, wherein each of which belongs to different DRM domain. The first DRM apparatus includes unpackaging means for unpackaging first DRM formatted contents into clear resources, metadata, and rights expression; converting means for converting each of the clear resources, metadata, and rights expression into its own predefined neutral format, respectively; generating means for generating neutral formatted contents by combining the converted resources, metadata, and rights expression; adding predetermined header information thereto; and transmitting means for transmitting the neutral-formatted contents to said second DRM apparatus. The second DRM apparatus includes extracting means for extracting clear resources, metadata, and rights expression from the neutral-formatted contents transmitted from said first DRM apparatus; and packaging means for packaging the extracted clear resources, metadata, and rights expression into second DRM formatted contents.

    摘要翻译： 提供了一种用于在第一DRM设备和第二DRM设备之间交换内容的系统，其中每个DRM设备属于不同的DRM域。 第一DRM设备包括用于将第一DRM格式的内容解封装成清楚的资源，元数据和权限表达的解包装置; 转换装置，用于将每个清晰资源，元数据和权利表达分别转换成其自己的预定中性格式; 生成装置，用于通过组合转换的资源，元数据和权限表达来产生中性格式的内容; 向其中添加预定的报头信息; 以及发送装置，用于将中性格式的内容发送到所述第二DRM装置。 第二DRM装置包括从从所述第一DRM装置发送的中立格式的内容中提取清除资源，元数据和权利表达的提取装置; 以及用于将提取的清晰资源，元数据和权限表达包装到第二DRM格式化内容中的包装装置。

    Node disjoint path forming method for hypercube having damaged node
    5.
    发明授权
    Node disjoint path forming method for hypercube having damaged node 失效
    具有损坏节点的超立方体的节点不相交路径形成方法

    公开(公告)号：US6038688A

    公开(公告)日：2000-03-14

    申请号：US7815

    申请日：1998-01-15

    申请人： Ki Song Yoon

    发明人： Ki Song Yoon

    IPC分类号： G06F11/00 ,  G06F15/16

    CPC分类号： G06F11/2051 ,  G06F11/2041

    摘要： A node disjoint path forming method for a hypercube having a damaged node which is capable of using unused nodes (surplus nodes) in an n-number of node disjoint paths each having a length of n with respect to n-dimensional hypercubes more than 4-cube, so that it is possible to obtain an n-number of node disjoint paths each having a length of n even though there are damaged nodes. The method includes the steps of a first step for forming a linear arrangement consisting of an n-number of integers (0, 1, 2, . . . n-1) with respect to an n-dimension and searching a linear arrangement which is not neighbored in a linear arrangement in which integers which indicate a value of 1 in an address of a damaged node are circulated, assuming that a node address with respect to an n-address is expressed as a position of 1 among an n-number of binary digits, separating each value by a comma by defining an address value of a decimal digit indicating a position of 1 using a bracket, defining the rightmost position as 0 and the leftmost position as n-1, and a second step for forming a linear arrangement using integers of an arrangement in which values indicating a position of 1 in an address of a damaged node are not neighbored on a circumferential portion, moving the linear arrangement by one digit in the right direction and forming an nxn first matrix.

    摘要翻译： 一种用于具有损坏节点的超立方体的节点不相交路径形成方法，所述节点具有能够使用相对于n维超立方体超过4-个长度为n的n个节点不相交路径中的未使用节点（剩余节点） 立方体，使得即使存在损坏的节点，也可以获得n个具有n个长度为n的节点不相交路径。 该方法包括以下步骤：第一步骤，用于形成由相对于n维的n个整数（0,1,2，...，n-1）组成的线性排列，并且搜索线性排列 假定相对于n地址的节点地址被表示为n个数量的n位置中的位置1，则不以相邻于其中指示损坏节点的地址中的值1的整数循环的线性排列相邻 二进制数字，通过使用括号将最右边的位置定义为0并将最左边的位置定义为n-1，通过定义表示位置1的十位数的地址值，将每个值分隔开一个逗号，以及形成线性的第二步骤 使用其中在损坏节点的地址中指示1的位置的值在周围部分不相邻的布置的整体的布置的布置，将线性排列沿右方向移动一位，并形成n×n个第一矩阵。