-
41.发明授权Method and apparatus for automatically or electronically addressing data within a file or files 有权用于自动或电子地寻址文件中的数据的方法和装置公开(公告)号：US07283721B2
公开(公告)日：2007-10-16
申请号：US10167819
申请日：2002-06-12
申请人： Ralf Ostermann , Jobst Hörentrup , Uwe Janssen
发明人： Ralf Ostermann , Jobst Hörentrup , Uwe Janssen
CPC分类号： G06F17/30887 , G11B27/005 , G11B27/3027 , G11B27/322 , G11B2220/2541
摘要： Available storage media capacity will be doubling every 2 years. In 2005 it will likely be possible to store about 80 movies on a single 400 GByte hard disk. Because it is no longer possible to access specific recordings stored in a book shelf by just looking at the video cassettes or discs and some annotations on their cover, personal video or audio recording will require new ways to organise and electronically search for content, including automatic content referencing and automatic content location. According to the invention the URI string is extended by additional information that allows to locate specific information within a file that is referenced by such URI. Similar types of URI extensions are used for describing trick mode information. Such extensions take into account specific requirements of the storage format involved.
摘要翻译： 可用的存储媒体容量将每2年翻一番。 在2005年，可能可以在单个400 GB硬盘上存储约80部电影。 由于只能通过观看录像带或光盘以及封面上的某些注释来访问存储在书架上的特定录像，因此无法再通过个人视频或音频录制来组织和电子搜索内容，包括自动 内容引用和自动内容位置。 根据本发明，URI字符串通过允许定位由该URI引用的文件内的特定信息的附加信息来扩展。 相似类型的URI扩展用于描述特技模式信息。 这种扩展考虑了所涉及的存储格式的特定要求。
-
公开(公告)号：US07653284B2
公开(公告)日：2010-01-26
申请号：US10879842
申请日：2004-06-29
申请人： Dirk Adolph , Uwe Janssen , Hui Li , Harald Schiller , Marco Winter
发明人： Dirk Adolph , Uwe Janssen , Hui Li , Harald Schiller , Marco Winter
CPC分类号： H04N21/2353 , G11B27/034 , G11B2220/2541 , G11B2220/2562
摘要： The invention relates to a method of editing a data stream, the data stream having a first unique identifier of an identifier space and having assigned metadata, the metadata comprising meta information and a metadata link, the metadata link comprising the first unique identifier and at least one data packet identifier. When performing an editing operation on the data stream, a second unique identifier of the identifier space is assigned to the data stream and the first unique identifier for a resolver task is stored, using a decision metric for updating the meta link.
摘要翻译： 本发明涉及一种编辑数据流的方法，所述数据流具有标识符空间的第一唯一标识符并具有分配的元数据，所述元数据包括元信息和元数据链接，所述元数据链接包括第一唯一标识符，并且至少 一个数据包标识符。 当对数据流执行编辑操作时，将标识符空间的第二唯一标识符分配给数据流，并且使用用于更新元链接的决策度量来存储解析器任务的第一唯一标识符。
-
公开(公告)号：US07543107B2
公开(公告)日：2009-06-02
申请号：US10584744
申请日：2004-11-22
IPC分类号： G06F12/00
CPC分类号： G11B27/105
摘要： The use of disk-assisted, dynamic databases is to be optimized. To this end, provision is made for new data intended to update an old stock of data to have a second index, relating to the new data, generated for them, and for said second index to be stored on the disk storage medium as a supplement to the first index relating to the old stock of data. This allows the number of write access operations to the disk storage medium to be reduced. This is particularly advantageous for optical media, whose useful life can be increased as a result.
摘要翻译： 要优化使用磁盘辅助的动态数据库。 为此，提供用于更新旧数据库的新数据以具有与为其生成的新数据相关的第二索引，并且将所述第二索引作为补充存储在盘存储介质上 到与旧的数据库有关的第一个指数。 这允许减少对磁盘存储介质的写访问操作的数量。 这对于光学介质是特别有利的，其结果可以增加其使用寿命。
-
公开(公告)号：US20090018997A1
公开(公告)日：2009-01-15
申请号：US10584654
申请日：2004-11-15
申请人： Marco Winter , Uwe Janssen , Wolfgang Klausberger , Hui Li , Dietmar Hepper
发明人： Marco Winter , Uwe Janssen , Wolfgang Klausberger , Hui Li , Dietmar Hepper
IPC分类号： G06F17/30
CPC分类号： G06F17/30938
摘要： Search in stocks of data, particularly on optical media, is intended to be optimized in terms of the time required for the search. It is therefore proposed that the search be carried out in two steps. In a first search step, the entire database is scanned on the disk storage medium. In a second search step, executed in parallel, intermediate results from the first search step are searched. This allows the number of skips on a disk to be reduced, which results in increases of speed, particularly in the case of optical drives.
摘要翻译： 搜索数据库，特别是在光学介质上的数据，旨在根据搜索所需的时间进行优化。 因此，建议搜索分两步进行。 在第一个搜索步骤中，在磁盘存储介质上扫描整个数据库。 在并行执行的第二搜索步骤中，搜索来自第一搜索步骤的中间结果。 这允许减少磁盘上的跳过次数，这导致速度的增加，特别是在光驱的情况下。
-
公开(公告)号：US20070192535A1
公开(公告)日：2007-08-16
申请号：US10584744
申请日：2004-11-22
IPC分类号： G06F13/28
CPC分类号： G11B27/105
摘要： The use of disk-assisted, dynamic databases is to be optimized. To this end, provision is made for new data intended to update an old stock of data to have a second index, relating to the new data, generated for them, and for said second index to be stored on the disk storage medium as a supplement to the first index relating to the old stock of data. This allows the number of write access operations to the disk storage medium to be reduced. This is particularly advantageous for optical media, whose useful life can be increased as a result.
摘要翻译： 要优化使用磁盘辅助的动态数据库。 为此，提供用于更新旧数据库的新数据以具有与为其生成的新数据相关的第二索引，并且将所述第二索引作为补充存储在盘存储介质上 到与旧的数据库有关的第一个指数。 这允许减少对磁盘存储介质的写访问操作的数量。 这对于光学介质是特别有利的，其结果可以增加其使用寿命。
-
公开(公告)号：US07543022B2
公开(公告)日：2009-06-02
申请号：US11217913
申请日：2005-09-01
IPC分类号： G06F15/16
CPC分类号： H04L29/06 , H04L29/12292 , H04L41/0893 , H04L61/2069 , H04L67/10 , H04L67/104 , H04L67/1046 , H04L67/1068
摘要： For the creation and self-organization of peer-groups the JXTA protocol may be used, which includes messages such as peer or peer-group advertisements and services such as the discovery service. Conventional peer-groups of this type are static and need restart after any modification, e.g. a new service. A method for dynamically managing hardware and/or software elements, e.g. services, utilized and/or offered by such peer-groups comprises detecting a change within a peer-group, creating a new peer-group identifier, publishing within the peer-group a first peer-group advertisement message that includes the current and the new peer-group identifier and pointers to current services including the detected modification, accepting the new peer-group identifier by the other peer-group members, and publishing a second peer-group advertisement message in the superordinate peer-group, wherein both advertisement messages may be identical. Thus, peer-groups may operate continuously while peers modify, add or delete services.
摘要翻译： 对于对等组的创建和自组织，可以使用JXTA协议，其包括诸如对等体或对等组广告的消息以及诸如发现服务的服务。 这种类型的常规对等组是静态的，并且需要在任何修改之后重新启动，例如。 一项新服务。 一种用于动态管理硬件和/或软件元件的方法，例如 由这些对等组群使用和/或提供的服务包括检测对等组中的变化，创建新的对等组标识符，在对等组内发布包括当前和新的第一对等组广告消息 对等组标识符和指向当前业务的指针，包括检测到的修改，由其他对等体组成员接受新的对等体组标识符，以及在上级对等体组中发布第二对等体组通告消息，其中两个广告消息可以 相同 因此，对等体组可以连续操作，而对等体修改，添加或删除服务。
-
公开(公告)号：US07996389B2
公开(公告)日：2011-08-09
申请号：US10584654
申请日：2004-11-15
申请人： Marco Winter , Uwe Janssen , Wolfgang Klausberger , Hui Li , Dietmar Hepper
发明人： Marco Winter , Uwe Janssen , Wolfgang Klausberger , Hui Li , Dietmar Hepper
IPC分类号： G06F17/30
CPC分类号： G06F17/30938
摘要： Search in stocks of data, particularly on optical media, is intended to be optimized in terms of the time required for the search. It is therefore proposed that the search be carried out in two steps. In a first search step, the entire database is scanned on the disk storage medium. In a second search step, executed in parallel, intermediate results from the first search step are searched. This allows the number of skips on a disk to be reduced, which results in increases of speed, particularly in the case of optical drives.
摘要翻译： 搜索数据库，特别是在光学介质上的数据，旨在根据搜索所需的时间进行优化。 因此，建议搜索分两步进行。 在第一个搜索步骤中，在磁盘存储介质上扫描整个数据库。 在并行执行的第二搜索步骤中，搜索来自第一搜索步骤的中间结果。 这允许减少磁盘上的跳过次数，这导致速度的增加，特别是在光驱的情况下。
-
公开(公告)号：US20060045092A1
公开(公告)日：2006-03-02
申请号：US11217913
申请日：2005-09-01
IPC分类号： H04L12/56
CPC分类号： H04L29/06 , H04L29/12292 , H04L41/0893 , H04L61/2069 , H04L67/10 , H04L67/104 , H04L67/1046 , H04L67/1068
摘要： For the creation and self-organization of peer-groups the JXTA protocol may be used, which includes messages such as peer or peer-group advertisements and services such as the discovery service. Conventional peer-groups of this type are static and need restart after any modification, e.g. a new service. A method for dynamically managing hardware and/or software elements, e.g. services, utilized and/or offered by such peer-groups comprises detecting a change within a peer-group, creating a new peer-group identifier, publishing within the peer-group a first peer-group advertisement message that includes the current and the new peer-group identifier and pointers to current services including the detected modification, accepting the new peer-group identifier by the other peer-group members, and publishing a second peer-group advertisement message in the superordinate peer-group, wherein both advertisement messages may be identical. Thus, peer-groups may operate continuously while peers modify, add or delete services.
-
公开(公告)号：US20130143223A1
公开(公告)日：2013-06-06
申请号：US13696215
申请日：2011-05-04
申请人： Maria Hernandez-Fuentes , Irene Rebollo-Mesa , Uwe Janssen , Stefan Tomiuk , Birgit Sawitzki , Hans-Dieter Volk , Robert Lechler
发明人： Maria Hernandez-Fuentes , Irene Rebollo-Mesa , Uwe Janssen , Stefan Tomiuk , Birgit Sawitzki , Hans-Dieter Volk , Robert Lechler
IPC分类号： C12Q1/68
CPC分类号： C12Q1/6876 , C12Q1/6837 , C12Q1/6883 , C12Q2600/158
摘要： The present invention relates to a method of determining an individual's transplantation tolerance by determining the level of a number of biomarkers. The present invention also relates to a kit comprising reagents for detecting the levels of the biomarkers. The present invention also relates to a sensor for detecting the expression levels of a plurality of genes that can be used to determine an individual's transplantation tolerance.
摘要翻译： 本发明涉及通过确定多个生物标志物的水平来确定个体的移植耐受性的方法。 本发明还涉及包含用于检测生物标志物水平的试剂的试剂盒。 本发明还涉及用于检测可用于确定个体移植耐受性的多种基因的表达水平的传感器。
-
公开(公告)号：US07472344B2
公开(公告)日：2008-12-30
申请号：US10761828
申请日：2004-01-20
申请人： Hui Li , Meinolf Blawat , Uwe Janssen , Stefan Kubsch , Dietmar Hepper
发明人： Hui Li , Meinolf Blawat , Uwe Janssen , Stefan Kubsch , Dietmar Hepper
IPC分类号： G06F17/00
CPC分类号： H04N1/32101
摘要： The generation of metadata shall be simplified. Therefore, a method is presented in which a metadata-template is filled with selected essence and MD-links obtained from a list of links to essence and/or a list of current metadata. Furthermore, it is possible to obtain the MD-links from further metadata or essences directly or indirectly linked with the selected essence.
摘要翻译： 要简化元数据的生成。 因此，提出了一种方法，其中元数据模板填充有从本质和/或当前元数据列表的链接列表中获得的所选择的本质和MD链接。 此外，可以从与所选择的本质直接或间接相关联的进一步的元数据或实质获得MD链接。
-
-
-
-
-
-
-
-
-
搜索结果
52 条记录 (耗时 0.03 秒)
