• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.5
• /
• pp.79-89
• /
• 1984

In this paper we present development of microprocessor-based 8-channel statistical multiplexer (SMUX). The hardware design includes one Z-80A CPU board with the clock rate of 4 MHz, one 16 Kbyte ROM board for program storage, one 16 Kbyte dynamic RAM board and three I/O boards, all connected through an S-100 compatible tristate bus. The SMUX can presently multiplex 8 channels with data rates ranging 50 bps to 9600 bps, but can be reduced to accommodate 4 channels by having a slight modification of software and removing one terminal I/O board. The system specifications meet CCITT recommendations X.25 link level, V.24, V.28, X.3 and X.28. Significant features of the SMUX are its capability of handling 4 input codes (ASCII, EBCDIC, Baudot, Transcode), the use of a dynamic buffer management algorithm, a diagnostic facility, and the efficient use of a single CPU for all system operation. Throughout the paper, detailed explanations are given as to how the hardware and software of the SMUX system have been designed efficiently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.429-434
• /
• 2017

In a graph G=(V, E) with n vertices, there is an unique box which is finally laid on each vertex. Thus each vertex and box is both numbered from 1 to n and the box i should be laid on the vertex i. But, the box ${\pi}$(i) is initially located on the vertex i according to a permutation ${\pi}$. In each step, the robot can walk along an edge of G and can carry at most one box at a time. Also when arriving at a vertex, the robot can swap the box placed there with the box it is carrying. The problem is to minimize the total step so that every vertex has its own box, that is, the shuffled boxes are sorted. In this paper, we shall find an upper bound of the minimum number of steps and show that the movement of the robot is found in $O(n^2)$ time when G is a cycle.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.10 no.2
• /
• pp.138-147
• /
• 2005

This paper presents a SPMSM(Surface-mounted Permanent Magnet Synchronous Motor) servo drive system using high performance TMS320F2812 DSP for the industrial application. The DSP(Digital Signal Processor) Controller enables an enhanced real time algorithm and cost-effective design intelligent for only exclusively motor drives which can be yield enhanced operation, fewer system components, lower control system cost, increased efficiency and high performance. The suggested system contain speed and current sensing circuits, SVPWM(Space Vector Pulse Width Modulation) and I/O interface circuit. The developed servo drive control system showns a good response characteristics results and high performance features in general purposed 400[w] machine. This system can achieve cost reduction and size minimization of controllers.

• Proceedings of the Korean Institute of Resources Recycling Conference
• /
• 2005.05a
• /
• pp.57-61
• /
• 2005

In this study, the machine vision system for inspection using color recognition method have been designed and developed to automatically sort out a specified material such as Cu scraps or other non-ferrous metal scraps mixed in Fe scraps. The system consists of a CCD camera, light sources, a frame grabber, conveying devices and an air nozzled ejector, and is program-controlled by a image processing algorithm. The ejector is designed to be operated by an I/O interface communication with a hardware controller. The sorting examination results show that the efficiency of separating Cu scraps from the Fe scraps mixed with Cu scraps is around 90 % at the conveying speed of 15 m/min. and the system is proven to be excellent in terms of its efficiency. Therefore, it is expected that the system can be commercialized in shredder firms, if the high-speed automated sorting system will be realized.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.327-332
• /
• 2007

In this paper, we will analysis embedding between $2^{2n-k}{\times}2^k$ torus and interconnection networks HFN(n,n), HCN(n,n). First, we will prove that $2^{2n-k}{\times}2^k$ torus can be embedded into HFN(n,n) with dilation 3, congestion 4 and the average dilation is less than 2. And we will show that $2^{2n-k}{\times}2^k$ torus can be embedded into HCN(n,n) with dilation 3 and the average dilation is less than 2. Also, we will prove that interconnection networks HFN(n,n) and HCN(n,n) can be embedded into $2^{2n-k}{\times}2^k$ torus with dilation O(n). These results mean so many developed algorithms in torus can be used efficiently in HFN(n,n) and HCN(n,n).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1056-1063
• /
• 2008

