-
公开(公告)号：KR1020150007064A
公开(公告)日：2015-01-20
申请号：KR1020130080972
申请日：2013-07-10
Applicant: 한국과학기술정보연구원
CPC classification number: G06F17/10
Abstract: 본 발명은, 데이터 분석 장치, 데이터 분석 방법 및 데이터를 분석하는 프로그램을 저장하는 저장매체에 관한 것이다. 본 발명의 일 실시예는, 연구자에 대한 정보를 입력받는 단계; 적어도 하나의 리소스로부터 상기 연구자와 관련된 개체정보 또는 상기 연구자와 관련된 개체정보의 관계를 나타내는 개체관계정보를 추출하는 단계; 상기 추출한 개체정보 또는 개체관계정보를 기반으로 상기 연구자의 연구분야 또는 기술분야에 따른 환경역량지표들을 산출하는 단계; 및 상기 산출된 환경역량지표들을 시각화하여 표출하는 단계;를 포함하는 데이터 분석 방법을 제공한다.
Abstract translation: 本发明涉及数据分析装置，数据分析方法以及用于存储数据分析程序的存储介质。 根据本发明的实施例，一种数据分析方法包括以下步骤：在研究者身上接收信息; 从至少一个资源提取与研究者相关的对象信息或表示与研究者有关的对象信息之间的关系的对象关系信息; 根据提取的对象信息或对象关系信息，根据研究者的研究领域或技术领域计算环境能力指标; 并显示和显示计算的环境能力指标。
-
公开(公告)号：KR101411563B1
公开(公告)日：2014-06-25
申请号：KR1020130132303
申请日：2013-11-01
Applicant: 한국과학기술정보연구원
Abstract: Disclosed is a distribution processing method based on resource locality. The distribution processing method comprises a step for extracting a high frequency reference resource based on a predetermined standard; a step for storing the high frequency reference resource in a distribution storage unit included in each node; and a step for connecting a processor which processes a task to the distribution storage unit in which the high frequency reference resource is stored based on the information from the high frequency reference resource. Therefore, the distribution processing method reduces network overhead by securing the locality of resource data and quickly performs distribution processing.
Abstract translation: 公开了一种基于资源位置的分布处理方法。 分发处理方法包括：基于预定标准提取高频参考资源的步骤; 用于将高频参考资源存储在包括在每个节点中的分发存储单元中的步骤; 以及基于来自高频参考资源的信息将处理任务的处理器连接到其中存储有高频参考资源的分发存储单元的步骤。 因此，分发处理方法通过确保资源数据的位置来快速地进行分发处理来减少网络开销。
-
公开(公告)号：KR101389503B1
公开(公告)日：2014-04-28
申请号：KR1020130132073
申请日：2013-11-01
Applicant: 한국과학기술정보연구원
CPC classification number: G06Q30/0282 , G06Q10/06393 , G06Q30/0278 , G06Q50/01 , G06Q50/18 , G06Q50/30
Abstract: A method for technology matchmaking is disclosed. The method for technology matchmaking comprises the following steps of: calculating a newness item of a technology; calculating an originality item of the technology; calculating a specialty item of the technology; calculating a usability item of the technology; calculating an excellency item of the technology; comparing the technology with the same technology of another institution using the calculated newness item, the originality item, the specialty item, usability item, the excellency item of the technology, and generating technology matching information; and outputting the generated technology matching information. As a result, the method for technology matchmaking can recommend an institution having high technology to an institution intending to receive technology transfer, and recommend an institution needing technology to an institute intending to provide the transfer of technology.
Abstract translation: 公开了一种技术配对的方法。 技术配对的方法包括以下步骤：计算技术的新颖性; 计算技术的独创性; 计算该技术的专业项目; 计算技术的可用性项目; 计算技术的优秀项目; 使用计算的新项目，原创性项目，专业项目，可用性项目，技术优异项目以及生成技术匹配信息将技术与其他机构相同的技术进行比较; 并输出生成的技术匹配信息。 因此，技术配对的方法可以向有意接收技术转让的机构推荐具有高技术的机构，并向有意提供技术转让的机构推荐需要技术的机构。
-
公开(公告)号：KR1020130057715A
公开(公告)日：2013-06-03
申请号：KR1020110123596
申请日：2011-11-24
Applicant: 한국과학기술정보연구원
CPC classification number: G06F17/3064 , G06F17/30672
Abstract: PURPOSE: A deep knowledge providing method based on a scientific knowledge memory and a device thereof are provided to analyze literature of a specific science field and copy a complex process which learns knowledge by using natural language processing and mining technology, thereby automatically extracting and accumulating specialized knowledge. CONSTITUTION: A knowledge memory(304) stores relational knowledge, structural knowledge, and procedural knowledge for a document. A deep knowledge providing unit(306) inputs a query language. The deep knowledge providing unit searches and provides a triple which includes the query language and documents related to the triple. The deep knowledge providing unit uses a GCL(Generalized Concordance Lists) query which searches a specific word or a relation between word sets or between words. [Reference numerals] (302) Multidimensional knowledge generating technology; (304a) Relational knowledge memory; (304b) Structural knowledge memory; (304c) Procedural knowledge memory; (306) Deep knowledge providing technology; (AA) Large scholarly information; (BB) Deep knowledge delivery by field
Abstract translation: 目的：提供基于科学知识记忆及其设备的深度知识提供方法，分析具体科学领域的文献，并复制使用自然语言处理和挖掘技术学习知识的复杂过程，从而自动提取和累积专门的 知识。 规定：知识记忆（304）存储文档的关系知识，结构知识和程序知识。 深度知识提供单元（306）输入查询语言。 深入的知识提供部门搜索并提供了一个三元组，其中包括与三元组相关的查询语言和文档。 深度的知识提供单元使用搜索特定词或词组之间或词之间的关系的GCL（广义一致列表）查询。 （附图标记）（302）多维知识生成技术; （304a）关系知识记忆; （304b）结构知识记忆; （304c）程序知识记忆; （306）深入的知识提供技术; （AA）大学术信息; （BB）深入知识交付领域
-
Patent Agency Ranking
公开(公告)号：KR101644429B1
公开(公告)日：2016-08-10
申请号：KR1020160018386
申请日：2016-02-17
Applicant: 한국과학기술정보연구원
CPC classification number: G06F17/30371 , G06F17/2765 , G06F17/30241 , G06F17/30516 , G06F17/30551 , G06F17/30569 , G06F17/30684 , G06F17/30699 , G06N99/005
Abstract: 본발명은비정형텍스트추출성능향상을위한시스템및 방법에관한것으로서, 수집된비정형텍스트를언어분석하여, 이벤트키워드, 이벤트가발생한시간정보또는공간정보를추출하고, 상기이벤트키워드에시간정보또는공간정보를매핑시켜추출지식후보들을생성하는비정형데이터처리부, 시공간연계정형데이터를이용하여상기비정형데이터처리부에서생성된추출지식후보들의유효성을판단하는필터부를포함한다.
Abstract translation: 本发明涉及一种非结构化文本提取性能改进系统及其方法。 该系统包括：非结构化数据处理单元，被配置为语言分析收集的非结构化文本以提取事件关键字;以及时间信息或空间信息，其中事件被生成并被配置为将事件关键字中的时间信息或空间信息映射 产生提取知识候选人; 以及滤波器单元，被配置为通过使用时空相关结构化数据来确定在非结构化数据处理单元中生成的提取知识候选的有效性。
-
16.发明授权다종 리소스들의 의미기반 시차 조정 방법, 다종 리소스들의 의미기반 시차 조정 장치 및 다종 리소스들의 의미기반 시차를 조정하는 프로그램을 저장하는 저장 매체 有权一种基于多元资源意义调整时间差异的方法，用于根据多元资源的意义调整时间差异的装置和存储基于多元资源意义的程序调整时间差异的存储介质的方法
公开(公告)号：KR101374197B1
公开(公告)日：2014-03-12
申请号：KR1020130117694
申请日：2013-10-02
Applicant: 한국과학기술정보연구원
CPC classification number: G06F17/3071
Abstract: An apparatus for adjusting the time difference of diverse resources based on meaning, according to an embodiment of the present invention, includes: a cluster generation module which generates index term clusters based on index terms according to the time when the diverse resources have been generated, wherein the diverse resources include resource data in the same research fields; a similarity measurement module which measures the degree of similarity between cluster sets at every time difference generated by moving the index term clusters of the diverse resources along a time axis by the hour; and a calibration module which adjusts the time difference between the generation of the diverse resources based on the measured degree of similarity. [Reference numerals] (AA) Start; (BB) Repeat action for diverse resources; (CC) End; (S2000) Input data; (S2100) Generate index term cluster by resources; (S2200) Measure the degree of similarity between the diverse resources; (S2300) Adjust and verify the time difference based on the diverse resources; (S2400) Divide adjusted and verified time series data; (S2500) Output and store the data
Abstract translation: 根据本发明的实施例的用于调整不同资源的时间差的装置包括：根据指标项根据指标项生成指标项集群的集群生成模块，该集群生成模块根据生成不同资源的时间， 其中各种资源包括相同研究领域的资源数据; 相似度测量模块，其通过沿着时间轴移动不同资源的索引项集群而产生的每个时间差异来测量集群集之间的相似度; 以及校准模块，其基于所测量的相似度来调整所述不同资源的生成之间的时间差。 （附图标记）（AA）开始; （BB）为各种资源重复行动; （CC）结束; （S2000）输入数据; （S2100）按资源生成指标项集; （S2200）测量不同资源之间的相似程度; （S2300）根据不同的资源调整和验证时差; （S2400）对经过调整后验证的时间序列数据进行分割; （S2500）输出并存储数据
-
公开(公告)号：KR101259418B1
公开(公告)日：2013-04-30
申请号：KR1020120052262
申请日：2012-05-17
Applicant: 한국과학기술정보연구원
CPC classification number: G06Q50/10 , G06F17/30 , G06F17/30734
Abstract: PURPOSE: An adaptive user guide service method and a server are provided to find potential concerns through collecting and analyzing real time user feedback, thereby supplying a desired result to a user. CONSTITUTION: A user feedback information collection unit(240) collects user feedback information from user terminals through a communication unit(230). An entity extraction unit(250) extracts entities from the collected user feedback information. A transfer candidate service selection unit(260) selects a transfer candidate service with a precondition corresponding to information related to an extracted entity among transfer candidate services of a first service through a search a service guide information database(220). A service providing unit(270) transfers the first service to the selected transfer candidate service. [Reference numerals] (200) Service providing server; (210) Service information DB; (220) Service guide information DB; (230) Communication unit; (240) User feedback information collection unit; (250) Entity extraction unit; (260) Transfer candidate service selection unit; (270) Service providing unit; (280) Ontology DB;
Abstract translation: 目的：提供自适应用户指南服务方法和服务器，通过收集和分析实时用户反馈来发现潜在的问题，从而为用户提供所需的结果。 构成：用户反馈信息收集单元（240）通过通信单元（230）从用户终端收集用户反馈信息。 实体提取单元（250）从所收集的用户反馈信息中提取实体。 转移候选服务选择单元（260）通过搜索服务指南信息数据库（220），选择具有与第一服务的转移候选服务中提取的实体相关的信息的前提条件的转移候选服务。 服务提供单元（270）将第一服务传送到所选择的转移候选服务。 （附图标记）（200）服务提供服务器; （210）服务信息DB; （220）服务指南信息DB; （230）通讯单元; （240）用户反馈信息收集单元; （250）实体提取单元; （260）转移候选服务选择单元; （270）服务提供单位; （280）本体数据库;
-
公开(公告)号：KR101255060B1
公开(公告)日：2013-04-16
申请号：KR1020120077379
申请日：2012-07-16
Applicant: 한국과학기술정보연구원
Abstract: PURPOSE: A MapReduce based dispersion parallel entity extracting system and a method thereof are provided to guarantee shortened entity extracting response time by extracting entity based on a MapReduce framework. CONSTITUTION: A master server device(100) distributes target document data to slave server devices(200a-200N) by dividing an input document into the target document data. The slave server device converts the target document data into a data format which is able to be processed in a MapReduce framework, divides the content of the converted document into sentences, and divides the divided sentences into construction units. The slave server device extracts the combination of the construction units as entity candidates and defines a relationship between the extracted entities. [Reference numerals] (100) Master server; (200a) Slave server 1; (200b) Slave server 2; (200N) Slave server N;
Abstract translation: 目的：提供一种基于MapReduce的色散并行实体提取系统及其方法，以通过基于MapReduce框架提取实体来保证缩短的实体提取响应时间。 构成：主服务器设备（100）通过将输入文档划分为目标文档数据来将目标文档数据分发到从服务器设备（200a-200N）。 从服务器设备将目标文档数据转换为能够在MapReduce框架中处理的数据格式，将转换的文档的内容分为句子，并将分割的句子划分为构造单元。 从服务器设备将构建单元的组合提取为实体候选，并定义提取的实体之间的关系。 （附图标记）（100）主服务器; （200a）从服务器1; （200b）从服务器2; （200N）从服务器N;
-
公开(公告)号：KR101243054B1
公开(公告)日：2013-03-13
申请号：KR1020120074060
申请日：2012-07-06
Applicant: 한국과학기술정보연구원
CPC classification number: G06F17/21 , G06F17/2705 , G06F17/30663 , G06F17/30864
Abstract: PURPOSE: A web search based word recognition method and a device thereof are provided to use a web search result for a word candidate extracted from a document group as statistical information for assigning a weighted value for the word candidate, thereby reflecting the weighted value and recognizing a new word. CONSTITUTION: A word candidate extraction unit obtains part of speech information and original word information by analyzing sentences of an input document. The word candidate extraction unit extracts word candidates by using the part of speech information, the original word information, and a stored word candidate pattern. A quality extraction unit obtains basic quality for the word candidates and web quality of a web search result(S306). A word recognition unit assigns a weighted value by applying machine learning to the basic quality and the web quality and recognizes a word candidate which the weighted value is the highest as a word(S308). [Reference numerals] (AA) Start; (BB) End; (S302) Extracting word candidates by analyzing an input document; (S304) Obtaining basic quality for the extracted word candidates and web quality of a web search result; (S306) Obtaining basic quality of each word candidate and web quality of the web search result; (S308) Recognizing a word candidate which the weighted value is the highest as a word
Abstract translation: 目的：提供一种基于网络搜索的词识别方法及其装置，用于将从文档组提取的词候选的网页搜索结果用作用于分配词候选的加权值的统计信息，从而反映加权值并识别 一个新词 构成：单词候选提取单元通过分析输入文档的句子来获得语音信息和原始单词信息。 词候选提取单元通过使用部分语音信息，原始词信息和存储的词候选模式来提取词候选。 质量提取单元获得网页搜索结果的候选词和网页质量的基本质量（S306）。 字识别单元通过将机器学习应用于基本质量和网页质量来分配加权值，并将加权值最高的词候选码识别为字（S308）。 （附图标记）（AA）开始; （BB）结束; （S302）通过分析输入文档来提取词候选; （S304）获取提取的词候选的基本质量和网页搜索结果的网页质量; （S306）获取每个单词候选人的基本素质和网页搜索结果的网页质量; （S308）识别作为单词的加权值最高的单词候选
-
-
-
-
-
-
-
-
Search Results
19
records
(took 0.023 seconds)
