会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • DEFINING A DATA STRUCTURE FOR PATTERN MATCHING
    • 定义模式匹配的数据结构
    • US20120158780A1
    • 2012-06-21
    • US13408706
    • 2012-02-29
    • Teruo KoyanagiYuta Tsuboi
    • Teruo KoyanagiYuta Tsuboi
    • G06F17/30
    • G06F17/30
    • An information processing method for defining a data structure for pattern matching, the method executed by an information processing apparatus, comprises generating, by the apparatus, an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint patterns each including plural constraints; searching, by the apparatus, for a second substructure similar to a first substructure from a root node by determining a set relation between transition conditions of respective transition edges; and defining, by the apparatus, an additional transition link from a tail node of the second substructure to a child node at a tail end of the first substructure, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation.
    • 一种用于定义用于模式匹配的数据结构的信息处理方法,所述方法由信息处理装置执行,包括通过在所述装置之间定义过渡边缘来生成有序树结构,所述过渡边使用作为转移条件的转移条件, 每个约束模式包括多个约束; 通过确定相应过渡边缘的转换条件之间的集合关系,通过该装置从根节点搜索类似于第一子结构的第二子结构; 以及由所述装置定义从所述第二子结构的尾节点到所述第一子结构的尾端处的子节点的附加转变链路,所述附加转变链路添加由所述集合关系识别的不确定性要满足的约束 。
    • 3. 发明授权
    • Defining a data structure for pattern matching
    • 定义模式匹配的数据结构
    • US08495101B2
    • 2013-07-23
    • US13408706
    • 2012-02-29
    • Teruo KoyanagiYuta Tsuboi
    • Teruo KoyanagiYuta Tsuboi
    • G06F17/30
    • G06F17/30
    • An information processing method for defining a data structure for pattern matching, the method executed by an information processing apparatus, comprises generating, by the apparatus, an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint patterns each including plural constraints; searching, by the apparatus, for a second substructure similar to a first substructure from a root node by determining a set relation between transition conditions of respective transition edges; and defining, by the apparatus, an additional transition link from a tail node of the second substructure to a child node at a tail end of the first substructure, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation.
    • 一种用于定义用于模式匹配的数据结构的信息处理方法,所述方法由信息处理装置执行,包括通过在所述装置之间定义过渡边缘来生成有序树结构,所述过渡边使用作为转移条件的转移条件, 每个约束模式包括多个约束; 通过确定相应过渡边缘的转换条件之间的集合关系,通过该装置从根节点搜索类似于第一子结构的第二子结构; 以及由所述装置定义从所述第二子结构的尾节点到所述第一子结构的尾端处的子节点的附加转变链路,所述附加转变链路添加由所述集合关系识别的不确定性要满足的约束 。
    • 4. 发明授权
    • Defining a data structure for pattern matching
    • 定义模式匹配的数据结构
    • US08407261B2
    • 2013-03-26
    • US12494559
    • 2009-06-30
    • Teruo KoyanagiYuta Tsuboi
    • Teruo KoyanagiYuta Tsuboi
    • G06F17/30
    • G06F17/30
    • An information processing apparatus according to the present invention comprises a generation section configured to generate an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint pattern each including plural constraints, a search section configured to search for a second substructure K similar to a first substructure P from a root node by determining a set relation between transition conditions of respective transition edges, and a transition defining section configured to define an additional transition link from a tail node sKn of the second substructure K to a child node sPn+1 of the first substructure P, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation, wherein a data structure for pattern matching is defined.
    • 根据本发明的信息处理设备包括生成部分,其被配置为通过使用从包括多个约束的一个或多个约束模式的转移条件来定义各个约束来定义节点之间的过渡边缘来生成有序树结构;搜索部分被配置为 通过确定各个过渡边缘的转换条件之间的集合关系以及被配置为从第二子结构的尾节点sKn定义附加转变链路的转移定义部分,从根节点搜索类似于第一子结构P的第二子结构K K到第一子结构P的子节点sPn + 1,附加转移链路添加由从集合关系识别的不确定性要满足的约束,其中定义用于模式匹配的数据结构。
    • 5. 发明授权
    • Systems, methods and computer products for a monitoring context generator
    • 用于监控上下文生成器的系统,方法和计算机产品
    • US08140547B2
    • 2012-03-20
    • US11866194
    • 2007-10-02
    • Mari FukudaJun-Jang JengTeruo KoyanagiYohsuke Ozawu
    • Mari FukudaJun-Jang JengTeruo KoyanagiYohsuke Ozawu
    • G06F17/30
    • G06Q10/06
    • Systems, methods and computer products for generating calculation context classes from a relationship between structured data and a calculation procedure, the context classes having parent-child relationships. Exemplary embodiments include a method including searching the calculation procedure for a first data definition, generating a first context from a first scope applied to the first data definition, tracing back the calculation procedure to obtain a second data definition for calculating the first data definition and to which the first scope is applied, copying the calculation procedure into the first context until the second data definition is obtained, obtaining a second scope applied to the second data definition, obtaining a second context generated from the second scope, determining an existence of an order comparison of the first scope with the second scope and obtaining order from the structured data.
    • 用于从结构化数据和计算过程之间的关系生成计算上下文类的系统,方法和计算机产品,上下文类具有父子关系。 示例性实施例包括一种方法,包括搜索第一数据定义的计算过程,从应用于第一数据定义的第一范围生成第一上下文,追溯计算过程以获得用于计算第一数据定义的第二数据定义,以及 应用第一范围,将计算过程复制到第一上下文中,直到获得第二数据定义,获得应用于第二数据定义的第二范围,获得从第二范围生成的第二上下文,确定订单的存在 将第一范围与第二范围进行比较,并从结构化数据中获取订单。
    • 7. 发明授权
    • Processing messages of agents
    • 处理代理的消息
    • US07865903B2
    • 2011-01-04
    • US12143976
    • 2008-06-23
    • Gaku YamamotoTeruo KoyanagiYoshiaki Kobayashi
    • Gaku YamamotoTeruo KoyanagiYoshiaki Kobayashi
    • G06F13/00
    • H04M3/5235
    • This invention provides methods, systems and apparatus for processing a message of a large number of agents. An example of an apparatus includes: a memory; means for managing a state of an agent based on whether the agent is in the memory and whether there is a message, by determining a priority level of the agent based on a message inserted into the agent; means for assigning a thread to the agent if the agent is in the memory and for assigning a thread to the agent after calling the agent to the memory if the agent is not in the memory, on condition that the agent having a highest priority level has been detected; and message processing means for repeating message processing until a predetermined criterion is satisfied, in relation to the agent to which a thread has been assigned.
    • 本发明提供了用于处理大量代理的消息的方法,系统和装置。 设备的示例包括:存储器; 用于基于所述代理是否在所述存储器中以及是否存在消息来管理代理的状态的装置,通过基于插入到所述代理中的消息确定所述代理的优先级; 用于如果所述代理在所述存储器中并且在所述代理不在所述存储器中的所述代理程序调用所述代理程序之后向所述代理分配线程的方法,条件是具有最高优先级的代理具有 被检测到 以及消息处理装置,用于相对于已经分配了线程的代理,重复消息处理直到满足预定标准。
    • 8. 发明申请
    • DEFINING A DATA STRUCTURE FOR PATTERN MATCHING
    • 定义模式匹配的数据结构
    • US20100017397A1
    • 2010-01-21
    • US12494559
    • 2009-06-30
    • Teruo KoyanagiYuta Tsuboi
    • Teruo KoyanagiYuta Tsuboi
    • G06F17/30
    • G06F17/30
    • An information processing apparatus according to the present invention comprises a generation section configured to generate an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint pattern each including plural constraints, a search section configured to search for a second substructure K similar to a first substructure P from a root node by determining a set relation between transition conditions of respective transition edges, and a transition defining section configured to define an additional transition link from a tail node sKn of the second substructure K to a child node sPn+1 of the first substructure P, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation, wherein a data structure for pattern matching is defined.
    • 根据本发明的信息处理设备包括生成部分,其被配置为通过使用从包括多个约束的一个或多个约束模式的转移条件来定义各个约束来定义节点之间的过渡边缘来生成有序树结构;搜索部分被配置为 通过确定各个过渡边缘的转换条件之间的集合关系以及被配置为从第二子结构的尾节点sKn定义附加转变链路的转移定义部分,从根节点搜索类似于第一子结构P的第二子结构K K到第一子结构P的子节点sPn + 1,附加转移链路添加由从集合关系识别的不确定性要满足的约束,其中定义用于模式匹配的数据结构。
    • 9. 发明申请
    • System and Method for Model-Driven Object Store
    • 用于模型驱动的对象存储的系统和方法
    • US20090313298A1
    • 2009-12-17
    • US12139767
    • 2008-06-16
    • Teruo KoyanagiHui LeiHiroyasu OhsakiLiangzhao Zeng
    • Teruo KoyanagiHui LeiHiroyasu OhsakiLiangzhao Zeng
    • G06F17/30
    • G06F17/30607
    • Disclosed is a system and method for model-driven datastore. The model-driven datastore includes an object persistence model editor for developing specifc object persistence models based on an object persistence metamodel. The object persistence model consists of object model, object access pattern and user defined functions. The object model consists of a collection of object definition, said object defintion supports at least one basic type or structure type of attributes. The object access pattern defines the access path that are used to retrieve the object instances, where the access path is consists of a collection of actions. The actions comprise at least one of the following a self action, parent action, or children action. User defined functions are declaratively defined and supports group operators. The model driven datastore further includes a model transformer for generating an object index based on object access patterns and executable code for supporting object access patterns and user defined functions and an object store manager for executing generated code that allows applications to create, update, retrivel or persist objects.
    • 公开了一种用于模型驱动的数据存储的系统和方法。 模型驱动的数据存储区包括一个对象持久性模型编辑器,用于基于对象持久化元模型开发特定对象持久性模型。 对象持久性模型由对象模型,对象访问模式和用户定义的功能组成。 对象模型由对象定义的集合组成,所述对象定义支持至少一种基本类型或结构类型的属性。 对象访问模式定义用于检索对象实例的访问路径,其中访问路径由一组操作组成。 行动包括以下至少一项:自我行为,父母行为或儿童行为。 用户定义的函数是声明性定义的,并支持组运算符。 模型驱动的数据存储还包括用于基于对象访问模式生成对象索引的模型变换器和用于支持对象访问模式和用户定义的功能的可执行代码以及用于执行生成的代码的对象存储管理器,该代码允许应用程序创建,更新,重新开发或 持久对象。
    • 10. 发明申请
    • METHOD AND APPARATUS FOR MAINTAINING CONSISTENCY BETWEEN DATABASE AND VIRTUAL TABLE
    • 用于维护数据库和虚拟表之间一致性的方法和装置
    • US20090276473A1
    • 2009-11-05
    • US12432032
    • 2009-04-29
    • Mari FukudaTeruo KoyanagiHiroyasu OhsakiYohsuke ozawa
    • Mari FukudaTeruo KoyanagiHiroyasu OhsakiYohsuke ozawa
    • G06F17/30
    • G06F16/2393
    • A method and system for maintaining consistency between a view of a virtual table and the database. The method includes: First, selecting a discard candidate instance from a discard candidate list table in accordance with an LRU algorithm if it is judged that there is less free space for adding an instance. Then, judging whether a revision wait flag is on for the discard candidate instance. If it is judged that the revision wait flag is on, deleting the discard candidate instance from the discard candidate list table. If it is judged that the revision wait flag is not on, deleting the discard candidate instance from the instance pool and adding the instance to the instance pool. Lastly, adding the requested instance to the instance pool if it is judged that there is enough storage area.
    • 一种用于维护虚拟表视图和数据库之间的一致性的方法和系统。 该方法包括:首先,如果判断有较少的可用空间用于添加实例,则根据LRU算法从丢弃候选列表表中选择丢弃候选实例。 然后,判断丢弃候选实例是否打开修订等待标志。 如果判断出修订等待标志已经开启,则从丢弃候选列表表中删除丢弃候选实例。 如果判断出修订等待标志不亮,则从实例池中删除丢弃候选实例,并将实例添加到实例池。 最后,如果判断存在足够的存储区域,则将所请求的实例添加到实例池。