会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • EASY COPYING BETWEEN ELECTRONIC PAPER AND DISPLAY
    • 电子纸和显示器之间轻松复制
    • WO2006040725A1
    • 2006-04-20
    • PCT/IB2005/053317
    • 2005-10-10
    • KONINKLIJKE PHILIPS ELECTRONICS N.V.KORST, Johannes, H., M.
    • KORST, Johannes, H., M.
    • H04N1/00
    • H04N1/0074H04N1/00347H04N1/00761H04N1/00816H04N1/00827H04N2201/0055H04N2201/0089
    • A method and devices for copying an image (2) from an electronic display (1) to an electronic paper (3), wherein said electronic paper (3) is held against an area (6) of the electronic display (1) for performing a copy action and that said electronic display (1) comprises identification means for determining the borders of the area (6), a copy set button included in said devices for initiating the copy action, circuits for establishing a wireless connection between the display (1) and the paper (3) and a processor (5) for reading image information from the area (6) of the electronic display (1) for sending the image information to the electronic paper (3) for the display of the image (2) comprised in said area (6) of the electronic display (1) on the electronic paper (1).
    • 一种用于将图像(2)从电子显示器(1)复制到电子纸(3)的方法和装置,其中所述电子纸(3)被保持在电子显示器(1)的区域(6)上,用于执行 所述电子显示器(1)包括用于确定所述区域(6)的边界的识别装置,包括在所述用于启动复制动作的装置中的复印机按钮,用于在所述显示器(1)之间建立无线连接的电路 )和纸(3)和用于从电子显示器(1)的区域(6)读取图像信息的处理器(5),用于将图像信息发送到用于显示图像的电子纸(3)(2) )包括在电子纸(1)上的电子显示器(1)的所述区域(6)中。
    • 7. 发明申请
    • METHOD AND APPARATUS FOR HANDLING A GROUP OF AT LEAST ONE DATA OBJECT
    • 用于处理至少一个数据对象的组的方法和装置
    • WO2005055238A1
    • 2005-06-16
    • PCT/IB2004/052614
    • 2004-12-01
    • KONINKLIJKE PHILIPS ELECTRONICS N.V.JOCHEMSEN, RobertKORST, Johannes, H., M.LI, Hong, R.
    • JOCHEMSEN, RobertKORST, Johannes, H., M.LI, Hong, R.
    • G11B27/00
    • H04N21/2393
    • The invention relates to real-time handling of data in more in particular, estimation of time needed to retrieve frames for video rendering, taking fragmentation of frames into account. Especially for data retrieval for trick-play, this is non-trivial, as it is not known on beforehand whether the frames to be retrieved are fragmented. Retrieval of non­ contiguously fragmented frames takes at least twice as much time as retrieval of a non-­fragmented frame. The invention provides various advantageous embodiments, taking into account that when allocation units are substantially larger than the size of frames to be retrieved. An embodiment of the invention provides a method for accurate retrieval time estimation when trick play speed, allocation unit size, frame size and logical data distance between frames to retrieve is known.
    • 本发明尤其涉及对数据的实时处理,尤其涉及检索用于视频呈现的帧所需的时间的估计,考虑到帧的碎片化。 特别是对于特技播放的数据检索,这是不平凡的,因为事先不知道要检索的帧是否被分段。 非连续分片帧的检索至少是检索非碎片帧的两倍。 本发明提供了各种有利的实施例,考虑到当分配单元实质上大于要检索的帧的大小时。 本发明的一个实施例提供了一种当特技播放速度,分配单元大小,帧大小以及要检索的帧之间的逻辑数据距离是已知的时,精确检索时间估计的方法。
    • 9. 发明申请
    • METHOD AND ARRANGEMENT FOR SEARCHING FOR STRINGS
    • 搜索字符串的方法和安排
    • WO2004079631A3
    • 2004-10-28
    • PCT/IB2004050148
    • 2004-02-25
    • KONINKL PHILIPS ELECTRONICS NVPAUWS STEFFEN CEGNER SEBASTIANKORST JOHANNES H MVAN VUUREN MARCEL
    • EGNER SEBASTIANKORST JOHANNES H MVAN VUUREN MARCEL
    • G06F17/30
    • G06F17/30985
    • This invention relates to methods of searching for a final number of result strings (30-33) having a partial or an exact match with a query string (34) in a database (80) comprised of many long strings or a long string, said method includes the steps of partitioning the query string in a first number of input query strings (35, 36, 37); determining a second number of neighboring strings (38-41, 42-45, 44-49, respectively) for each string in said first number of input query strings, wherein each string in said second number of neighboring strings has a predetermined first number of errors; searching the database for a third number of exact matches (50-61, 70-74) for each string in said second number of neighboring strings based on a search method; concatenating said searched exact matched strings from the database into a fourth number of intermediate strings (29, 30, 32, 33, 34) wherein said searched exact matched strings (50-61, 70-74) comprised in each of said intermediate strings are in succession to one another in said database; and determining the final number of result strings (30-33) based in said fourth number of intermediate strings, wherein each string in the final number of result strings has a maximum of predetermined second number of errors compared to said query string (34). This enables for a perfect match or a partial match containing only minor errors with respect to said query string, and for a fast search in larger databases with a relative low use of processing power.
    • 本发明涉及搜索具有与由许多长串或长串组成的数据库(80)中的查询串(34)的部分或完全匹配的最终数目的结果串(30-33)的方法,所述 方法包括步骤:在第一数目的输入查询字符串(35,36,37)中划分查询字符串; 确定所述第一数量的输入查询串中的每个串的相邻串的第二数量(分别为38-41,42-45,44-49),其中所述第二数量的相邻串中的每个串具有预定的第一数量的 错误; 基于搜索方法在所述数据库中搜索所述第二数量的相邻串中的每个串的第三数量的精确匹配(50-61,70-74); 将来自数据库的搜索到的精确匹配的字符串连接成第四数量的中间字符串(29,30,32,33,34),其中包括在每个所述中间字符串中的所述搜索到的精确匹配字符串(50-61,70-74)是 在所述数据库中彼此相继; 以及基于所述第四数量的中间串确定最终数量的结果串(30-33),其中与所述查询串(34)相比,最终数量的结果串中的每个串具有最大数量的预定的第二数量的错误。 这使得对于所述查询字符串仅包含较小错误的完美匹配或部分匹配以及对处理能力使用相对较少的较大数据库中的快速搜索成为可能。