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

1. 发明专利

JP2010157197A Character string inputting program 审中-公开
标题翻译：字符串输入程序
公开(公告)号：JP2010157197A
公开(公告)日：2010-07-15
申请号：JP2009017308
申请日：2009-01-02
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06F17/22
摘要： PROBLEM TO BE SOLVED: To make operation for selecting a candidate character string to be more efficient, without disturbing operation of conventional conversion inputting method and direct inputting method, resulting in improved efficiency of inputting itself of a character string, relating to a character string inputting program. SOLUTION: In a conversion inputting program, when one key is pressed while a conversion key such as a space key is pressed and held, the character string assigned to that key can be selected. Thus, a character string to be converted can be efficiently selected while avoiding overlapping with a conventional operation. COPYRIGHT: (C)2010,JPO&INPIT
摘要翻译：要解决的问题：为了使候选字符串的选择更有效，而不干扰常规转换输入方法和直接输入方法的操作，从而提高了输入字符串的自身的效率，涉及一个字符串输入程序。
解决方案：在转换输入程序中，当按住并按住空格键等转换键时按下一个键，可以选择分配给该键的字符串。因此，可以有效地选择要转换的字符串，同时避免与常规操作重叠。版权所有（C）2010，JPO＆INPIT

2. 发明专利

JP2012198865A Cnf-related data structure, cnf-related data structure program, and cnfsat calculation program 审中-公开
标题翻译：与CNF相关的数据结构，与CNF相关的数据结构计划和CNFSAT计算程序
公开(公告)号：JP2012198865A
公开(公告)日：2012-10-18
申请号：JP2011084897
申请日：2011-03-21
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06F17/50
摘要： PROBLEM TO BE SOLVED: To provide means for clarifying the complexity of CNF calculation and effectively performing CNFSAT calculation.SOLUTION: A CNF structure is clarified by clarifying the relationship between CNFSAT clauses and calculation complexity is also clarified by making latent restriction overt. In addition, a program for allowing a computer to achieve the function of efficiently deriving the seepage clauses is provided.
摘要翻译：要解决的问题：提供清楚CNF计算复杂度和有效执行CNFSAT计算的方法。解决方案：通过明确CNFSAT条款之间的关系，明确CNF结构，计算复杂度也通过潜在限制明确来澄清。另外，提供了一种用于允许计算机实现有效地导出渗流条件的功能的程序。版权所有（C）2013，JPO＆INPIT

3. 发明专利

JP2012141940A Logical formula conversion program, sat solver program, and sat difficulty evaluation program 审中-公开
标题翻译：逻辑公式转换计划，SAT解决方案和SAT困难评估计划
公开(公告)号：JP2012141940A
公开(公告)日：2012-07-26
申请号：JP2011010257
申请日：2011-01-01
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06F17/10
摘要： PROBLEM TO BE SOLVED: To solve the problem that a satisfiability problem varies a difficulty level by the structure of a target formula but a highly versatile SAT solver has not existed, which efficiently extracts the structure by normalizing a SAT formula, and also there has not been a program to efficiently convert a CNF into a Horn CNF.SOLUTION: A CNF is analyzed in accordance with the structure. The relation of terms having the common variable numbers of the CNF is normalized, and conversion is performed into a sequence pair, a Horn CNF, or an oriented graph. Besides, the SAT is efficiently solved by using the CNF converted into the sequence pair, the Horn CNF, or the oriented graph. The computation difficulty of a CNFSAT is also estimated based on relation between the terms having complementary parts being important points in the computation difficulty of the CNF.
摘要翻译：要解决的问题：为了解决可靠性问题通过目标公式的结构而改变难度级别的问题，但是不存在高度通用的SAT求解器的问题，其通过归一化SAT公式有效地提取结构，并且还没有一个程序有效地将CNF转换成Horn CNF。解决方案：根据结构对CNF进行分析。具有CNF的共同可变数目的项的关系被归一化，并且转换被执行到序列对，Horn CNF或定向图。此外，通过使用转换为序列对的CNF，Horn CNF或定向图来有效地解决SAT。 CNFSAT的计算难度也是根据具有互补部分的术语之间的关系来估计的，这些关系是CNF的计算难度中的重点。版权所有（C）2012，JPO＆INPIT

4. 发明专利

JP2004362520A Window switching program 审中-公开
公开(公告)号：JP2004362520A
公开(公告)日：2004-12-24
申请号：JP2003192451
申请日：2003-06-01
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06F3/14 , G06F3/00 , G06F3/048 , G09G5/00 , G09G5/14
摘要： PROBLEM TO BE SOLVED: To efficiently switch the overlapping order of windows in a computer having a multi-window function. SOLUTION: This window change program is provided with an input receiving means receiving input, an input condition recording means recording a condition whether the input agrees or not in advance, an input receiving window identifying means identifying a singular number or a plurality of windows receiving the input, a window condition recording means recording the condition whether the window agrees or not in advance, an order switching means switching the overlapping order of windows, and a switching execution means executing a window overlapping order changing means when the input received by the input receiving means agrees with the condition recorded on the input condition recording means and the window identified by the input receiving window identification means agrees with the condition recorded on the window condition recording means. COPYRIGHT: (C)2005,JPO&NCIPI

