• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.893-900
• /
• 2007

This paper suggests an algorithm that improves the disadvantages of the Dijkstra algorithm that is commonly used in GPS navigation system, searching for the shortest path. Dijkstra algorithm, first of all, requires much memory for the performance of the algorithm. It has to carry out number of node minus 1, since it determines the shortest path from all the nodes in the graph, starting from the first node. Therefore, Dijkstra algorithm might not be able to provide the information on every second, searching for the shortest path between the roads of the congested city and the destination. In order to solve these problems, this paper chooses a method of searching a number of nodes at once by means of choosing the shortest path of all the path nodes (select of minimum weight arc in-degree and out-degree), excluding the departure and destination nodes, and of choosing all the arcs that coincide with the shortest path of the path nodes, from all the node outgoing arcs starting from the departure node. On applying the suggested algorithm to 14 various digraphs, we succeeded to search the shortest path. In addition, the result was obtained at the speed of 2 to 3 times faster than that of Dijkstra algorithm, and the memory required was less than that of Dijkstra algorithm.

• Journal of Korean Society of Archives and Records Management
• /
• v.21 no.3
• /
• pp.61-78
• /
• 2021

Records on Japanese "Comfort Women" have been individually managed by private sectors or institutions, and some are provided as digital archives on the Internet. However, records of digital archives differ in the composition and representation of metadata by individual institutions. Meanwhile, there is a lack of a consistent structure to describe the relationships between and among these records, leading to their fragmentation and disconnectedness. This paper proposes a knowledge model for interlinking the digital archival resources and builds a knowledge graph by integrating the records from distributed digital archives. It derives common elements by analyzing metadata from the diverse digital archives and expresses them in standard vocabularies to semantically describe multiple entities and relationships of the digital archival resources. In particular, the study includes the refinement of collected data to search and thread dispersed records and the enrichment of external data to provide significant contextual information of records. An evaluation of the knowledge graph is performed via a query measuring the (dis)connectivity between the distributed records. As a result, the knowledge graph is capable of interlinking and retrieving fragmented records, providing substantial contextual information on the records with external data enrichment, and searching accurately to match the user's intentions through semantic-based queries.

• Journal of Educational Research in Mathematics
• /
• v.23 no.4
• /
• pp.567-584
• /
• 2013

In school mathematics, the concept of continuous functions has been intuitively taught. Many researches reported that many students identified the continuity of function with the connectedness of the graphs. Several researchers proposed some ideas which are enhancing the formal aspects of the definition as alternative. We analysed the historical developments of the concept of continuous functions and drew pedagogical implications for the intuitive teaching of continuous functions from the result of analysis.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.644-653
• /
• 2006

This paper analyzes the properties of user query for stock investment recommendation, and defines the 'following relation', which is a new relation between two queries. A following relation between two queries $Q_1,\;Q_2$ and a recommendation value X means 'If the recommendation value of a preceding Query $Q_1$ is X, then a following query $Q_2$ always has X as its recommendation value'. If there exists a following relation between $Q_1\;and\;Q_2$, the recommendation value of $Q_2$ is decided immediately by that of $Q_1$, therefore we can eliminate the running process for $Q_2$. We suggest two methods in this paper. The former method analyzes all the following relations among user queries and represents them as a graph. The latter searches the graph and decides the order of queries to be processed, in order to make the number of eliminated query-running process maximized. When we apply the suggested procedures that use the following relation, most of user queries do not need to be processed directly, hence the performance of running overall queries is greatly improved. We examined the superiority of the suggested methods through experiments using real stock market data. According to the results of our experiments, overall query processing time has reduced less than 10% with our proposed methods, compared to the traditional procedure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.708-714
• /
• 2000

In this paper, an one-dimensional VLSI array for high speed processing of fractal image compression algorithm based the quad-tree partitioning method is proposed. First of all, the single assignment code algorithm is derived from the sequential Fisher's algorithm, and then the data dependence graph(DG) is obtained. The two-dimension array is designed by projecting this DG along the optimal direction and the one-dimensional VLSI array is designed by transforming the obtained two-dimensional array. The number of Input/Output pins in the designed one-dimensional array can be reduced and the architecture of process elements(PEs) can he simplified by sharing the input pins of range and domain blocks and internal arithmetic units of PEs. Also, the utilization of PEs can be increased by reusing PEs for operations to the each block-size. For fractal image compression of 512X512gray-scale image, the proposed array can be processed fastly about 67 times more than sequential algorithm. The operations of the proposed one-dimensional VLSI array are verified by the computer simulation.

• Annual Conference on Human and Language Technology
• /
• 1995.10a
• /
• pp.43-49
• /
• 1995

