专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050154783A1 Intent based processing 有权
公开(公告)号：US20050154783A1
公开(公告)日：2005-07-14
申请号：US11022118
申请日：2004-12-22
申请人： Rafael Lisitsa , Dale Sather , Costin Hagiu
发明人： Rafael Lisitsa , Dale Sather , Costin Hagiu
IPC分类号： G06F3/023 , G06F3/038 , G06F15/16 , G06F15/167
CPC分类号： G06F3/038 , G06F3/023
摘要： Presented is a system and method for determining a user's intent. Specifically, constituents and a topology are derived from the user's expression of intent, which can be stated broadly or stated in specific detail. The intent is expressed verbally, written, or in an XML format. The constituents and topology are resolved into a configuration based upon contexts. The contexts, which include a resource context, a user context, and an application context, includes information about the user's preferences, location, restrictions, device and network availability, and content availability. The configuration is then implemented.

2. 发明申请

US20050108354A1 Intent based processing 有权
标题翻译：基于意图的处理
公开(公告)号：US20050108354A1
公开(公告)日：2005-05-19
申请号：US11022127
申请日：2004-12-22
申请人： Rafael Lisitsa , Dale Sather , Costin Hagiu
发明人： Rafael Lisitsa , Dale Sather , Costin Hagiu
IPC分类号： G06F3/023 , G06F3/038 , G06F15/16 , G06F15/167
CPC分类号： G06F3/038 , G06F3/023
摘要： Presented is a system and method for determining a user's intent. Specifically, constituents and a topology are derived from the user's expression of intent, which can be stated broadly or stated in specific detail. The intent is expressed verbally, written, or in an XML format. The constituents and topology are resolved into a configuration based upon contexts. The contexts, which include a resource context, a user context, and an application context, includes information about the user's preferences, location, restrictions, device and network availability, and content availability. The configuration is then implemented.
摘要翻译：提出了一种用于确定用户意图的系统和方法。具体来说，构成要素和拓扑是从用户的意图表达中得出的，可以广泛地陈述或具体说明。意图用口头，书面或XML格式表达。组成部分和拓扑结构基于上下文解析成一个配置。包括资源上下文，用户上下文和应用程序上下文的上下文包括有关用户偏好，位置，限制，设备和网络可用性以及内容可用性的信息。然后执行配置。

3. 发明申请

US20050267988A1 Flow of streaming data through multiple processing modules 有权
标题翻译：流数据流通过多个处理模块
公开(公告)号：US20050267988A1
公开(公告)日：2005-12-01
申请号：US11195092
申请日：2005-08-02
申请人： Rafael Lisitsa , George Shaw , Dale Sather , Bryan Woodruff
发明人： Rafael Lisitsa , George Shaw , Dale Sather , Bryan Woodruff
IPC分类号： G06F9/44 , G06F9/46 , G06F15/16
CPC分类号： G06F9/54 , G06F8/45 , G06F9/546
摘要： Frame-based streaming data flows through a graph of multiple interconnected processing modules. The modules have a set of performance parameters whose values specify the sensitivity of each module to the selection of certain resources of a system. A user specifies overall goals for an actual graph for processing a given type of data for a particular purpose. A flow manager constructs the graph as a sequence of module interconnections required for processing the data, in response to the parameter values of the individual modules in the graph in view of the goals for the overall graph as a whole, and divides it into pipes each having one or more modules and each assigned to a memory manager for handling data frames in the pipe.
摘要翻译：基于帧的流数据流经过多个互连处理模块的图形。这些模块具有一组性能参数，其值指定每个模块对系统某些资源的选择的灵敏度。用户为特定目的指定用于处理给定类型的数据的实际图形的总体目标。考虑到整个图形的目标，流程管理器响应于图中各个模块的参数值，将图形构建为处理数据所需的模块互连序列，并将其划分为管道具有一个或多个模块，并且每个模块被分配给用于处理管道中的数据帧的存储器管理器。

4. 发明申请

US20050286552A1 Efficient splitting and mixing of streaming-data frames for processing through multiple processing modules 有权
标题翻译：流式数据帧的高效分割和混合，用于通过多个处理模块进行处理
公开(公告)号：US20050286552A1
公开(公告)日：2005-12-29
申请号：US11204683
申请日：2005-08-16
申请人： Rafael Lisitsa , George Shaw , Dale Sather , Bryan Woodruff
发明人： Rafael Lisitsa , George Shaw , Dale Sather , Bryan Woodruff
IPC分类号： H04J3/16
CPC分类号： G06F15/8053
摘要： Streaming data is processed through one or more pipes of connected modules including mixers and/or splitters. The data is carried in composite physically allocated frames having virtual subframes associated with different ones of the splitters, mixers, and other transform modules. Nesting trees and pipe control tables represent the structure of the pipes. A frame allocator is assigned to a particular module in a pipe. Rather than issuing a control transaction to all modules when any one of them completes an operation upon its source data, a control manager requests a module to begin its operation only when all of its input subframes have become available. Frame control tables record when any module has completed an operation, and a pipe control table lists which modules provide data to which other modules.
摘要翻译：流数据通过一个或多个连接的模块管道进行处理，包括混合器和/或分离器。该数据在具有与分离器，混合器和其他变换模块中的不同分配器相关联的虚拟子帧的复合物理分配帧中承载。嵌套树木和管道控制表表示管道的结构。帧分配器被分配给管道中的特定模块。控制管理器当其任何一个完成其源数据上的操作时，不会向所有模块发出控制事务，而是只有当所有模块的所有输入子帧都可用时才要求模块开始操作。任何模块完成操作时，帧控制表记录，管道控制表列出哪些模块向其他模块提供数据。

