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

1. 发明授权

US08534176B2 Method and apparatus for braiding micro strands 有权
标题翻译：用于编织微链的方法和装置
公开(公告)号：US08534176B2
公开(公告)日：2013-09-17
申请号：US13129925
申请日：2009-11-19
申请人： Simon Giszter , Tae Gyo Kim , Arun Ramakrishnan
发明人： Simon Giszter , Tae Gyo Kim , Arun Ramakrishnan
IPC分类号： D04C3/14
CPC分类号： D04C3/42
摘要： A method and apparatus for fabricating microbraided structures is provided. A microbraiding device includes first and second carrier members that are movable with respect to each other. Each carrier includes a plurality of shelters. Spool-less strands of microfiber are retained in shuttles that are movable between the first and second shelters under magnetic forces. The microbraid structure is fabricated as the shuttles move between the first shelters, and as the first carrier member moves relative to the second carrier member.
摘要翻译：提供了一种用于制造微阵列结构的方法和装置。微型装置包括可相对于彼此移动的第一和第二承载构件。每个载体包括多个收容所。无纺布的超细纤维束被保留在可在磁力下在第一和第二收容所之间移动的梭子中。随着梭子在第一遮蔽物之间移动，并且当第一承载构件相对于第二承载构件移动时，制作微框架结构。

2. 发明申请

US20110277618A1 METHOD AND APPARATUS FOR BRAIDING MICRO STRANDS 有权
标题翻译：消除微观结构的方法和装置
公开(公告)号：US20110277618A1
公开(公告)日：2011-11-17
申请号：US13129925
申请日：2009-11-19
申请人： Simon Giszter , Tae Gyo Kim , Arun Ramakrishnan
发明人： Simon Giszter , Tae Gyo Kim , Arun Ramakrishnan
IPC分类号： D04C1/00 , D04C3/00
CPC分类号： D04C3/42
摘要： A method and apparatus for fabricating microbraided structures is provided. A microbraiding device includes first and second carrier members that are movable with respect to each other. Each carrier includes a plurality of shelters. Spool-less strands of microfiber are retained in shuttles that are movable between the first and second shelters under magnetic forces. The microbraid structure is fabricated as the shuttles move between the first shelters, and as the first carrier member moves relative to the second carrier member.
摘要翻译：提供了一种用于制造微阵列结构的方法和装置。微型装置包括可相对于彼此移动的第一和第二承载构件。每个载体包括多个收容所。无纺布的超细纤维束被保留在可在磁力下在第一和第二收容所之间移动的梭子中。随着梭子在第一遮蔽物之间移动，并且当第一承载构件相对于第二承载构件移动时，制作微框架结构。

3. 发明申请

US20140006456A1 ATTRIBUTE-BASED LINKED TRIES FOR RULE EVALUATION 有权
标题翻译：基于属性的链接关联规则评估
公开(公告)号：US20140006456A1
公开(公告)日：2014-01-02
申请号：US13568885
申请日：2012-08-07
申请人： Arun Ramakrishnan , Rohit Shetty
发明人： Arun Ramakrishnan , Rohit Shetty
IPC分类号： G06F17/30
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.
摘要翻译：用于评估与事件相关的规则的实施例包括提供包括多个节点的规则特征，其中必须满足匹配条件以触发给定的规则，并且每个匹配条件对应于不同的节点。为字符串属性提供属性特里，其包括具有值的节点序列。字符串属性从事件中提取，并且还具有一个值。通过遍历沿着节点序列延伸的路径来比较提取的字符串属性的值和节点序列的值。响应于确定提取的字符串属性和节点序列的值是相同的，通知规则特里节点的特定节点的匹配条件已被接收到的事件的属性所满足。

4. 发明授权