대부분 자연 언어 이해 시스템이나 중간 언어 방식을 이용한 기계 번역 시스템에서 자연 언어 문장을 이해하고 번역하기 위해서는 대량의 지식을 이용한 의미 구조의 생성이 요구된다. 따라서 개념 그래프를 이용하여 한국어 문장의 내부 의미 구조를 생성하기 위해서는 각 단어에 해당하는 개념과 개념들 사이의 개념적 관계를 나타내는 지식들이 요구된다. 그러나 이를 위한 의미 구조 생성 방법과 요구되는 지식 베이스를 정확하게 구축하는 것은 어렵고 응용 도메인에 종속한다는 문제가 있다. 본 논문에서 우리는 문형 이론을 도입하여 문형을 중심으로 의미 구조 생성을 위한 변환 규칙을 설계하고 이를 이용하여 방대한 지식 베이스의 구축없이 의미 구조를 생성할 수 있는 방법에 논의한다. 또한 본 논문에서 문형을 이용하면 몇 가지 모호성 문제를 해결할 수 있음을 보이고 문형의 한계에 대해서도 살펴본다.

• Journal of Advanced Navigation Technology
• /
• v.27 no.4
• /
• pp.423-428
• /
• 2023

In the missile actuator system, the time and position of the wings of the drive device are very important factors in the initial maneuver of the missile, and therefore, the missile actuator device must be inspected while ensuring the accuracy and real-time of motion collection data of the actuator. In this study, the difference between the design and implementation method for checking the existing actuator device and the design implementation method of the actuator device through the DAQ(Data Acquisition) device is compared, and the difference in data collection amount and real-time data collection performance is compared and tested, and the data shown through actual tests are compared. is converted into a graph, the actuator waveform is compared and analyzed, and based on the analyzed data, DAQ device inspection configuration that guarantees real-time response speed and stability during inspection of existing actuators and DAQ devices is proposed.

• Journal of the Korean School Mathematics Society
• /
• v.13 no.1
• /
• pp.23-43
• /
• 2010

This study is to investigate how much highschool students, who have learned functional concepts included in the Middle school math curriculum, understand chapters of the function, to analyze the types of errors which they made in solving the mathematical problems and to look for the proper instructional program to prevent or minimize those ones. On the basis of the result of the above examination, it suggests a classification model for teaching-learning methods and teaching material development The result of this study is as follows. First, Students didn't fully understand the fundamental concept of function and they had tendency to approach the mathematical problems relying on their memory. Second, students got accustomed to conventional math problems too much, so they couldn't distinguish new types of mathematical problems from them sometimes and did faulty reasoning in the problem solving process. Finally, it was very common for students to make errors on calculation and to make technical errors in recognizing mathematical symbols in the problem solving process. When students fully understood the mathematical concepts including a definition of function and learned procedural knowledge of them by themselves, they did not repeat the same errors. Also, explaining the functional concept with a graph related to the function did facilitate their understanding,

• Journal of KIISE:Software and Applications
• /
• v.33 no.9
• /
• pp.776-786
• /
• 2006

This paper proposes XML based mobile information visualization system using rectangle layout to show effectively XML based information to user on mobile devices which do not have a rich display feature. We define XML schema that can describes information in graph with cycle as well as information in tree form. It suggests using rectangle layout method that is an improvement of the traditional method of the radial layout because the specificity of the mobile display should be considered when XML information is rendered on the screen. And then, it applies DOI of fisheye view algorithm to information on the rectangle layout to represent all and user interest information. And it also suggests an effective method considering capability of mobile devices to decrease user's confusion and improve awareness of user when a user Interest target selected. The proposed information visualization system in the form of focus+context supports an effective interface for information retrieval via mobile devices, such as PDA, cellular phone and smart phone, that usually have less power of CPU than that of PC and the constraints of display and memory. In this paper, it performs experiments and makes an evaluation comparing information visualization method between the traditional radial layout and the proposed rectangle layout.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.75-81
• /
• 2010

The segmentation of cartilage is crucial for the diagnose and treatment of osteoarthritis (OA), and has mostly been done manually by an expert, requiring a considerable amount of time and effort due to the thin shape and vague boundaries of the cartilage in MR (magnetic resonance) images. In this paper, we propose a fully automatic method to segment cartilage in a knee joint on MR images. The proposed method is based on a small number of manually segmented images as the training set and comprised of an initial per patch segmentation process and a global refinement process on the cumulative per patch results. Each patch for per patch segmentation is positioned by classifying the bone-cartilage interface on the pre-segmented bone surface. Next, the shape and intensity priors are constructed for each patch based on information extracted from reference patches in the training set. The ratio of influence between the shape and intensity priors is adaptively determined per patch. Each patch is segmented by graph cuts, where energy is defined based on constructed priors. Finally, global refinement is conducted on the global cartilage using the results of per patch segmentation as the shape prior. Experimental evaluation shows that the proposed framework provide accurate and clinically useful segmentation results.