5. 发明申请

US20050022193A1 Flow of streaming data through multiple processing modules 有权
公开(公告)号：US20050022193A1
公开(公告)日：2005-01-27
申请号：US10862282
申请日：2004-06-07
申请人： Rafael Lisitsa , George Shaw , Dale Sather , Bryan Woodruff
发明人： Rafael Lisitsa , George Shaw , Dale Sather , Bryan Woodruff
IPC分类号： G06F9/44 , G06F9/46 , G06F15/16 , G06F9/00
CPC分类号： G06F9/54 , G06F8/45 , G06F9/546
摘要： Frame-based streaming data flows through a graph of multiple interconnected processing modules. The modules have a set of performance parameters whose values specify the sensitivity of each module to the selection of certain resources of a system. A user specifies overall goals for an actual graph for processing a given type of data for a particular purpose. A flow manager constructs the graph as a sequence of module interconnections required for processing the data, in response to the parameter values of the individual modules in the graph in view of the goals for the overall graph as a whole, and divides it into pipes each having one or more modules and each assigned to a memory manager for handling data frames in the pipe.

6. 发明申请

US20140302463A1 MNEMONIC-BASED LANGUAGE-LEARNING SYSTEM AND METHOD 审中-公开
标题翻译：基于MNEMONIC的语言学习系统和方法
公开(公告)号：US20140302463A1
公开(公告)日：2014-10-09
申请号：US14187142
申请日：2014-02-21
申请人： Rafael Lisitsa , Mark Sestak , Gennady Feller
发明人： Rafael Lisitsa , Mark Sestak , Gennady Feller
IPC分类号： G09B19/06 , G09B5/00
CPC分类号： G09B19/06 , G09B5/00 , G09B5/065 , H04L51/04 , H04L51/32
摘要： The current document discloses computer-based methods and systems that employ mnemonics for teaching foreign languages to students of foreign languages. The currently disclosed computer-based and mnemonics-based language learning system is, in the described implementation, a distributed computational system that provides a collaborative computational environment in which students of foreign languages create, edit, discuss, and use mnemonics-based dictionaries and language-learning resources.
摘要翻译：目前的文件公开了以计算机为基础的方法和系统，它们使用助记符来外语学习外语。目前所公开的基于计算机和助记符的语言学习系统在所描述的实现中是一种分布式计算系统，其提供协作计算环境，其中外语学生创建，编辑，讨论和使用基于助记符的词典和语言 - 学习资源。

7. 发明授权

US06385341B1 Technique for decoding variable length data codes 失效
标题翻译：解码可变长度数据码的技术
公开(公告)号：US06385341B1
公开(公告)日：2002-05-07
申请号：US08843933
申请日：1997-04-17
申请人： Rafael Lisitsa , Gregory Stepanets
发明人： Rafael Lisitsa , Gregory Stepanets
IPC分类号： G06K946
CPC分类号： G06T9/005
摘要： A system for the efficient decoding of data encoded with variable length codes uses an N-bit buffer as an index to a data look-up table or other suitable data structure. The encoded data is stored in an encoded data storage area and extracted N bits at a time. The N bits are used as an index or indicator to a location within the data look-up table. The contents of the data look-up table in the indicated location correspond to one or more decoded tokens and also provide an indication of the number of data bits from the N-bit buffer that were used to represent the decoded tokens. A pointer is incremented by the number and indicates a location within the encoded data storage area where the next N bits will be extracted and stored in the buffer. If the N-bit buffer is greater than or equal to the maximal length for the variable codes, at least one valid token is guaranteed as a result of a single data look-up operation. However, a data look-up operation typically results in a plurality of decoded tokens. In one embodiment, the decoding system is used for facsimile operation and may include additional data in the data look-up table to permit rapid decoding of two dimensional facsimile codes.
摘要翻译：用于以可变长度代码编码的数据的有效解码的系统使用N位缓冲器作为数据查找表或其他合适的数据结构的索引。编码数据存储在编码数据存储区域中，并一次提取N位。 N位用作数据查找表中的位置的索引或指示符。指示位置中的数据查找表的内容对应于一个或多个解码令牌，并且还提供来自用于表示解码令牌的N位缓冲器的数据位数的指示。指针增加数字，并指示编码数据存储区域内的下一个N位将被提取并存储在缓冲器中的位置。如果N位缓冲器大于或等于可变代码的最大长度，则由于单个数据查找操作，至少有一个有效令牌得到保证。然而，数据查找操作通常导致多个解码令牌。在一个实施例中，解码系统用于传真操作，并且可以在数据查找表中包括附加数据，以允许二维传真码的快速解码。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式