• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.254-257
• /
• 1993

This paper presents a new method to implement Hebbian learning method on artificial neural network. In hebbian learning algorithm, complexity in terms of multiplications is high. To save the chip area, we consider a new learning circuit. By calculating similarity, or correlation between $X_i$ and $O_i$, large portion of circuits commonly used in conventional neural networks is not necessary for this new hebbian learning circuit named COR. The output signals of COR is applied to weight storage capacitors for direct control the voltages of the capacitors. The weighted sum, ${\Sigma}W_{ij}O_j$, is realized by multipliers, whose output currents are summed up in one line which goes to learning circuit or output circuit. The drain current of the multiplier can produce positive or negative synaptic weights. The pass transistor selects eight learning mode or recall mode. The layout of an learnable six-neuron fully connected Hopfield neural network is designed, and is simulated using PSPICE. The network memorizes, and retrieves the patterns correctly under the existence of minor noises.

• The Mathematical Education
• /
• v.51 no.4
• /
• pp.455-469
• /
• 2012

Given the importance of mathematical connections in instruction, this paper analyzed the objects and the methods of mathematical connections according to the lesson flow featured in 20 elementary lessons selected as effective instructional methods by local educational offices in Korea. Mathematical connections tended to occur mainly in the introduction, the first activity, and the sum-up period of each lesson. The connection between mathematical concept and procedure was the most popular followed by the connection between concept and real-life context. The most prevalent method of mathematical connections was through communication, specifically the communication between the teacher and students, followed by representation. Overall it seems that the objects and the methods of mathematical connections were diverse and prevalent, but the detailed analysis of such cases showed the lack of meaningful connection. These results urge us to investigate reasons behind these seemingly good features but not-enough connections, and to suggest implications for well-connected mathematics teaching.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.26 no.1
• /
• pp.25-31
• /
• 2021

This paper describes the design of a power cell-based pulsed power modulator with fast rise times. The pulse-generating section of the pulse power modulator is a series stack of power cells. Each power cell is composed of a storage capacitor, a pulse switch, and a bypass diode. When the pulse switches are turned on, the capacitors are connected in series and the sum of voltages is applied to the load. For output pulses with fast rise times, an IGBT with fast turn-on characteristics is adopted as a pulse switch and the optimized gate driving method is used. Pspice simulation is performed to account for the gate driving method. A 10 kV, 12-power cell-based pulsed power modulator is tested under resistive load and plasma reactor load. The rise times of output pulses less than 20 ns are confirmed, showing that the pulsed power modulator can be effectively applied to pulsed power applications with fast rise times.

• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.90-95
• /
• 2022

This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings.

• Journal of Biomedical Engineering Research
• /
• v.39 no.5
• /
• pp.220-228
• /
• 2018

The internal resistance of microbial fuel cell (MFC) using stainless steel skein for oxidizing electrode was investigated and the factors affecting the voltage generation were identified. We also investigated the effect of power management system (PMS) on the usability for MFC and the removal efficiency of organic pollutants. The performance of a stack microbial fuel cell connected with (PMS) or PMS+LED was analyzed by the voltage generation and organic matter reduction. The maximum power density of the unit cells was found to be $5.82W/m^3$ at $200{\Omega}$. The maximum current density was $47.53A/m^3$ without power overshoot even under $1{\Omega}$. The ohmic resistance ($R_s$) and the charge transfer resistance ($R_{ct}$) of the oxidation electrode using stainless steel skein electrode, were $0.56{\Omega}$ and $0.02{\Omega}$, respectively. However, the sum of internal resistance for reduction electrode using graphite felts loaded Pt/C catalyst was $6.64{\Omega}$. Also, in order to understand the internal resistance, the current interruption method was used by changing the external resistance as $50{\Omega}$, $300{\Omega}$, $5k{\Omega}$. It has been shown that the ohm resistance ($R_s$) decreased with the external resistance. In the case of a series-connected microbial fuel cell, the reversal phenomenon occurred even though two cells having the similar performance. However, the output of the PMS constantly remained for 20 hours even when voltage reversal occurred. Also the removal ability of organic pollutants (SCOD) was not reduced. As a result of this study, it was found that buffering effect for a certain period of time when the voltage reversal occurred during the operation of the microbial fuel cell did not have a serious effect on the energy loss or the operation of the microbial fuel cell.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.165-173
• /
• 2012