US08356047B2 Intelligent event-based data mining of unstructured information 失效
标题翻译：非结构化信息的智能事件数据挖掘
公开(公告)号：US08356047B2
公开(公告)日：2013-01-15
申请号：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分类号： G06F7/00 , 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.
摘要翻译：公开了用于智能数据挖掘的方法，系统和计算机程序产品。该方法包括从应用程序接收事件，将属性权重分配给事件的属性，以及基于属性权重从这些属性构建查询。该方法还包括将搜索引擎权重分配给一组搜索引擎，基于搜索引擎权重来选择搜索引擎中的至少一些，以及将构建的查询发送到所选择的搜索引擎。所选搜索引擎的结果存储在知识库中，用于调整属性权重和搜索引擎权重。本发明可以用于提供关于问题的信息的分析，以及管理可用于问题确定的解决方案数据库。本发明提供了用于从在线来源收集相关信息的低成本解决方案。

5. 发明授权

US08296125B2 Translating source locale input string to target locale output string 失效
标题翻译：将源语言环境输入字符串转换为目标语言环境输出字符串
公开(公告)号：US08296125B2
公开(公告)日：2012-10-23
申请号：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.
摘要翻译：构建了将源语言环境字符串映射到目标语言环境字符串的字典。一棵树是从字典中构建的。树具有包括起始节点，结束节点和字符串节点的节点。节点形成与源语言环境字符串对应的树的节点链。每个节点链将节点的集合从起始节点链接到字符串节点。除起始节点之外的每个节点都有父节点，并且对应于源语言环境字符串的字符。除节点之外的每个节点都有一个或多个子节点。每个字符串节点结束节点链，并且对应于源语言环境字符串到目标语言环境字符串的字典内的映射。针对树处理具有源语言环境的输入字符串，以生成具有目标语言环境的输出字符串。

6. 发明申请

US20050071799A1 Routing for reducing impedance distortions 失效
标题翻译：降低阻抗失真的路由
公开(公告)号：US20050071799A1
公开(公告)日：2005-03-31
申请号：US10672538
申请日：2003-09-26
申请人： Arun Ramakrishnan
发明人： Arun Ramakrishnan
IPC分类号： G06F17/50 , H01L23/498 , H05K1/02 , H05K1/11 , H05K3/46
CPC分类号： H01L23/49838 , G06F17/5077 , H01L23/49822 , H01L23/49827 , H01L2224/16 , H01L2924/15311 , H01L2924/3011 , H05K1/0237 , H05K1/115 , H05K3/4602 , H05K2201/09236 , H05K2201/093 , H05K2201/09536 , H05K2201/09718 , H05K2201/09972
摘要： A substrate having a core with vias disposed therein. A reference layer is formed on the core, with voids in the reference layer that are formed around the vias in the core. Traces on a routing layer overlie the reference layer. Also included is a contact layer with contacts disposed in a contact pattern. The core is logically divided into sections, and the vias within a given one of the sections are aligned in rows substantially along a first direction. At least a portion of the vias are not aligned with the contact pattern. The voids in the reference layer within the given one of the sections are also aligned in rows substantially along the first direction and aligned with the vias. Further, the traces within the given one of each of the sections are also aligned substantially along the first direction between the rows of voids, and not substantially overlying the rows of voids.
摘要翻译：具有设置有通孔的芯的基板。在芯上形成参考层，在核心中的通孔周围形成参考层中的空隙。路由层上的跟踪覆盖参考层。还包括具有以接触图案布置的触点的接触层。芯在逻辑上被划分为几个部分，并且给定的一个部分中的通孔基本上沿着第一方向排列成行。通孔的至少一部分不与接触图案对齐。给定的一个部分内的参考层中的空隙也基本上沿着第一方向排成行并与通路对准。此外，每个部分中给定的一个部分中的迹线也基本上沿空隙的排之间的第一方向排列，并且基本上不覆盖空隙行。

7. 发明申请

US20140006455A1 ATTRIBUTE-BASED LINKED TRIES FOR RULE EVALUATION 有权
公开(公告)号：US20140006455A1
公开(公告)日：2014-01-02
申请号：US13539748
申请日：2012-07-02
申请人： Arun Ramakrishnan , Rohit Shetty
发明人： Arun Ramakrishnan , Rohit Shetty
IPC分类号： G06F17/30
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.

8. 发明申请

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

9. 发明申请

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

10. 发明申请

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

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式