• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2004.07b
• /
• pp.1092-1095
• /
• 2004

The $ZnGa_2O_4$ phosphor target is synthesized through solid-state reactions as calcine and sintering temperature in order to deposit $ZnGa_2O_4$ phosphor thin film by rf magnetron sputtering system. The $ZnGa_2O_4$ phosphor thin film is deposited on $Pt/Ti/SiO_2/Si$ substrate and prepared $ZnGa_2O_4$ Phosphor thin film is annealed by rapid thermal processor(RTP) at $750^{\circ}C$, 10 sec. The x-ray diffraction patterns of $ZnGa_2O_4$ phosphor target and thin film show the position of (311) main peak. The cathodolumincsccnce(CL) succtrums of $ZnGa_2O_4$ phosphor target show main peak of 360nm and broad bandwidth of about 180nm.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.199-202
• /
• 1996

In this paper, we suggested the combination of HMM(Hidden Markov Model) and MLP (Multi-Layer Perceptron) with GA(genetic algorithm) for a recognition of EMG signals. To describe EMG signal's dynamic properties, HMM algorithm was adapted and due to its outstanding abilities in static signal classification MLP was connected as a real processor. We also used GA( Genetic Algorithm) for improving MLP's learning rate. Experimental results showed that the suggested classifier gave higher EMG signal recognition rates with faster learning time than other one.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.8
• /
• pp.746-753
• /
• 2001

In this paper, we review the basic concept of Evolvable Hardware first. And we examine genetic algorithm processor and hardware reconfiguration method and implementation. By considering complexity and performance of hardware at the same time, we design genetic algorithm processor using modularization and parallel processing method. And we design frame that has connection structure and logic block on FPGA, and embody reconfigurable hardware that do so that this frame may be reconstructed by RAM. Also we implemented ECANS that information processing system such as living creatures'brain using this hardware reconfiguration method. And we apply ECANS which is implemented using the concept of Evolvable Hardware to time-series prediction problem in order to verify the effectiveness.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.166-169
• /
• 1997

For parallel processing, the compiler partitions a loaded program into a set of tasks and makes a schedule for the tasks that will minimize parallel processing time for the loaded program. Building an optimal schedule for a given set of partitioned tasks of a program has known to be NP-complete. In this paper we introduce a GA(Genetic Algorithm)-based scheduling method in which a chromosome consists of two parts of a string which decide the number and order of tasks on each processor. An additional computation is used for feasibility constraint in the chromosome. By granularity theory, a partitioned program is categorized into coarse-grain or fine-grain types. There exist good heuristic algorithms for coarse-grain type partitioning. We suggested another GA adaptive to the coarse-grain type partitioning. The infeasibility of chromosome is overcome by the encoding and operators. The number of processors are decided while the GA find the minimum parallel processing time.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.18 no.2
• /
• pp.187-191
• /
• 2005

A ZnGa$_2$O$_4$ phosphor target was synthesized through solid-state reactions at a calcine temperature of 700 $^{\circ}C$ and sintering temperature of 1300 $^{\circ}C$ in order to deposit ZnGa$_2$O$_4$ phosphor thin film at various temperature using rf magnetron sputtering system. A ZnGa$_2$O$_4$ phosphor thin film was deposited on Si(100) substrate and annealed by a rapid thermal processor(RTP) at 700 $^{\circ}C$, for 15 sec. The x-ray diffraction patterns of ZnGa$_2$O$_4$ phosphor target and thin film showed the main peak (311) direction. ZnGa$_2$O$_4$ thin film has better crystalization due to as function of increasing substrate and annealing temperature. The cathodoluminescence(CL) spectrums of ZnGa$_2$O$_4$ phosphor thin film showed the main peak 420 nm wavelength and the maximum intensity at the substrate temperature of 500 $^{\circ}C$ and annealing temperature of 700 $^{\circ}C$, for 15 sec.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.135-140
• /
• 2020

Recently, due to the rapid diffusion of intelligent systems and IoT technologies, power saving techniques in real-time embedded systems has become important. In this paper, we propose P-GA (Parallel Genetic Algorithm), a scheduling algorithm aims at reducing the power consumption of real-time systems in multi-core hybrid memory environments. P-GA improves the Proportional-Fairness (PF) algorithm devised for multi-core environments by combining the dynamic voltage/frequency scaling of the processor with the nonvolatile memory technologies. Specifically, P-GA applies genetic algorithms for optimizing the voltage and frequency modes of processors and the memory types, thereby minimizing the power consumptions of the task set. Simulation experiments show that the power consumption of P-GA is reduced by 2.85 times compared to the conventional schemes.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.8
• /
• pp.375-387
• /
• 2005

This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.10
• /
• pp.556-564
• /
• 2004

This paper presents an application of parallel Genetic Algorithm-Tabu Search(GA-TS) algorithm to search an optimal solution of a reconfiguration in distribution system. The aim of the reconfiguration of distribution systems is to determine switch position to be opened for loss minimization in the radial distribution systems, which is a discrete optimization problem. This problem has many constraints and very difficult to solve the optimal switch position because it has many local minima. This paper develops parallel GA-TS algorithm for reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10% of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node aster predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium Ⅳ CPU and is connected with others through ethernet switch based fast ethernet. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution systems in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution qualify. speedup. efficiency and computation time.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.2
• /
• pp.116-124
• /
• 2005

This paper presents an application of the parallel Genetic Algorithm-Tabu Search (GA- TS) algorithm, and that is to search for an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration of distribution systems is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to solve the optimal switch position because of its numerous local minima. This paper develops a parallel GA- TS algorithm for the reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10$\%$ of the population to enhance the local searching capabilities. With migration operation, the best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based rapid Ethernet. To demonstrate the usefulness of the proposed method, the developed algorithm was tested and is compared to a distribution system in the reference paper From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution quality, speedup, efficiency, and computation time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1169-1172
• /
• 1996

A time-optimal control law for quick, strongly nonlinear systems has been developed and demonstrated. This procedure involves the utilization of neural networks as state feedback controllers that learn the time-optimal control actions by means of an iterative minimization of both the final time and the final state error for the known and unknown systems with constrained inputs and/or states. The nature of neural networks as a parallel processor would circumvent the problem of "curse of dimensionality". The control law has been demonstrated for a velocity input type motor identified by a genetic algorithm called GENOCOP.