• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.106-111
• /
• 2011

This paper presents an ASIP (Application-specific Instruction Processor) for motion estimation that employs specific IME instructions and its programmable and reconfigurable hardware architecture for various video codecs, such as H.264/AVC, MPEG4, etc. With the proposed specific instructions and hardware accelerator, it can handle the real-time processing requirement of High Definition (HD) video. With the parallel operations and SAD unit control using pattern information, the proposed IME instruction supports not only full search algorithm but also other fast search algorithms. The hardware size is 77K gates for each Processing Element Group (PEG) which has 256 SAD PEs. The proposed ASIP runs at 160MHz with sixteen PEGs and it can handle 1080p@30 frame in real time.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.9
• /
• pp.685-697
• /
• 2017

In this paper, it is presented the result of design and fabrication for C-band solid state high power amplifier unit and components using in search radar. The solid state power amplifier(SSPA) assembly was fabricated using GaN(Gallium Nitride), which is semiconductor device, and the transmit signal output power of the solid state high power amplifier unit is generated by combining the transmit signal power of the solid state power amplifier configured in parallel through a design and fabricated waveguide type transmit signal combine assembler. Designed solid state high power amplifier unit demonstrated C-band 500 MHz bandwidth, maximum 10.5% duty cycle, transmit pulse width from $0.0{\mu}s{\sim}000{\mu}s$, and transmit signal power is 44.98 kW(76.53 dBm).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.635-637
• /
• 2013

This paper proposed a new hardware architecture for stereo matching in real time. We minimized the amount of calculation and the number of memory accesses through analyzing calculation of stereo matching. From this, we proposed a new stereo matching calculating cell and a new hardware architecture by expanding it in parallel, which concurrently calculates cost function for all pixels in a search range. After expanding it, we proposed a new hardware architecture to calculate cost function for 2-dimensional region. The implemented hardware can be operated with minimum 250Mhz clock frequence in FPGA environment, and has the performance of 813fps in case of the search range of 64 pixels and the image size of $640{\times}480$.

• Education of Primary School Mathematics
• /
• v.14 no.2
• /
• pp.117-134
• /
• 2011

The purpose of this research was to analyze mathematical task types to enhance creativity. Creativity is increasingly important in every field of disciplines and industries. To be excel in the 21st century, students need to have habits to think creatively in mathematics learning. The method of the research was to collect the previous research and papers concerning creativity and mathematics. To search the materials, the researcher used the search engines such as the GIL and the KISTI. The mathematical task types to enhance creativity were categorized 16 different types according to their forms and characteristics. The types of tasks include (1) requiring various strategies, (2) requiring preferences on strategies, (3) making word problems, (4) making parallel problems, (5) requiring transforming problems, (6) finding patterns and making generalization, (7) using open-ended problems, (8) asking intuition for final answers, (9) asking patterns and generalization (10) requiring role plays, (11) using literature, (12) using mathematical puzzles and games, (13) using various materials, (14) breaking patterned thinking, (15) integrating among disciplines, and (16) encouraging to change our lives. To enhance students' creativity in mathematics teaching and learning, the researcher recommended the followings: reshaping perspectives toward teaching and learning, developing and providing creativity-rich tasks, applying every day life, using open-ended tasks, using various types of tasks, having assessment ability, changing assessment system, and showing and doing creative thinking and behaviors of teachers and parents.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.10
• /
• pp.851-856
• /
• 2005

The DNA and protein data of diverse species have been daily discovered and deposited in the public archives according to each established format. Database systems in the public archives provide not only an easy-to-use, flexible interface to the public, but also in silico analysis tools of unidentified sequence data. Of such in silico analysis tools, multiple sequence alignment [1] methods relying on pairwise alignment and Smith-Waterman algorithm [2] enable us to identify unknown DNA, protein sequences or phylogenetic relation among several species. However, in the existing multiple alignment method as the number of sequences increases, the runtime increases exponentially. In order to remedy this problem, we adopted a parallel processing suffix tree algorithm that is able to search for common subsequences at one time without pairwise alignment. Also, the cross-matching subsequences triggering inexact-matching among the searched common subsequences might be produced. So, the cross-matching masking process was suggested in this paper. To identify the function of the clusters generated by suffix tree clustering, BLAST was combined with a clustering tool. Our clustering and annotating tool is summarized as the following steps: (1) construction of suffix tree; (2) masking of cross-matching pairs; (3) clustering of gene sequences and (4) annotating gene clusters by BLAST search. The system was successfully evaluated with 22 gene sequences in the pyrubate pathway of bacteria, clustering 7 clusters and finding out representative common subsequences of each cluster

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.387-393
• /
• 2004

