• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.5
• /
• pp.80-87
• /
• 2003

Network reconfiguration in distribution systems is realized by changing the status of sectiona1izing switches, and is usually done for loss minimization or load balancing in the system This parer presents an approach for loss minization in distribution systems using reactive tabu search. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. Reactive tabu search can give convergence property by using reaction and escape mechanism. Therefore, it can find global optimal solution regardless of initial system configuration. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the 32 bus system models.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.421-428
• /
• 2006

This paper proposes an integrated recovery approach applying retry and rollback techniques to recover the TMR failure. Combining the time redundancy techniques with W system is apparently effective to recover the TMR failure(or masked error) primarily caused by transient faults. These policies need fewer reconfigurations at the cost of extra time required for the time redundant schemes. The optimal numbers of retry and rollback to minimize the mean execution time of tasks are derived for the proposed method through computing the likelihoods of all possible states of the failed system. The effectiveness of the proposed method is validated through examining certain numerical examples and simulations conducted with a variety of parameters governing environmental characteristics.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.36-38
• /
• 2004

This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a recokiguration in distribution system. In parallel hybrid CA-TS, after CA operations, stings which are not emerged in the past population are selected in the reproduction procedure. After reproduction operation, if there are many strings which are in the past population, we add new random strings into the population, if there's no improvement for the predetermined iteration, local search procedure is executed by TS for the strings with high fitness function value. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution system in the reference paper.

• 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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.512-522
• /
• 2003

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Typically, the size of the chip required to implement the circuit depends on both the maximum number of the LUT blocks required to implement the function of each subcircuit and the maximum number of micro-registers to store results over context switches in the same time. Therefore, many partitioning or synthesis methods try to minimize these two factors. In this paper, we present a new estimation technique to find the lower bound on the number of micro-registers which can be obtained by any synthesis methods, respectively, without performing any actual synthesis and/or design space exploration. The lower bound estimation is very important in sense that it greatly helps to evaluate the results of the previous work and even the future work. If the estimated lower bound exactly matches the actual number in the actual design result, we can say that the result is guaranteed to be optimal. In contrast, if they do not match, the following two cases are expected: we might estimate a better (more exact) lower bound or we find a new synthesis result better than those of the previous work. Our experimental results show that there are some differences between the numbers of micro-registers and our estimated lower bounds. One reason for these differences seems that our estimation tries to estimate the result with the minimum micro-registers among all the possible candidates, regardless of usage of other resources such as LUTs, while the previous work takes into account both LUTs and micro-registers. In addition, it implies that our method may have some limitation on exact estimation due to the complexity of the problem itself in sense that it is much more complicated than LUT estimation and thus needs more improvement, and/or there may exist some other synthesis results better than those of the previous work.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.3
• /
• pp.206-215
• /
• 2005

In this paper, we propose a new design method of Genetic Algorithm Processor(GAP) and Evolvable Hardware(EHW). All sorts of creature evolve its structure or shape in order to adapt itself to environments. Evolutionary Computation based on the process of natural selection not only searches the quasi-optimal solution through the evolution process, but also changes the structure to get best results. On the other hand, Genetic Algorithm(GA) is good fur finding solutions of complex optimization problems. However, it has a major drawback, which is its slow execution speed when is implemented in software of a conventional computer. Parallel processing has been one approach to overcome the speed problem of GA. In a point of view of GA, long bit string length caused the system of GA to spend much time that clear up the problem. Evolvable Hardware refers to the automation of electronic circuit design through artificial evolution, and is currently increased with the interested topic in a research domain and an engineering methodology. The studies of EHW generally use the XC6200 of Xilinx. The structure of XC6200 can configure with gate unit. Each unit has connected up, down, right and left cell. But the products can't use because had sterilized. So this paper uses Vertex-E (XCV2000E). The cell of FPGA is made up of Configuration Logic Block (CLB) and can't reconfigure with gate unit. This paper uses Vertex-E is composed of the component as cell of XC6200 cell in VertexE

• The Korean Journal of Nuclear Medicine Technology
• /
• v.15 no.1
• /
• pp.17-24
• /
• 2011

Purpose: Presently in the nuclear medicine field, the high-speed image reconstruction algorithm like the OSEM algorithm is widely used as the alternative of the filtered back projection method due to the rapid development and application of the digital computer. There is no to relate and if it applies the optimal parameter be clearly determined. In this research, the quality change of the Jaszczak phantom experiment and brain SPECT patient data according to the iteration times and subset number change try to be been put through and analyzed in 3D OSEM reconstruction method of applying 3D beam modeling. Materials and Methods: Patient data from August, 2010 studied and analyzed against 5 patients implementing the brain SPECT until september, 2010 in the nuclear medicine department of ASAN medical center. The phantom image used the mixed Jaszczak phantom equally and obtained the water and 99mTc (500 MBq) in the dual head gamma camera Symbia T2 of Siemens. When reconstructing each image altogether with patient data and phantom data, we changed iteration number as 1, 4, 8, 12, 24 and 30 times and subset number as 2, 4, 8, 16 and 32 times. We reconstructed in reconstructed each image, the variation coefficient for guessing about noise of images and image contrast, FWHM were produced and compared. Results: In patients and phantom experiment data, a contrast and spatial resolution of an image showed the tendency to increase linearly altogether according to the increment of the iteration times and subset number but the variation coefficient did not show the tendency to be improved according to the increase of two parameters. In the comparison according to the scan time, the image contrast and FWHM showed altogether the result of being linearly improved according to the iteration times and subset number increase in projection per 10, 20 and 30 second image but the variation coefficient did not show the tendency to be improved. Conclusion: The linear relationship of the image contrast improved in 3D OSEM reconstruction method image of applying 3D beam modeling through this experiment like the existing 1D and 2D OSEM reconfiguration method according to the iteration times and subset number increase could be confirmed. However, this is simple phantom experiment and the result of obtaining by the some patients limited range and the various variables can be existed. So for generalizing this based on this results of this experiment, there is the excessiveness and the evaluation about 3D OSEM reconfiguration method should be additionally made through experiments after this.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.9
• /
• pp.56-65
• /
• 2005

A dynamic analysis method that freezes a time domain by discretization and solves the spatial propagation equation has a unique feature that provides a degree of freedom on spatial domain compared with the space discretization or space-time discretization finite element method. Using this feature, the time finite element analysis can be effectively applied to optimize the spatial characteristics of distributed type actuators. In this research, the time domain finite element method was used to discretize the model. A state variable vector was used in the discretization to include arbitrary initial conditions. A performance index was proposed on spatial domain to consider both potential and vibrational energy, so that the resulting shape of the distributed actuator was optimized for dynamic control of the structure. It is assumed that the structure satisfies the final rest condition using the realizable control scheme although the initial disturbance can affect the system response. Both equations on states and costates were derived based on the selected performance index and structural model. Ricatti matrix differential equations on state and costate variables were derived by the reconfiguration of the sub-matrices and application of time/space boundary conditions, and finally optimal actuator distribution was obtained. Numerical simulation results validated the proposed actuator shape optimization scheme.