• Title/Summary/Keyword: Graph Library

Search Result 48, Processing Time 0.032 seconds

A Study on the Network Generation Methods for Examining the Intellectual Structure of Knowledge Domains (지적 구조의 규명을 위한 네트워크 형성 방식에 관한 연구)

  • Lee Jae-Yun
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.40 no.2
    • /
    • pp.333-355
    • /
    • 2006
  • Network generation methods to visualize bibliometric data for examining the intellectual structure of knowledge domains are investigated in some detail. Among the four methods investigated in this study, pathfinder network algorithm is the most effective method in representing local details as well as global intellectual structure. The nearest neighbor graph, although never used in bibliometic analysis, also has some advantages such as its simplicity and clustering ability. The effect of input data preparation process on resulting intellectual structures are examined, and concluded that unlike MDS map with clusters, the network structure could be changed significantly by the differences in data matrix preparation process. The network generation methods investigated in this paper could be alternatives to conventional multivariate analysis methods and could facilitate our research on examining intellectual structure of knowledge domains.

A system for recommending audio devices based on frequency band analysis of vocal component in sound source (음원 내 보컬 주파수 대역 분석에 기반한 음향기기 추천시스템)

  • Jeong-Hyun, Kim;Cheol-Min, Seok;Min-Ju, Kim;Su-Yeon, Kim
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.6
    • /
    • pp.1-12
    • /
    • 2022
  • As the music streaming service and the Hi-Fi market grow, various audio devices are being released. As a result, consumers have a wider range of product choices, but it has become more difficult to find products that match their musical tastes. In this study, we proposed a system that extracts the vocal component from the user's preferred sound source and recommends the most suitable audio device to the user based on this information. To achieve this, first, the original sound source was separated using Python's Spleeter Library, the vocal sound source was extracted, and the result of collecting frequency band data of manufacturers' audio devices was shown in a grid graph. The Matching Gap Index (MGI) was proposed as an indicator for comparing the frequency band of the extracted vocal sound source and the measurement data of the frequency band of the audio devices. Based on the calculated MGI value, the audio device with the highest similarity with the user's preference is recommended. The recommendation results were verified using equalizer data for each genre provided by sound professional companies.

The Ecology of the Scientific Literature and Information Retrieval (I)

  • Jeong, Jun-Min
    • Journal of the Korean Society for information Management
    • /
    • v.2 no.2
    • /
    • pp.3-37
    • /
    • 1985
  • This research deals with the problems encountered in designing systems for more efficient and effective information retrieval used in the proliferation of literature. This research was designed to develop and test 1) the partitioning a large bibliographic data base into quality oriented subsets (quality filtering), and 2) a system for effective and efficient information retrieval within subsets of data base (relevance). In order to accomplish this partitioning, the 'kernel' technique of graph theory was applied. In addition, a method of quality filtering utilizing the 'epidemic' theory and the 'obsolescence' of scientific literature was developed.

  • PDF

Collision-free path planning for an articulated robot (다관절 로보트를 위한 충돌 회피 경로 계획)

  • 박상권;최진섭;김동원
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.629-634
    • /
    • 1995
  • The purpose of this paper is to develop a method of Collision-Free Path Planning (CFPP) for an articulated robot. First, the configuration of the robot is formed by a set of robot joint angles derived fromm robot inverse kinematics. The joint space that is made of the joint angle set, forms a Configuration space (Cspace). Obstacles in the robot workcell are also transformed and mapped into the Cspace, which makes Cobstacles in the Cspace. (The Cobstacles represented in the Cspace is actually the configurations of the robot causing collision.) Secondly, a connected graph, a kind of roadmap, is constructed from the free configurations in the 3 dimensional Cspace, where the configurations are randomly sampled form the free Cspace. Thirdly, robot paths are optimally in order to minimize of the sum of joint angle movements. A path searching algorithm based on A is employed in determining the paths. Finally, the whole procedures for the CFPP method are illustrated with a 3 axis articulated robot. The main characteristics of the method are; 1) it deals with CFPP for an articulated robot in a 3-dimensional workcell, 2) it guarantees finding a collision free path, if such a path exists, 3) it provides distance optimization in terms of joint angle movements. The whole procedures are implemented by C on an IBM compatible 486 PC. GL (Graphic Library) on an IRIS CAD workstation is utilized to produce fine graphic outputs.

  • PDF