DNA computing is technology that applies immense parallel castle of living body molecules into information processing technology, and has used to solve NP-complete problems. However, there are problems which do not look for solutions and take much time when only DNA computing technology solves NP-complete problems. In this paper we proposed an algorithm called ACO(Algorithm for Code Optimization) that can efficiently express DNA sequence and create good codes through composition and separation processes as many as the numbers of reaction by DNA coding method. Also, we applied ACO to Hamiltonian path problem of NP-complete problems. As a result, ACO could express DNA codes of variable lengths more efficiently than Adleman's DNA computing algorithm could. In addition, compared to Adleman's DNA computing algorithm, ACO could reduce search time and biological error rate by 50% and could search for accurate paths in a short time.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.429-436
• /
• 2005

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.

• Journal of Digital Convergence
• /
• v.17 no.8
• /
• pp.407-413
• /
• 2019

The purpose of this study is to measure the shopping experience of a more specific SNS shopping service, limited to shopping through the Instagram of the Millennial Generation. Based on the AISAS purchasing phase, a qualitative study was conducted on the user experience of SNS shopping services in parallel with the survey and in-depth interviews. As a result of the study, the aesthetic experience appeared mainly in the Attention stage and the Interest stage, the emotional experience in the Action stage and the Share stage, and the cognitive experience in the Search stage. While there have been many empirical studies on the impact of SNS on consumer behavior to date, this study is meaningful in that it has led to a contextual study of the user experience on SNS shopping services. The research is expected to help establish a brand and service strategy differentiated from existing mobile shopping services when providing SNS shopping services in the future.

• Journal of the Korean earth science society
• /
• v.44 no.6
• /
• pp.675-692
• /
• 2023

This study used a Chatbot, a generative artificial intelligence (AI), to analyze the interaction between the Chatbot and students when exploring critical minerals from an epistemological aspect. The results, issues to be kept in mind in the teaching and learning process using AI were discussed in terms of the role of the teacher, the goals of education, and the characteristics of knowledge. For this study, we conducted a three-session science education program using a Chatbot for 19 high school students and analyzed the reports written by the students. As a result, in terms of form, the students' questions included search-type questions and non-search-type questions, and in terms of content, in addition to various questions asking about the characteristics of the target, there were also questions requiring a judgment by combining various data. In general, students had a questioning strategy that distinguished what they should aim for and what they should avoid. The Chatbot's answer had a certain form and consisted of three parts: an introduction, a body, and a conclusion. In particular, the conclusion included commentary or opinions with opinions on the content, and in this, value judgments and the nature of science were revealed. The interaction between the Chatbot and the student was clearly evident in the process in which the student organized questions in response to the Chatbot's answers. Depending on whether they were based on the answer, independent or derived questions appeared, and depending on the direction of comprehensiveness and specificity, superordinate, subordinate, or parallel questions appeared. Students also responded to the chatbot's answers with questions that included critical thinking skills. Based on these results, we discovered that there are inherent limitations between Chatbots and students, unlike general classes where teachers and students interact. In other words, there is 'limited interaction' and the teacher's role to complement this was discussed, and the goals of learning using AI and the characteristics of the knowledge they provide were also discussed.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.1-10
• /
• 2014

In this paper, we propose MPI gridding algorithm of LiDAR data that minimizes the communication between the cores. The LiDAR data collected from aircraft is a 3D spatial information which is used in various applications. Since there are many cases where the LiDAR data has too high resolution than actually required or non-surface information is included in the data, filtering the raw LiDAR data is required. In order to use the filtered data, the interpolation using the data structure to search adjacent locations is conducted to reconstruct the data. Since the processing time of LiDAR data is directly proportional to the size of it, there have been many studies on the high performance parallel processing system using MPI. However, previously proposed methods in parallel approach possess possible performance degradations such as imbalanced data size among cores or communication overhead for resolving boundary condition inconsistency. We conduct empirical experiments to verify the effectiveness of our proposed algorithm. The results show that the total execution time of the proposed method decreased up to 4.2 times than that of the conventional method on heterogeneous clusters.