Given a connected, weighted, and undirected graph, the Minimum Spanning Tree (MST) should have minimum sum of weights, connected all vertices, and without any cycle taking place. Borůvka Algorithm is firstly suggested as an algorithm to evaluate the MST, but it is not widely used rather than Prim and Kruskal algorithms. Borůvka algorithm selects the Minimum Weight Edge (MWE) from each vertex with distinct weights in $1^{st}$ stage, and selects the MWE from each MSF (Minimum Spanning Forest) in $2^{nd}$ stage. But the cycle check and the number of MSF in $1^{st}$ stage and $2^{nd}$ stage are difficult to implication by computer program even if it is easy to verify visually. This paper suggests the generalized Borůvka Algorithm, This algorithm selects all of the same MWEs for each vertex, then checks the cycle and constructs MSF for ascending sorted MWEs. Kruskal method bring into this process. if the number of MSF greats then 1, this algorithm selects MWE from ascending sorted inter-MSF edges. The generalized Borůvka algorithm is verified its application by being applied to the 7 graphs with the many minimum weights or distinct weight edges for any vertex. As a result, the generalized Borůvka algorithm is less required for cycle verification then the Kruskal algorithm. Therefore, the generalized Borůvka algorithm is more fast to obtain MST then Kruskal algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.10
• /
• pp.930-936
• /
• 2014

Smart Multiple-Tap to be introduced in this paper, is an electronic device that controls the Multibple-Tap through the Smartphone. It runs on network and has an inbuilt Zigbee communication module. Thus, users can control home devices from remote through home server. Mentioned home server is operated as a gateway and is connected with smart devices on the Internet. To sum up, Users using this Smart Multiple-Tap can check the state information of the multi-tap ON/OFF and can control immediately by smartphone. also, Smart Multiple-Tap perfectly shut down the standby power. when users turn off each of the Smart Multiple-Tap's circle, It drives automatically lowest electricity-consuming mode and shut down the standby power by its own built-in SSR module. therefore, it will bring the energy saving effect on environment using Smart Multiple-Tap.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.723-729
• /
• 2014

In this paper, we derive the average repair bandwidth and/or read cost for arbitrary repairable linear code ensembles. The repair bandwidth and read cost are the required amount of data and access number of nodes to restore a failed node, respectively. Here, the repairable linear code ensemble is given by such parameters as the number k of data symbols, the number m of parity symbols, and their degree distributions. We further assume that the code is systematic, and no other constraint is assumed, except possibly that the exact repair could be done by the parity check-sum relation with fully connected n=k+m storages. This enables one to apply the result of this paper directly to any randomly constructed codes with the above parameters, such as linear fountain codes. The final expression of the average repair read cost shows that it is highly dependent on the degree distribution of parity symbols, and also the values n and k.

• Journal of Soil and Groundwater Environment
• /
• v.20 no.7
• /
• pp.43-52
• /
• 2015

The uranium removal capacity of radish sprouts (Raphanus sativus L.) in groundwater was calculated on the basis of the amount of uranium accumulated in the radish sprouts rather than the concentration in solution, of which process was very limited in previous studies. Continuous rhizofiltration clean-up system was designed to investigate the feasibility of radish sprouts, applying for uranium contaminated groundwater (U concentration: 110 μg/L) taken at Bugogdong, Busan. Six acrylic boxes (10 cm × 30 cm × 10 cm) were connected in a direct series for the continuous rhizofiltration system and 200 g of radish sprouts cultivars was placed in each box. The groundwater was flushed through the system for 48 hours at the constant rate of 5 mL/min. The rhizofiltration system was operated in the phytotron, of which conditions were at 25℃ temperature, 70% of relative humidity, 4,000 Lux illumination (16 hours/day) and 600 mg/L of CO₂ concentration. While 14.4 L of contaminated groundwater was treated, the uranium removal efficiency of the radish sprouts (1,200 g in wet weight) was 77.2% and their removal capacities ranged at 152.1 μg/g-239.7 μg/g (the average: 210.8 μg/g), suggesting that the radish sprouts belong to the group of hyper-accumulation species. After the experiment, the sum of U amounts accumulated in radish sprouts and remained in groundwater was 1,472.2 μg and the uranium recovery ratio of this rhizofiltration experiment was 92.9%. From the results, it was investigated that the radish sprouts can remove large amounts of uranium from contaminated groundwater in a short time (few days) because the fast growth rate and the high U accumulation adsorption capacity.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.4
• /
• pp.65-73
• /
• 1997

This paper proposes a new method of the structure pruning of dynamic recurrent neural networks (DRNN) using evolutionary computations. In general, evolutionary computations are population-based search methods, therefore it is very useful when several different properties of neural networks need to be optimized. In order to prune the structure of the DRNN in this paper, we used the evolutionary programming that searches the structure and weight of the DRNN and evolution strategies which train the weight of neuron and pruned the net structure. An addition or elimination of the hidden-layer's node of the DRNN is decided by mutation probability. Its strategy is as follows, the node which has mhnimum sum of input weights is eliminated and a node is added by predesignated probability function. In this case, the weight is connected to the other nodes according to the probability in all cases which can in- 11:ract to the other nodes. The proposed pruning scheme is exemplified on the stabilization and position control of the inverted-pendulum system and visual servoing of a robot manipulator and the effc: ctiveness of the proposed method is demonstrated by numerical simulations.