利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

42 条记录 (耗时 0.031 秒)

    Dictionary for textual data compression and decompression
    31.
    发明授权
    Dictionary for textual data compression and decompression 有权
    文本数据压缩和解压缩字典

    公开(公告)号：US08326604B2

    公开(公告)日：2012-12-04

    申请号：US12108914

    申请日：2008-04-24

    申请人： Umesh Kumar B. Balegar ,  Rohit Shetty

    发明人： Umesh Kumar B. Balegar ,  Rohit Shetty

    IPC分类号： G06F17/21

    CPC分类号： H03M7/3088 ,  G06F17/2735

    摘要： A dictionary for compressing and decompressing textual data has a number of keys. Each key is associated with an identifier. The keys include static word or phrase keys, where each static word or phrase key lists one or more unchanging words in a particular order. The keys further include dynamic phrase keys, where each dynamic phrase key lists a number of words and one or more placeholders in a particular order, and each placeholder denotes a place where a word or phrase other than the words of the dynamic phrase key is to be inserted. At least one of the dynamic phrase keys may identify one or more of the words by identifiers for corresponding static words or phrase keys. At least one of the static word or phrase keys may identify one or more of the words by identifiers for corresponding other static words or phrase keys.

    摘要翻译： 用于压缩和解压缩文本数据的字典具有多个键。 每个密钥都与一个标识符相关联。 密钥包括静态字或短语键，其中每个静态词或短语键以特定顺序列出一个或多个不变的单词。 密钥还包括动态短语键，其中每个动态短语键以特定顺序列出多个单词和一个或多个占位符，并且每个占位符表示除动态短语键的单词之外的单词或短语为 被插入。 动态短语键中的至少一个可以通过用于对应的静态词或短语键的标识符识别一个或多个词。 静态词或短语键中的至少一个可以通过相应的其他静态词或短语键的标识符识别一个或多个词。

    Allowing External Access to Private Information of a Local Data Store
    32.
    发明申请
    Allowing External Access to Private Information of a Local Data Store 审中-公开
    允许外部访问本地数据存储的私人信息

    公开(公告)号：US20120209885A1

    公开(公告)日：2012-08-16

    申请号：US13459166

    申请日：2012-04-28

    申请人： Arun Ramakrishnan ,  Rohit Shetty

    发明人： Arun Ramakrishnan ,  Rohit Shetty

    IPC分类号： G06F17/30 ,  G06F21/00

    CPC分类号： G06F21/6263 ,  G06F21/604 ,  G06F2221/2101 ,  G06F2221/2141 ,  G06F2221/2149 ,  H04L63/104

    摘要： Techniques provided for allowing external access by other users to private information that is maintained on local storage of a computer and owned by an information owner. The private information is uploaded from the local storage to an externally accessible information source that is accessible by the other users. A request from a user to access the private information is received by the owner, who determines whether to allow access the private information. If so, the owner sends a private information sharing authorization to a collaboration orchestrator, which retrieves the private information from the external source and provides the private information to the user. The owner optionally requests to collaborate with the user before deciding whether to allow access to the private information. One or both of the identities of the owner and user can remain anonymous until agreeing on revealing identities. A system and program product is also provided.

    摘要翻译： 提供的技术允许其他用户外部访问由计算机的本地存储维护并由信息所有者拥有的私人信息。 私人信息从本地存储器上传到可由其他用户访问的外部可访问的信息源。 来自用户访问私人信息的请求由所有者接收，所有者确定是否允许访问私人信息。 如果是这样，所有者向合作协调者发送私人信息共享授权，协作管理器从外部源检索私人信息，并向用户提供私人信息。 所有者可以在决定是否允许访问私人信息之前可选地请求与用户协作。 所有者和用户的一个或两个身份可以保持匿名，直到同意揭示身份。 还提供了系统和程序产品。

    INTELLIGENT EVENT-BASED DATA MINING OF UNSTRUCTURED INFORMATION
    33.
    发明申请
    INTELLIGENT EVENT-BASED DATA MINING OF UNSTRUCTURED INFORMATION 失效
    基于智能事件的数据挖掘未提供信息

    公开(公告)号：US20110082883A1

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

    申请号：US12571782

    申请日：2009-10-01

    申请人： Hariharan L. Narayanan ,  Arun Ramakrishnan ,  Krishna C. Shastry ,  Rohit Shetty

    发明人： Hariharan L. Narayanan ,  Arun Ramakrishnan ,  Krishna C. Shastry ,  Rohit Shetty

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864

    摘要： A method, system and computer program product is disclosed for intelligent data mining. The method comprises receiving an event from an application, assigning property weights to properties of the event, and building a query from these properties based on the property weights. The method further comprises assigning search engine weights to a group of search engines, selecting at least some of the search engines based on the search engine weights, and sending the built query to the selected search engines. Results from the selected search engines are stored in a knowledge repository and used to adjust the property weights and the search engine weights. The invention may be used to provide an analysis with information about a problem, and to manage a solutions database which can be used for problem determination. The invention provides a low cost solution for collecting relevant information from online sources.

    摘要翻译： 公开了用于智能数据挖掘的方法，系统和计算机程序产品。 该方法包括从应用程序接收事件，将属性权重分配给事件的属性，以及基于属性权重从这些属性构建查询。 该方法还包括将搜索引擎权重分配给一组搜索引擎，基于搜索引擎权重来选择搜索引擎中的至少一些，以及将构建的查询发送到所选择的搜索引擎。 所选搜索引擎的结果存储在知识库中，用于调整属性权重和搜索引擎权重。 本发明可以用于提供关于问题的信息的分析，以及管理可用于问题确定的解决方案数据库。 本发明提供了用于从在线来源收集相关信息的低成本解决方案。

    Translating Source Locale Input String To Target Locale Output String
    34.
    发明申请
    Translating Source Locale Input String To Target Locale Output String 失效
    将源语言环境输入字符串转换为目标区域输出字符串

    公开(公告)号：US20100100369A1

    公开(公告)日：2010-04-22

    申请号：US12253300

    申请日：2008-10-17

    申请人： Rohit Shetty ,  Arun Ramakrishnan ,  Saurabh Dravid ,  Krishna Shastry

    发明人： Rohit Shetty ,  Arun Ramakrishnan ,  Saurabh Dravid ,  Krishna Shastry

    IPC分类号： G06F17/28

    CPC分类号： G06F17/2735 ,  G06F9/454 ,  G06F17/28

    摘要： A dictionary mapping source locale strings to target locale strings is constructed. A tree is constructed from the dictionary. The tree has nodes including a start node, end nodes, and string nodes. The nodes form node chains of the tree that correspond to the source locale strings. Each node chain links a collection of the nodes from the start node to a string node. Each node other than the start node has a parent node and corresponds to a character of the source locale strings. Each node other than the end nodes has one or more child nodes. Each string node ends a node chain, and corresponds to a mapping within the dictionary of a source locale string to a target locale string. An input string having the source locale is processed against the tree to generate an output string having the target locale.

    摘要翻译： 构建了将源语言环境字符串映射到目标语言环境字符串的字典。 一棵树是从字典中构建的。 树具有包括起始节点，结束节点和字符串节点的节点。 节点形成与源语言环境字符串对应的树的节点链。 每个节点链将节点的集合从起始节点链接到字符串节点。 除起始节点之外的每个节点都有父节点，并且对应于源语言环境字符串的字符。 除节点之外的每个节点都有一个或多个子节点。 每个字符串节点结束节点链，并且对应于源语言环境字符串到目标语言环境字符串的字典内的映射。 针对树处理具有源语言环境的输入字符串，以生成具有目标语言环境的输出字符串。

    DICTIONARY FOR TEXTUAL DATA COMPRESSION AND DECOMPRESSION
    35.
    发明申请
    DICTIONARY FOR TEXTUAL DATA COMPRESSION AND DECOMPRESSION 有权
    文本数据压缩和解密的词典

    公开(公告)号：US20090271180A1

    公开(公告)日：2009-10-29

    申请号：US12108914

    申请日：2008-04-24

    申请人： Umesh Kumar Balegar ,  Rohit Shetty

    发明人： Umesh Kumar Balegar ,  Rohit Shetty

    IPC分类号： G06F17/21 ,  H03M7/00

    CPC分类号： H03M7/3088 ,  G06F17/2735

    摘要： A dictionary for compressing and decompressing textual data has a number of keys. Each key is associated with an identifier. The keys include static word or phrase keys, where each static word or phrase key lists one or more unchanging words in a particular order. The keys further include dynamic phrase keys, where each dynamic phrase key lists a number of words and one or more placeholders in a particular order, and each placeholder denotes a place where a word or phrase other than the words of the dynamic phrase key is to be inserted. At least one of the dynamic phrase keys may identify one or more of the words by identifiers for corresponding static words or phrase keys. At least one of the static word or phrase keys may identify one or more of the words by identifiers for corresponding other static words or phrase keys.

    摘要翻译： 用于压缩和解压缩文本数据的字典具有多个键。 每个密钥都与一个标识符相关联。 密钥包括静态字或短语键，其中每个静态词或短语键以特定顺序列出一个或多个不变的单词。 密钥还包括动态短语键，其中每个动态短语键以特定顺序列出多个单词和一个或多个占位符，并且每个占位符表示除动态短语键的单词之外的单词或短语为 被插入。 动态短语键中的至少一个可以通过用于对应的静态词或短语键的标识符识别一个或多个词。 静态词或短语键中的至少一个可以通过相应的其他静态词或短语键的标识符识别一个或多个词。

    Generating a statistical tree for encoding/decoding an XML document
    36.
    发明授权
    Generating a statistical tree for encoding/decoding an XML document 有权
    生成用于对XML文档进行编码/解码的统计树

    公开(公告)号：US09336188B2

    公开(公告)日：2016-05-10

    申请号：US13010900

    申请日：2011-01-21

    申请人： Rohit Shetty ,  Umesh Kumar Balaraj

    发明人： Rohit Shetty ,  Umesh Kumar Balaraj

    IPC分类号： G06F17/00 ,  G06F17/22

    CPC分类号： G06F17/2229 ,  G06F17/2247

    摘要： A method and apparatus for generating a statistical tree representing an extensible markup language Schema (XSD) is disclosed. Components of the XSD are prioritized according to predefined rules. A root node representing said XSD is created. Pairs of child nodes are generated from the root node. Each pair comprises at least one genuine node, and each pair of generated child nodes is appended to a parent node which is a genuine node. The path to each of said child nodes from a respective parent genuine node is represented with a binary sequence. At least one genuine node is allocated to a corresponding component of said XSD, the allocation being based on the prioritization of the component. Methods, apparatus and computer program products for generating a statistical tree representing an extensible markup language Schema (XSD), for encoding an extensible markup language (XML) document utilizing a statistical tree representing an extensible markup language Schema (XSD), and for decoding an XML document represented by a binary encoded sequence also are disclosed.

    摘要翻译： 公开了一种用于生成表示可扩展标记语言模式（XSD）的统计树的方法和装置。 XSD的组件根据预定义的规则进行优先排序。 创建表示所述XSD的根节点。 从根节点生成成对的子节点。 每对包括至少一个正版节点，并且每对生成的子节点被附加到作为真实节点的父节点。 来自相应父母节点的每个所述子节点的路径用二进制序列表示。 至少一个正版节点被分配给所述XSD的相应组件，该分配基于组件的优先级。 用于生成表示可扩展标记语言模式（XSD）的统计树的方法，装置和计算机程序产品，用于使用表示可扩展标记语言模式（XSD）的统计树对可扩展标记语言（XML）文档进行编码， 还公开了由二进制编码序列表示的XML文档。

    Attribute-based linked tries for rule evaluation
    38.
    发明授权
    Attribute-based linked tries for rule evaluation 有权
    基于属性的链接尝试进行规则评估

    公开(公告)号：US08732207B2

    公开(公告)日：2014-05-20

    申请号：US13539748

    申请日：2012-07-02

    申请人： Arun Ramakrishnan ,  Rohit Shetty

    发明人： Arun Ramakrishnan ,  Rohit Shetty

    IPC分类号： G06F7/00 ,  G06F17/00 ,  G06Q30/00

    CPC分类号： G06F17/30985 ,  G06F2209/543

    摘要： An embodiment for evaluating rules pertaining to an event includes providing a rule trie comprising multiple nodes, wherein match conditions must be met to trigger a given rule, and each match condition corresponds to a different node. An attribute trie is provided for a string attribute, which includes a node sequence having a value. The string attribute is extracted from the event and also has a value. The value of the extracted string attribute and the value of the node sequence are compared, by traversing a path extending along the node sequence. Responsive to determining that the values of the extracted string attribute and the node sequence are the same, notice is provided that the match condition of a particular node of the rule trie has been met by an attribute of the received event.

    摘要翻译： 用于评估与事件相关的规则的实施例包括提供包括多个节点的规则特征，其中必须满足匹配条件以触发给定的规则，并且每个匹配条件对应于不同的节点。 为字符串属性提供属性特里，其包括具有值的节点序列。 字符串属性从事件中提取，并且还具有一个值。 通过遍历沿着节点序列延伸的路径来比较提取的字符串属性的值和节点序列的值。 响应于确定提取的字符串属性和节点序列的值是相同的，通知规则特里节点的特定节点的匹配条件已被接收到的事件的属性所满足。

    Optimizing an Operating System I/O Operation that Pertains to a Specific Program and File
    39.
    发明申请
    Optimizing an Operating System I/O Operation that Pertains to a Specific Program and File 有权
    优化与特定程序和文件相关的操作系统I / O操作

    公开(公告)号：US20140006656A1

    公开(公告)日：2014-01-02

    申请号：US13534958

    申请日：2012-06-27

    申请人： Logeswaran T. Rajamanickam ,  Arun Ramakrishnan ,  Ashrith Shetty ,  Rohit Shetty

    发明人： Logeswaran T. Rajamanickam ,  Arun Ramakrishnan ,  Ashrith Shetty ,  Rohit Shetty

    IPC分类号： G06F3/00

    CPC分类号： G06F3/061 ,  G06F3/0643 ,  G06F3/0689 ,  G06F17/30067 ,  G06F17/30144

    摘要： An embodiment of the invention pertains to a method that includes an operating system, program components running on the operating system, and a file system associated with one or more files. Responsive to a write request sent from a specified program component to the operating system, in order to write specified data content to a given file, the method determines whether the write request meets a criterion, which is derived from the identity of at least one of the specified program component, and the given file. If the criterion is met, a message is immediately sent to release the specified program component from a wait state. Data portions of the specified data content are then selectively written to a storage buffer, and subsequently written from the buffer to the given file.

    摘要翻译： 本发明的实施例涉及一种包括操作系统，在操作系统上运行的程序组件以及与一个或多个文件相关联的文件系统的方法。 响应于从指定的程序组件发送到操作系统的写入请求，为了将指定的数据内容写入给定的文件，该方法确定写入请求是否满足从至少一个 指定的程序组件和给定的文件。 如果满足标准，则立即发送消息以将等待状态释放指定的程序组件。 然后将指定数据内容的数据部分选择性地写入存储缓冲器，然后从缓冲器写入给定文件。