5. 发明专利

JP2012003733A Logical formula conversion program and sat solution program 审中-公开
标题翻译：逻辑公式转换计划和SAT解决方案
公开(公告)号：JP2012003733A
公开(公告)日：2012-01-05
申请号：JP2010148256
申请日：2010-06-12
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06F17/10
摘要： PROBLEM TO BE SOLVED: To overcome a problem that there is no SAT solution with high versatility effectively using symmetry of formula of SAT in the case in which a satisfiability problem has different difficulty in accordance with the structure to which the formula is directed and to overcome a problem that there is no program for converting CNF into HornCNF.SOLUTION: SAT is simplified by utilizing symmetry of variables of CNF and symmetry of a literal, thereby converting the given formula into HornCNF. The SAT converted in accordance with the HornCNF is used to efficiently solve problems.
摘要翻译：要解决的问题：为了克服一个问题，即在符合公式所针对的结构的情况下，可满足性问题具有不同难度的情况下，SAT公式的对称性可以有效地使用高通用性的SAT解决方案并克服没有将CNF转换为HornCNF的程序的问题。解决方案：通过利用CNF变量的对称性和文字的对称性来简化SAT，从而将给定的公式转换为HornCNF。根据HornCNF转换的SAT用于有效解决问题。版权所有（C）2012，JPO＆INPIT

6. 发明专利

JP2003323337A Program for estimating isolated object and garbage collection program usign this program 审中-公开
标题翻译：用于估算隔离对象和收集方案的程序使用本程序
公开(公告)号：JP2003323337A
公开(公告)日：2003-11-14
申请号：JP2002164955
申请日：2002-04-30
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06F12/00
摘要： PROBLEM TO BE SOLVED: To discriminate an object having a high isolated possibility for efficiently executing a garbage collection. SOLUTION: The object having a high isolated possibility is discriminated by summarily storing objects invalidated for reference, and has not been unaccessed after invalidation. A strong reference for forming a forest said in graph theory is made by adding information to the reference, and the object having the high isolated possibility is further efficiently discriminated. The garbage collection is efficiently executed by executing the garbage collection after investigating the discriminated object. COPYRIGHT: (C)2004,JPO
摘要翻译：要解决的问题：为了区分具有高隔离可能性的对象以有效地执行垃圾收集。解决方案：通过概括地存储无效参考的对象来区分具有高隔离可能性的对象，并且在无效之后尚未被处理。通过在参考文献中添加信息来形成图形理论中形成森林的强有力参考，并且进一步有效地区分具有高隔离可能性的对象。通过在对被识别对象进行调查之后执行垃圾收集，有效地执行垃圾收集。版权所有（C）2004，JPO

7. 发明专利

JP2014085735A Input conversion program 审中-公开
标题翻译：输入转换程序
公开(公告)号：JP2014085735A
公开(公告)日：2014-05-12
申请号：JP2012232452
申请日：2012-10-21
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06F3/041 , G06F3/023 , G06F17/22 , H03M11/04
摘要： PROBLEM TO BE SOLVED: To solve the problem that although flick input exists as an IM for efficiently inputting a text in a pointing device, efficiency of text input is bad since the flick input does not consider combinations of a plurality of operations, and an appearance frequency and codes of combinations of a plurality of characters in the text and also since a key input region is different from a decision input region in the flick input.SOLUTION: Input of an IM can be efficiently performed by combining and inputting a plurality of flicks in flick input, considering and combining input of a plurality of characters in a text and performing decision input in a key input region.
摘要翻译：要解决的问题：为了解决尽管轻弹输入作为用于在指示装置中有效地输入文本的IM而存在的问题，文本输入的效率是差的，因为轻弹输入不考虑多个操作的组合和外观频率和文本中的多个字符的组合的代码，并且还由于键输入区域与轻拂输入中的判定输入区域不同。解决方案：可以通过组合和输入多个轻击来有效地执行IM的输入在轻弹输入中，考虑并组合文本中的多个字符的输入并在键输入区域中执行决定输入。

8. 发明专利