This paper describes an efficient design of a multi-standard Viterbi decoder that supports multiple constraint lengths and code rates. The Viterbi decoder is parameterized for the code rates 1/2, 1/3 and constraint lengths 7,9, thus it has four operation nodes. In order to achieve low hardware complexity and low power, an efficient architecture based on hardware sharing techniques is devised. Also, the optimization of ACCS (Accumulate-Subtract) circuit for the one-point trace-back algorithm reduces its area by about 35% compared to the full parallel ACCS circuit. The parameterized Viterbi decoder core has 79,818 gates and 25,600 bits memory, and the estimated throughput is about 105 Mbps at 70 MHz clock frequency. Also, the simulation results for BER (Bit Error Rate) performance show that the Viterbi decoder has BER of $10^{-4}$ at $E_b/N_o$ of 3.6 dB when it operates with code rate 1/3 and constraints 7.

• Computers and Concrete
• /
• v.27 no.4
• /
• pp.319-332
• /
• 2021

The performance of gene expression programming (GEP) in predicting the compressive strength of bacteria-incorporated geopolymer concrete (GPC) was examined in this study. Ground-granulated blast-furnace slag (GGBS), new bacterial strains, fly ash (FA), silica fume (SF), metakaolin (MK), and manufactured sand were used as ingredients in the concrete mixture. For the geopolymer preparation, an 8 M sodium hydroxide (NaOH) solution was used, and the ambient curing temperature (28℃) was maintained for all mixtures. The ratio of sodium silicate (Na2SiO3) to NaOH was 2.33, and the ratio of alkaline liquid to binder was 0.35. Based on experimental data collected from the literature, an evolutionary-based algorithm (GEP) was proposed to develop new predictive models for estimating the compressive strength of GPC containing bacteria. Data were classified into training and testing sets to obtain a closed-form solution using GEP. Independent variables for the model were the constituent materials of GPC, such as FA, MK, SF, and Bacillus bacteria. A total of six GEP formulations were developed for predicting the compressive strength of bacteria-incorporated GPC obtained at 1, 3, 7, 28, 56, and 90 days of curing. 80% and 20% of the data were used for training and testing the models, respectively. R2 values in the range of 0.9747 and 0.9950 (including train and test dataset) were obtained for the concrete samples, which showed that GEP can be used to predict the compressive strength of GPC containing bacteria with minimal error. Moreover, the GEP models were in good agreement with the experimental datasets and were robust and reliable. The models developed could serve as a tool for concrete constructors using geopolymers within the framework of this research.

• Journal of Cadastre & Land InformatiX
• /
• v.51 no.2
• /
• pp.141-150
• /
• 2021

Fine dust is a substance that greatly affects human health, and various studies have been conducted in this regard. Due to the human influence of particulate matter, various studies are being conducted to predict particulate matter grade using past data measured in the monitoring network of Seoul city. In this paper, predictive model have focused on particulate matter concentration in May, 2019, Seoul. The air pollutant variables were used to training such as SO₂, CO, NO₂, O₃. The predictive model based on Adaboost, and training model was dividing PM₁₀ and PM_2.5. As a result of the prediction performance comparison through confusion matrix, the Adaboost model was more conformable for predicting the particulate matter concentration grade. Although air pollutant variables have a higher correlation with PM2.5, training model need to train a lot of data and to use additional variables such as traffic volume to predict more effective PM₁₀ and PM_2.5 distribution grade.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.20 no.7
• /
• pp.2386-2396
• /
• 1996

A numerical simulation has been performed for isothermal and reacting flows in an exisymmetric, bluff-body research combustor. The present formulation is based on the density-weighted averaged Navier-Stokes equations together with a k-epsilon. turbulence model and a modified eddy-breakup combustion model. The PISO algorithm is employed for solution of thel Navier-Stokes system. Comparison between measurements and predictions are made for a centerline axial velocities, location of stagnation points, strength of recirculation zone, and temperature profile. Even though the numerical simulation gives acceptable agreement with experimental data in many respects, the present model is defictient in predicting the recoveryt rate of a central near-wake region, the non-isotropic turbulence effects, and variation of turbulent Schmidt number. Several possible explanations for these discrepancies have been discussed.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.