Design on the Structure of VRML Authoring Tool for Multi-user (다중 사용자용 VRML Authoring Tool 구조 설계)

  • Choi, Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.2 no.1
    • /
    • pp.59-66
    • /
    • 2001
  • Networked Virtual Reality systems provide a consistent virtual world to the users, possibly ditributed across long distance, and have been widely applied in the military war game, network game. edutainment, architectural areas, and shopping mall etc. Large processing requirements. however. made these systems be mainly researched on the platforms of high-performence system graphics workstations. This study paper Presents several problems when networked virtual reality systems are implemented on commodity Internet : two problems related with 3D graphical Processing, and the other related with network bandwidth and transmission delay. We also suggest solutions to these problems and analyze their performance effect based on an architectural simulation application.

  • PDF

A Study on the Behavioral technology Synthesis of VHDL for Testability (검사 용이화를 위한 VHDL의 동작기술 합성에 관한 연구)

  • Park, Jong-Tae;Choi, Hyun-Ho;Her, Hyong-Pal
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.4
    • /
    • pp.329-334
    • /
    • 2002
  • For the testability, this paper proposed the algorithm at autonomous synthesis which includes the data path structure as the self testing as possible on high level synthesis method when VHDL, coding is used in the system design area. In the proposed algorithm of this paper, MUXs and registers are assigned to the data path of designed system. And the designed data path could be mapped the H/W specification of described VHDL coding to the testable library. As a results, it was mapped H/W to the assign algorithm that is minimized MUX and the registers in collision graph.

The design and implementation of echo canceller with new variable step size algorithm (새로운 가변 적응 상수 알고리즘을 이용한 반향제거기 설계 및 구현)

  • 최건오;윤성식;조현묵;이주석;박노경;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.6
    • /
    • pp.1533-1545
    • /
    • 1996
  • In this paper, the design and implementation of echo canceller with new variable step size algorithm is discussed. The method used in the new algorithm is to periodically adopt the test function which helps an optimal coefficient tracking. This algorithm outperforms LMS and VS algorithms in convergence speed and steady state error. As the period of test function is decreased, the speed of convergence is improved, but the number of calculation is increased, then the trade off between these parameters must be considered. Simulation results show new algorithm outperforms LMS and VS algorithms in convergence rate. For the design of hardware, circuit is designed with VHDL, and synthesized with Act1 withc is a FPGA library of ActelTM in use of synovation of InterGraph$^{TM}$. Verification of the synthesized circuit is carried out with simulator DLAB. The circuit based on the algorithm which is suggested in this paper calculated 7 radix places of inary number. A simulation data for the verification is based on the data of algorithm simulation. When the same input data is applied to the both simulation, output results of circuit simulation had slight difference in compare with that of algorithm simulation. The number of used gate is about 5,500 and We have 5.53MHz in maximum frequency.y.

  • PDF

Implementation of an Object -Oriented Simulator for the Signal Control of Multiple Crossroads (복합교차로의 신호제어를 위한 객체지향 시뮬레이터 구현)

  • Han, Byeong-Jun;Kim, Jong-Wan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.5 no.6
    • /
    • pp.719-726
    • /
    • 1999
  • 본 논문은 교통 신호 제어 알고리즘들의 성능을 비교하기 위한 복합교차로 시뮬레이터를 구현하였다. 기존의 교통 시뮬레이터들은 단일교차로를 대상으로 하거나 텍스트 모드로 동작하는 경우가 많았다. 논문의 시뮬레이터는 Visual C++의 MFC 라이브러리를 사용하여 n $\times$ n 형태를 갖는 복합교차로에 적합하도록 객체지향적으로 구현되었으며, 성능 비교를 위하여 제어 알고리즘들을 별개의 윈도우에서 처리하기 쉽도록 MDI 방식을 사용하였다. 개발한 시뮬레이터는 그래프 윈도우와 맵 윈도우의 편리한 사용자 인터페이스, 논리시간 설정을 통한 다목적 시뮬레이션, 다양한 성능평가 출력 등의 특징을 갖는다. Abstract In this paper, we implemented a multiple crossroad simulator to evaluate the performance of the traffic signal control algorithms. Most of existing traffic simulators were operated in text-mode or at a single intersection. We developed the object-oriented simulator suitable for multiple crossroads with n $\times$ n intersections by using MFC (Microsoft Foundation Class) library in Visual C++. The simulator was implemented by using MDI (Multiple Document Interface) scheme in order to process both control algorithms in separate windows respectively. Our simulator has the following features: user friendly interface with graph window and map window, multi-purpose simulations by setting logical time, and various forms of performance evaluation.