JP2013054610A Cnf relationship data structure, and cnf relationship data structure program, and cnfsat calculation program 审中-公开
标题翻译： CNF关系数据结构和CNF关系数据结构计划和CNFSAT计算程序
公开(公告)号：JP2013054610A
公开(公告)日：2013-03-21
申请号：JP2011193413
申请日：2011-09-05
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06F17/10
摘要： PROBLEM TO BE SOLVED: To solve the problem in which: there is not a data structure for arranging and extracting the structures of SAT (satisfiability problem) and CNFSAT in the form relevant to computational complexity; there is not a calculation technique for constituting the data structure from the CNFSAT; and there is not a technique for calculating the CNFSAT using the data structure.SOLUTION: Computational complexity is clarified by classifying and arranging a clause according to the correlative and orthogonal relationship between the clauses of CNFSAT. Also, preparation of a program for realizing a function to allow a computer to efficiently calculate the correlative and orthogonal relationship enables the computer to clarify the computational complexity of the CNF and to efficiently calculate the CNFSAT.
摘要翻译：要解决的问题：解决以下问题：与计算复杂度相关的形式，没有用于安排和提取SAT（可满足性问题）和CNFSAT的结构的数据结构; 没有用于构成CNFSAT的数据结构的计算技术; 并且没有使用数据结构来计算CNFSAT的技术。解决方案：根据CNFSAT条款之间的相关和正交关系对语句进行分类和排列，来阐明计算复杂性。另外，准备用于实现使计算机有效地计算相关和正交关系的功能的程序使计算机能够澄清CNF的计算复杂度并有效地计算CNFSAT。版权所有（C）2013，JPO＆INPIT

9. 发明专利

JP2003014188A Hose bend preventing device 审中-公开
标题翻译：软管弯曲预防装置
公开(公告)号：JP2003014188A
公开(公告)日：2003-01-15
申请号：JP2001239952
申请日：2001-07-03
申请人： Kobayashi Akihiro , Kobayashi Akiyoshi , Koji Kobayashi , Kobayashi Mihoko , Sato Fumio , 佐藤文夫 , 弘二小林 , 小林明佳 , 小林明洋 , 小林美穂子
发明人： KOBAYASHI KOJI
IPC分类号： F16L57/00 , F16L55/00
摘要： PROBLEM TO BE SOLVED: To prevent an interruption of water suction/distribution due to a projection of the ground during water suction/distribution by means of a hose and to eliminate an exclusive use between a water suction hose and a water distribution hose.
SOLUTION: For preventing the hose from bending, on the inside or the outside of the hose 1, an insertion projection 3, an insertion hole 4, and a bending line 5 are formed in each of plates 2 wrapped by a small hose 8 while a connection band 6 used for connecting the plates 2 together is arranged, and when the side faces of the plates 2 are pressed, a simple assembly projection part is formed. The insertion projection 3 and the insertion hole 4 are connected to each other for forming and fixing the projection part. For easy handling of this device, the device is formed with a proper length, and the devices are connected together by means of the connection band 6. When the connection bands 6 are arranged on the plate 2 side and the center part, the hose is further prevented from bending. When the hose 1 is housed and not used, both side faces of the plate 2 are pulled to release engagement between the insertion projection 3 and the insertion hole 4 for setting the plates 2 flat, and consequently, convenience is improved further.
COPYRIGHT: (C)2003,JPO
摘要翻译：要解决的问题：为了防止由于通过软管在吸水/分配期间地面的突出而导致的吸水/分配中断，并且消除了吸水软管和配水软管之间的专有用途。解决方案：为了防止软管弯曲，在软管1的内部或外侧，在由小软管8包裹的每个板2中形成插入突起3，插入孔4和弯曲线5，同时布置用于将板2连接在一起的连接带6，并且当板2的侧面被按压时，形成简单的组装突出部。插入突起3和插入孔4彼此连接以形成和固定突出部。为了容易地处理该装置，装置形成为适当的长度，并且装置通过连接带6连接在一起。当连接带6布置在板2侧和中心部分上时，软管是进一步防止弯曲。当软管1容纳并不使用时，拉动板2的两个侧面以释放插入突起3和插入孔4之间的接合，以使板2平坦，从而进一步方便。

10. 发明专利

JP2012164295A Multivalued cnf data structure and multivalued cnf configuration program 审中-公开
标题翻译：多媒体CNF数据结构和多功能CNF配置程序
公开(公告)号：JP2012164295A
公开(公告)日：2012-08-30
申请号：JP2011037655
申请日：2011-02-06
申请人： Koji Kobayashi , 弘二小林
发明人： KOBAYASHI KOJI
IPC分类号： G06N5/04
摘要： PROBLEM TO BE SOLVED: To solve such problems that, though a difficulty level of a satisfiability (SAT) problem is changed according to a structure of a formula to be an object, there is no method for stably constituting an SAT of high difficulty level, and that values that the SAT deals with are true and false, binary values, and there is no CNF (Conjunctive Normal Form) SAT dealing with multi-valued variables such as ternary values or more.SOLUTION: A multivalued CNF that is constrained such that variables behave like multivalued variables is configured.
摘要翻译：要解决的问题为了解决这样的问题，尽管根据作为对象的公式的结构，可满足性（SAT）问题的难度水平发生变化，但是没有稳定地构成高的SAT的方法难度级别，并且SAT处理的值是真和假的二进制值，并且没有处理多值变量（如三元值或更多）的CNF（Conjunctive Normal Form）SAT。解决方案：配置多值CNF，使得变量表现得像多值变量一样被约束。版权所有（C）2012，JPO＆INPIT

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式