• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.26-35
• /
• 1997

In this paper, a VHDL implementation method for the internet protocol (IP) placed on top of ATM, so called IP over ATM, is presented. The proposed implementation method employs a parallel processing architecture to reduce the processing time and offers 155.52Mbps (STM-1) interface with the full-duplex mode for the ATM-based network. Furthermore, in order to minimize the search time for the table look-up, a LANCAM-based structure combining the routing table with the ATMARP table is proposed. The VHDL simulation results show that this proposed method can transmit (receive) at 155.52Mbps with delays of 48.5 clocks (29.5clocks).

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.488-491
• /
• 1988

In this work, we developed a real-time versatile advanced control and supervisory software for a personal computer control. This software, basically, has background and foreground tasks which are performed in parallel at real time. First, background tasks are composed of controls of various kinds, reports and input-ouput of signals etc, which are performed every sampling time. Second, foreground tasks are observation of operation conditions, data search, regulation of controllers and graphical design and display of processes, which are performed by users request. Additionally, this software has the functions of transporting data and composing distributed control systems, and all background tasks are composed of combination of unit function blocks.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1133-1138
• /
• 2006

This paper considers a hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. The hybrid flow shop consists of two stages in series, each of which has multiple identical parallel machines, and the problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also derived to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.683-686
• /
• 2000

A new approach to the task of aligning a robot using camera is presented in this paper. We apply an elitist GA to find the joints angles of manipulator to reach target position instead of using nonlinear least error method. Since it employs parallel search and have good performance in solving optimization problems. In order to improve convergence speed, the floating coding method and geometry constraint conditions are used. Experiments are carried out to exhibit the effectiveness of vision-based control using elitist genetic algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.213-220
• /
• 2007

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• Journal of Internet Computing and Services
• /
• v.3 no.3
• /
• pp.31-38
• /
• 2002

A method of DID generating step is suggested for applying the XML technology to the information data extracted from the Legacy databases. The IDREF-ID attribute reference modeling is used for representing the complex relationship between tables and excluding the prearranged step of ID insertion. ID Insertion procedure is performed in parallel with investigating the relationship between the tables and the frequent search direction between the table data. As a result, ID insertion procedure can be performed simultaneously with understanding of the IDREF-ID relationship between tables, and DID are also generated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.2879-2890
• /
• 2020

In this paper, we study the estimation of angle, range and polarization parameters of a bistatic polarization sensitive frequency diverse array multiple-input multiple-output (PSFDA-MIMO) radar system. The application of polarization sensitive array in receiver is explored. A signal model of bistatic PSFDA-MIMO radar system is established. In order to utilize the multi-dimensional structure of array signals, the matched filtering radar data can be represented by a third-order tensor model. A joint estimation of the direction-of-departure (DOD), direction-of-arrival (DOA), range and polarization parameters based on parallel factor (PARAFAC) algorithm is proposed. The proposed algorithm does not need to search spectral peaks and singular value decomposition, and can obtain automatic pairing estimation. The method was compared with the existing methods, and the results show that the performance of the method is better. Therefore, the accuracy of the parameter estimation is further improved.

• Journal of Korea Game Society
• /
• v.20 no.5
• /
• pp.89-98
• /
• 2020

In MMO game servers, NUMA (Non-Uniform Memory Access) architecture is generally used to achieve high performance. Furthermore, such servers normally use hash tables as internal data structure which have constant time complexity for insert, delete, and search operations. In this study, we proposed a concurrent hash table optimized for NUMA system to make MMO game servers improve their performance. We tested our hash table on 4 socket NUMA system, and the hash table shows at most 100% speedup over another high-performance hash table.

• Lingua Humanitatis
• /
• v.1 no.1
• /
• pp.295-321
• /
• 2001

This paper attempts to demonstrate how the linguistic and mythological features of the shamanic language make it incantatory, or ′enchanting′. Passages used in shamanic rites manifest linguistic characteristics that point to their own norms and conventions, as well as some mythological features that contribute to the undecipherablity of the shamanic language. Focusing on the estranged linguistic and mythological features, I propose that shamanic languages can be best interpreted in terms of the linguistic hierarchization, a notion that has been developed since Roman Jakobson′s poetics. The present study adopts Eisele′s framework that reinterprets Jakobsonian hierarchization into a slightly revised notion on the basis of the "degree of combinatorial freedom" and the "degree of semantic immediacy", looking into a set of paradigm examples in search of some parallel structures characterizing the shamanic language. The enchanting effect of this peculiar form of language, it is argued, is due mostly to the frequent use of lexical parallelism, which works in the reverse direction of the normal process of interpretation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.1-15
• /
• 2003

This paper presents a new evolutionary algorithm to solve complex multi-level integration problems, which is called multi-level symbiotic evolutionary algorithm (MEA). The MEA uses an efficient feedback mechanism to flow evolution information between and within levels, to enhance parallel search capability, and to improve convergence speed and population diversity. To show the MEA's applicability, It is applied to the integrated planning of production and distribution in supply chain management. The encoding and decoding methods are devised for the integrated problem. A set of experiments has been carried out, and the results are reported. The superiority of the algorithm's performance is demonstrated through experiments.