-
公开(公告)号：KR1020040006611A
公开(公告)日：2004-01-24
申请号：KR1020020040932
申请日：2002-07-13
Applicant: 한국전자통신연구원
CPC classification number: G06K9/00187 , G06F17/30943 , G06K9/00181
Abstract: PURPOSE: A device and a method for certifying an online signature using mapping between extreme points are provided to verify identification of a subscriber by detecting a maximum point and a minimum point of a horizontal/vertical direction expressed on a locus of the inputted signature, detecting a matched sector through the mapping between the extreme points matched with each other, and judging agreement of the sector. CONSTITUTION: A signature data input part(10) reads the locus of the user's signature as a sequence of the points sampled by a same time interval. A characteristic extracting part(20) extracts the extreme points from the sequence. A matching relation generating part(30) generates a mapping relation between an extreme point list of the registered signature and the extracted signature. A similarity calculating part(40) calculates similarity between the matched sectors of the registered signature and the inputted signature. A judging part(50) judges the agreement of the registered signature and the inputted signature based on the similarity.
Abstract translation: 目的：提供使用极点之间的映射来验证在线签名的设备和方法，以通过检测在输入的签名的轨迹上表示的水平/垂直方向的最大点和最小点来检验用户的识别，检测 通过匹配的极值点之间的映射，并判断该部门的协议，匹配的部门。 构成：签名数据输入部分（10）将用户签名的轨迹作为以相同时间间隔采样的点的序列读取。 特征提取部分（20）从序列中提取极值点。 匹配关系生成部（30）生成登记签名的极点列表与提取的签名之间的映射关系。 相似度计算部（40）计算登记签名的匹配扇区与输入的签名的相似度。 判断部（50）基于相似度来判断登记的签名的一致性和输入的签名。
-
公开(公告)号：KR1020030056572A
公开(公告)日：2003-07-04
申请号：KR1020010086834
申请日：2001-12-28
Applicant: 한국전자통신연구원
CPC classification number: H01J1/3048 , H01J9/025 , Y10S977/939 , H01J1/304 , C01B32/05
Abstract: PURPOSE: A cathode for a field emission display is provided to distribute uniformly the electric field to an emitter by forming a catalytic layer at a side portion of a gate hole and growing the emitter on the catalytic layer. CONSTITUTION: A cathode for a field emission display includes a substrate(200), a catalytic layer(230), a dielectric layer(240), a gate electrode(250), an emitter(280), and a gate hole(270). The catalytic layer, the dielectric layer, the gate electrode, and the emitter are stacked on the substrate. The substrate is exposed by the gate hole. The gate electrode and the catalytic layer are formed at both sides of the gate hole, respectively. The gate electrode and the catalytic layer are located at positions of different height, respectively. A buffer layer is formed on an exposed surface of the gate electrode.
Abstract translation: 目的：提供用于场致发射显示器的阴极，通过在栅极孔的侧部形成催化剂层并在催化剂层上生长发射体，均匀地将电场分布到发射极。 构成：用于场发射显示器的阴极包括基底（200），催化层（230），电介质层（240），栅电极（250），发射极（280）和栅极孔（270） 。 催化剂层，电介质层，栅电极和发射极层叠在基板上。 基板被栅极孔暴露。 栅电极和催化剂层分别形成在栅极孔的两侧。 栅电极和催化层分别位于不同高度的位置。 在栅电极的露出表面上形成缓冲层。
-
公开(公告)号：KR1020030025036A
公开(公告)日：2003-03-28
申请号：KR1020010057947
申请日：2001-09-19
Applicant: 한국전자통신연구원
Inventor： 김도형
IPC: G06Q50/00
Abstract: PURPOSE: A method and a system for interfacing multi-chatting reflecting interest are provided to perform the mutual or one-way intention transfer smoothly when a plurality of users uses a chatting service on the network. CONSTITUTION: A system for interfacing the multi-chatting is initialized(301). The system calculates a distance between a user's avatar and the rest avatars except for the user's avatar(302). According to the calculated distance, the avatars of entire users is sorted by the distance from the user's avatar(303) and is displayed by the user's interest for the entire users. A message of a chatting window is displayed according to a sorted value of the user's interest(304). According to the movement of the avatars, the distances between the avatars are decided again by repeating the previous steps(305).
Abstract translation: 目的：提供一种用于连接多聊天反映兴趣的方法和系统，以便当多个用户在网络上使用聊天服务时，平滑地执行相互或单向意图传送。 构成：初始化用于连接多聊天的系统（301）。 系统计算用户头像和除了用户头像之外的其余头像之间的距离（302）。 根据计算的距离，整个用户的化身按照与用户头像（303）的距离进行排序，并且由用户对整个用户的兴趣进行显示。 根据用户兴趣的排序值显示聊天窗口的消息（304）。 根据化身的移动，通过重复前述步骤（305）再次决定化身之间的距离。
-
公开(公告)号：KR1020010037622A
公开(公告)日：2001-05-15
申请号：KR1019990045258
申请日：1999-10-19
Applicant: 한국전자통신연구원
IPC: G06F15/16
CPC classification number: G06F11/1438
Abstract: PURPOSE: An independent check point method is provided to let a plurality of processors to have a minimum number of check points irrespective of the transmission amount and speed among the processors when the processors perform a common task, and eliminate processor dependency by using the memory check point so that a roll back distance can be reduced. CONSTITUTION: The method comprises steps of generating a message in the case that a message has to be transmitted to other process proceeded in other local machine while proceeding a current process(S10), adding a check point number of the current process to the generated message(S11), setting a true value at a message transmission flag to express that the current process transmits the message to other process and transmitting the message(S12,S13). The message transmission flag is necessary because an orphan message is generated. The orphan message is a message transmitted after the check point of the message transmission process is transmitted, and received before the check point of the message receiving process is received.
Abstract translation: 目的：提供一种独立的检查点方法，以便当处理器执行公共任务时，使多个处理器具有最小数量的检查点，而与处理器之间的传输量和速度无关，并且通过使用存储器检查来消除处理器依赖性 使得可以减少回滚距离。 构成：该方法包括以下步骤：在进行当前处理的情况下，必须将消息发送到在其他本地机器中进行的其他处理的情况下生成消息（S10），将当前处理的检查点号添加到生成的消息 （S11），在消息发送标志处设定真值，表示当前处理向其他处理发送消息并发送消息（S12，S13）。 消息发送标志是必要的，因为产生孤立消息。 孤立消息是在发送消息发送处理的检查点之后发送的消息，并且在接收到消息接收处理的检查点之前接收到的消息。
-
公开(公告)号：KR1020000018458A
公开(公告)日：2000-04-06
申请号：KR1019980036043
申请日：1998-09-02
Applicant: 한국전자통신연구원
IPC: G06F9/44
Abstract: PURPOSE: A method providing the program developing environment is provided to have the effect of using the source program on the web using the web browser without an extra editor for coding the source program by providing the environment in which the coding of source program directly at the web browser. CONSTITUTION: The method comprises a local machine(11) which provides a program developing environment in which coding of the source program can be done through the window 1 of the web browser. A client program(12) carried out at the local machine detects whether the compiler or the library for carrying out the source program is installed in the disk(13) of the local machine or not. If the needed compiler or the library are not installed in the local machine, source program needed in compiling and the compile options are transmitted to the first server program(15) which is carried put at the designated first server machine(14).
Abstract translation: 目的：提供一种提供程序开发环境的方法是为了具有使用Web浏览器在Web上使用源程序的效果，而不需要额外的编辑器对源程序进行编码，方法是将源程序的编码直接提供给 网页浏览器。 构成：该方法包括本地机器（11），其提供程序开发环境，通过web浏览器的窗口1可以对源程序进行编码。 在本地机器上执行的客户机程序（12）检测用于执行源程序的编译器或库是否安装在本地机器的盘（13）中。 如果所需的编译器或库未安装在本地机器中，编译所需的源程序和编译选项被传送到在指定的第一服务器机器（14）上运送的第一服务器程序（15）。
-
Patent Agency Ranking
公开(公告)号：KR100249796B1
公开(公告)日：2000-03-15
申请号：KR1019970066353
申请日：1997-12-05
Applicant: 한국전자통신연구원
IPC: G06F15/16
Abstract: 본 발명은 다수의 노드들로 구성된 주전산기 IV(포라고 읽음)에서 각 노드들의 상태와 노드들로 구성된 클러스터, 그리고 전체 시스템 상태를 감시할 수 있는 성능 감시 시스템에 관한 것으로써, 기존의 성능 감시기가 하나의 노드만 감시할 수 있는 단점을 개선하여 다수의 노드들로 구성된 주전산기 IV에서 노드들의 상태, 그 노드들로 구성된 클러스터의 상태, 그리고 전체 시스템 상태를 선택적으로 감시할 수 있는 성능 감시기를 이용하여 관리자는 시스템 내의 노드, 클러스터, 전체 시스템 상태를 감시할 수 있어 효과적인 성능 감시가 가능하고, 시스템 내에 어떤 자원들이 성능을 저하시키는지를 판단할 수 있는 성능 감시 시스템을 제공하는 것이다. 이를 달성을 위하여 본 발명은 다수의 노드들로 구성된 주전산기 IV에서 효과적인 성능 감시가 가능하도록 시스템 내의 모든 동작중인 노드들로부터 데이터를 수집하는 함수와 수집된 데이터를 시스템 구성 정보에 따라 클러스터, 그리고 전체 시스템 데이터들로 계산하는 함수를 구현한 이 성능 감시 시스템은 다수의 노드들로 구성된 주전산기 IV에서 각 노드의 상태, 노드들로 구성된 클러스터의 상태, 그리고 전체 시스템 상태를 효과적으로 감시할 수 있다.
-
-
-
-
公开(公告)号：KR101902192B1
公开(公告)日：2018-10-01
申请号：KR1020160027250
申请日：2016-03-07
Applicant: 한국전자통신연구원
Abstract: 3차원기반의유사안무검색방법및 이를이용한장치가개시된다. 본발명에따른 3차원기반의유사안무검색방법은사용자가입력하는 3차원입력동작에서골격정보를추출하여골격정보시퀀스를생성하는단계; 상기관절을기반으로상기골격정보시퀀스를자세기술자시퀀스로변환하고, 상기자세기술자시퀀스에서복수개의핵심자세들을추출하는단계; 복수개의안무동작들과상기복수개의핵심자세들을비교하여유사도를알 수있는매칭거리를산출하고, 상기매칭거리를저장하여매칭거리매트릭스를생성하는단계; 및상기매칭거리매트릭스를기반으로복수개의후보구간들을추출하고, 상기복수개의후보구간들중 어느하나의유사안무를검색하는단계를포함한다.
-
-
-
-
-
-
-
-
-
Search Results
283
records
(took 0.044 seconds)
