公开(公告)号：US08326604B2

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

申请号：US12108914

申请日：2008-04-24

Applicant: Umesh Kumar B. Balegar ,  Rohit Shetty

Inventor： Umesh Kumar B. Balegar ,  Rohit Shetty

IPC: G06F17/21

CPC classification number: H03M7/3088 ,  G06F17/2735

Abstract: 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.

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

公开(公告)号：US20120209885A1

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

申请号：US13459166

申请日：2012-04-28

Applicant: Arun Ramakrishnan ,  Rohit Shetty

Inventor： Arun Ramakrishnan ,  Rohit Shetty

IPC: G06F17/30 ,  G06F21/00

CPC classification number: G06F21/6263 ,  G06F21/604 ,  G06F2221/2101 ,  G06F2221/2141 ,  G06F2221/2149 ,  H04L63/104

Abstract: 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.

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

公开(公告)号：US20110082883A1

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

申请号：US12571782

申请日：2009-10-01

Applicant: Hariharan L. Narayanan ,  Arun Ramakrishnan ,  Krishna C. Shastry ,  Rohit Shetty

Inventor： Hariharan L. Narayanan ,  Arun Ramakrishnan ,  Krishna C. Shastry ,  Rohit Shetty

IPC: G06F17/30

CPC classification number: G06F17/30864

Abstract: 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.

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

公开(公告)号：US20100100369A1

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

申请号：US12253300

申请日：2008-10-17

Applicant: Rohit Shetty ,  Arun Ramakrishnan ,  Saurabh Dravid ,  Krishna Shastry

Inventor： Rohit Shetty ,  Arun Ramakrishnan ,  Saurabh Dravid ,  Krishna Shastry

IPC: G06F17/28

CPC classification number: G06F17/2735 ,  G06F9/454 ,  G06F17/28

Abstract: 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.

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

公开(公告)号：US20090271180A1

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

申请号：US12108914

申请日：2008-04-24

Applicant: Umesh Kumar Balegar ,  Rohit Shetty

Inventor： Umesh Kumar Balegar ,  Rohit Shetty

IPC: G06F17/21 ,  H03M7/00

CPC classification number: H03M7/3088 ,  G06F17/2735

Abstract: 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.

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

公开(公告)号：US08843677B2

公开(公告)日：2014-09-23

申请号：US13589749

申请日：2012-08-20

Applicant: Logeswaran T. Rajamanickam ,  Arun Ramakrishnan ,  Ashrith Shetty ,  Rohit Shetty

Inventor： Logeswaran T. Rajamanickam ,  Arun Ramakrishnan ,  Ashrith Shetty ,  Rohit Shetty

IPC: G06F3/00 ,  G06F3/06 ,  G06F17/30

CPC classification number: G06F3/061 ,  G06F3/0643 ,  G06F3/0689 ,  G06F17/30067 ,  G06F17/30144

Abstract: 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.

公开(公告)号：US08839054B2

公开(公告)日：2014-09-16

申请号：US13445187

申请日：2012-04-12

Applicant: George M. Braceras ,  Albert M. Chu ,  Kevin W. Gorman ,  Michael R. Ouellette ,  Ronald A. Piro ,  Daryl M. Seitzer ,  Rohit Shetty ,  Thomas W. Wyckoff

Inventor： George M. Braceras ,  Albert M. Chu ,  Kevin W. Gorman ,  Michael R. Ouellette ,  Ronald A. Piro ,  Daryl M. Seitzer ,  Rohit Shetty ,  Thomas W. Wyckoff

IPC: G11C29/00

CPC classification number: G11C29/12 ,  G06F11/0793 ,  G11C17/00 ,  G11C29/4401 ,  G11C29/822

Abstract: A read only memory (ROM) with redundancy and methods of use are provided. The ROM with redundancy includes a programmable array coupled to a repair circuit having one or more redundant repairs. The one or more redundant repairs include a word address match logic block, a data I/O address, and a tri-state buffer. The word address match logic block is provided to the tri-state buffer as a control input and the data I/O address is provided to the tri-state buffer as an input. An output of the tri-state buffer of each redundant repair is provided as a first input to one or more logic devices. One or more data outputs of a ROM bit cell array is provided as a second input to a respective one of the one or more logic devices.

Abstract translation: 提供了具有冗余性和使用方法的只读存储器（ROM）。 具有冗余的ROM包括耦合到具有一个或多个冗余修复的修复电路的可编程阵列。 一个或多个冗余修复包括字地址匹配逻辑块，数据I / O地址和三态缓冲器。 字地址匹配逻辑块作为控制输入提供给三态缓冲器，并且将数据I / O地址作为输入提供给三态缓冲器。 提供每个冗余修复的三态缓冲器的输出作为一个或多个逻辑器件的第一输入。 提供ROM位单元阵列的一个或多个数据输出作为一个或多个逻辑器件中的相应一个的第二输入。

公开(公告)号：US08732207B2

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

申请号：US13539748

申请日：2012-07-02

Applicant: Arun Ramakrishnan ,  Rohit Shetty

Inventor： Arun Ramakrishnan ,  Rohit Shetty

IPC: G06F7/00 ,  G06F17/00 ,  G06Q30/00

CPC classification number: G06F17/30985 ,  G06F2209/543

Abstract: 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.

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

公开(公告)号：US20140006656A1

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

申请号：US13534958

申请日：2012-06-27

Applicant: Logeswaran T. Rajamanickam ,  Arun Ramakrishnan ,  Ashrith Shetty ,  Rohit Shetty

Inventor： Logeswaran T. Rajamanickam ,  Arun Ramakrishnan ,  Ashrith Shetty ,  Rohit Shetty

IPC: G06F3/00

CPC classification number: G06F3/061 ,  G06F3/0643 ,  G06F3/0689 ,  G06F17/30067 ,  G06F17/30144

Abstract: 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.

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

公开(公告)号：US20130211749A1

公开(公告)日：2013-08-15

申请号：US13396775

申请日：2012-02-15

Applicant: Albert M. Chu ,  Ronald A. Piro ,  Daryl M. Seitzer ,  Rohit Shetty ,  Thomas W. Wyckoff

Inventor： Albert M. Chu ,  Ronald A. Piro ,  Daryl M. Seitzer ,  Rohit Shetty ,  Thomas W. Wyckoff

IPC: G01R31/308 ,  G06F19/00

CPC classification number: G01R31/311

Abstract: A semiconductor device structure is embedded within a semiconductor chip that calibrates a photon-emission luminosity scale by running multiple known currents through the device. The method comprises embedding at least one photon emission device in an integrated circuit having at least one functional device. A control current is applied to the at least one photon emission device. The photon emission intensity produced by the at least one photon emission device is captured. The current density of the at least one photon emission device is calculated. A test current is applied to the at least one functional device. The photon emission intensity produced by the at least one functional device is captured. The current density of the at least one functional device is estimated based on a comparison with the calculated current density of the at least one photon emission device.

Abstract translation: 半导体器件结构嵌入半导体芯片内，通过运行多个已知电流通过器件来校准光子发射光度标度。 该方法包括将至少一个光子发射装置嵌入到具有至少一个功能装置的集成电路中。 控制电流被施加到至少一个光子发射装置。 捕获由至少一个光子发射装置产生的光子发射强度。 计算出至少一个光子发射装置的电流密度。 测试电流被施加到所述至少一个功能装置。 捕获由至少一个功能装置产生的光子发射强度。 基于与计算出的至少一个光子发射装置的电流密度的比较来估计至少一个功能装置的电流密度。