Twitter Issue Tracking System by Topic Modeling Techniques (토픽 모델링을 이용한 트위터 이슈 트래킹 시스템)

  • Bae, Jung-Hwan;Han, Nam-Gi;Song, Min
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.109-122
    • /
    • 2014
  • People are nowadays creating a tremendous amount of data on Social Network Service (SNS). In particular, the incorporation of SNS into mobile devices has resulted in massive amounts of data generation, thereby greatly influencing society. This is an unmatched phenomenon in history, and now we live in the Age of Big Data. SNS Data is defined as a condition of Big Data where the amount of data (volume), data input and output speeds (velocity), and the variety of data types (variety) are satisfied. If someone intends to discover the trend of an issue in SNS Big Data, this information can be used as a new important source for the creation of new values because this information covers the whole of society. In this study, a Twitter Issue Tracking System (TITS) is designed and established to meet the needs of analyzing SNS Big Data. TITS extracts issues from Twitter texts and visualizes them on the web. The proposed system provides the following four functions: (1) Provide the topic keyword set that corresponds to daily ranking; (2) Visualize the daily time series graph of a topic for the duration of a month; (3) Provide the importance of a topic through a treemap based on the score system and frequency; (4) Visualize the daily time-series graph of keywords by searching the keyword; The present study analyzes the Big Data generated by SNS in real time. SNS Big Data analysis requires various natural language processing techniques, including the removal of stop words, and noun extraction for processing various unrefined forms of unstructured data. In addition, such analysis requires the latest big data technology to process rapidly a large amount of real-time data, such as the Hadoop distributed system or NoSQL, which is an alternative to relational database. We built TITS based on Hadoop to optimize the processing of big data because Hadoop is designed to scale up from single node computing to thousands of machines. Furthermore, we use MongoDB, which is classified as a NoSQL database. In addition, MongoDB is an open source platform, document-oriented database that provides high performance, high availability, and automatic scaling. Unlike existing relational database, there are no schema or tables with MongoDB, and its most important goal is that of data accessibility and data processing performance. In the Age of Big Data, the visualization of Big Data is more attractive to the Big Data community because it helps analysts to examine such data easily and clearly. Therefore, TITS uses the d3.js library as a visualization tool. This library is designed for the purpose of creating Data Driven Documents that bind document object model (DOM) and any data; the interaction between data is easy and useful for managing real-time data stream with smooth animation. In addition, TITS uses a bootstrap made of pre-configured plug-in style sheets and JavaScript libraries to build a web system. The TITS Graphical User Interface (GUI) is designed using these libraries, and it is capable of detecting issues on Twitter in an easy and intuitive manner. The proposed work demonstrates the superiority of our issue detection techniques by matching detected issues with corresponding online news articles. The contributions of the present study are threefold. First, we suggest an alternative approach to real-time big data analysis, which has become an extremely important issue. Second, we apply a topic modeling technique that is used in various research areas, including Library and Information Science (LIS). Based on this, we can confirm the utility of storytelling and time series analysis. Third, we develop a web-based system, and make the system available for the real-time discovery of topics. The present study conducted experiments with nearly 150 million tweets in Korea during March 2013.

Development of a Korean Speech Recognition Platform (ECHOS) (한국어 음성인식 플랫폼 (ECHOS) 개발)

  • Kwon Oh-Wook;Kwon Sukbong;Jang Gyucheol;Yun Sungrack;Kim Yong-Rae;Jang Kwang-Dong;Kim Hoi-Rin;Yoo Changdong;Kim Bong-Wan;Lee Yong-Ju
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.8
    • /
    • pp.498-504
    • /
    • 2005
  • We introduce a Korean speech recognition platform (ECHOS) developed for education and research Purposes. ECHOS lowers the entry barrier to speech recognition research and can be used as a reference engine by providing elementary speech recognition modules. It has an easy simple object-oriented architecture, implemented in the C++ language with the standard template library. The input of the ECHOS is digital speech data sampled at 8 or 16 kHz. Its output is the 1-best recognition result. N-best recognition results, and a word graph. The recognition engine is composed of MFCC/PLP feature extraction, HMM-based acoustic modeling, n-gram language modeling, finite state network (FSN)- and lexical tree-based search algorithms. It can handle various tasks from isolated word recognition to large vocabulary continuous speech recognition. We compare the performance of ECHOS and hidden Markov model toolkit (HTK) for validation. In an FSN-based task. ECHOS shows similar word accuracy while the recognition time is doubled because of object-oriented implementation. For a 8000-word continuous speech recognition task, using the lexical tree search algorithm different from the algorithm used in HTK, it increases the word error rate by $40\%$ relatively but reduces the recognition time to half.