• Transactions on Electrical and Electronic Materials
• /
• v.7 no.4
• /
• pp.210-214
• /
• 2006

In this paper, two sampling methods which are Latin hypercube sampling (LHS) and simple random sampling were. compared to improve the modeling speed of neural network model. Sampling method was used to generate initial weights and bias set. Electrical characteristic data for $HfO_2$ thin film was used as modeling data. 10 initial parameter sets which are initial weights and bias sets were generated using LHS and simple random sampling, respectively. Modeling was performed with generated initial parameters and measured epoch number. The other network parameters were fixed. The iterative 20 minimum epoch numbers for LHS and simple random sampling were analyzed by nonparametric method because of their nonnormality.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.2
• /
• pp.207-212
• /
• 2008

This paper presents a robust and computationally efficient optimal design algorithm for electromagnetic devices by combining an adaptive response surface approximation of the objective function and($1+{\lambda}$) evolution strategy. In the adaptive response surface approximation, the design space is successively reduced with the iteration, and Pareto-optimal sampling points are generated by using Latin hypercube design with the Max Distance and Min Distance criteria. The proposed algorithm is applied to an analytic example and TEAM problem 22, and its robustness and computational efficiency are investigated.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.2
• /
• pp.177-183
• /
• 2013

We describe a new method for selecting design variables for shape optimization of high-voltage gas circuit breaker using a Kriging meta-model and a genetic algorithm. Firstly we sample balance design variables using the Latin Hypercube Sampling. Secondly, we build meta-model using the Kriging. Thirdly, we search the optimal design variables using a genetic algorithm. To obtain the more exact design variable, we adopt the boundary shifting method. With the proposed optimization frame, we can get the improved interruption design and reduce the design time by 80%. We applied the proposed method to the optimization of multivariate optimization problems as well as shape optimization of a high - voltage gas circuit breaker.

• International Journal of Reliability and Applications
• /
• v.2 no.1
• /
• pp.27-36
• /
• 2001

This Paper proposes a new methodology for assessing the reliability of an accident management, which Is based on the reliability physics and the scheme to generate dynamic event tree. The methodology consists of 3 main steps: screening; uncertainty propagation; and probability estimation. Sensitivity analysis is used for screening the variables of significance. Latin Hypercube sampling technique and MAAP code are used for uncertainty propagation, and the dynamic event tree generation method is used for the estimation of non-success probability of implementing an accident management strategy. This approach is applied in assessing the non-success probability of implementing a cavity flooding strategy, which is to supply water into the reactor cavity using emergency fire systems during the sequence of station blackout at the reference plant.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.499-510
• /
• 2004

This paper proposes a heuristic load balancing algorithm for multiprocessor systems. The algorithm minimizes the number of idle links to distribute load traffic and reduces its communication cost. Each processor iteratively tries to transfer unit load to/from every neighbor processors. However, real load transfer is collectively done after complete load traffic calculation to minimize useless traffic. The proposed algorithm can be employed in various interconnection topologies with slight modifications. In this paper, it is applied to both hypercube and mesh environments. For performance evaluation, simulation studies are performed. The performance of proposed algorithm is compared to those of two well-known algorithms. The results show that the proposed algorithm always balances the loads perfectly. Furthermore, it reduces the communication costs by $70{\%}{\~}90{\%}$ in the hypercube ; and it reduces the cost by $\75{\%}$ in the mesh, compared to existing algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.149-157
• /
• 2009

The crossed cube, a variation of the hypercube, possesses a better topological property than the hypercube in its diameter that is about half of that of the hypercube. It has been known that an N-node complete binary tree is a subgraph of an (N+1)-node crossed cube [P. Kulasinghe and S. Bettayeb, 1995]. However, efficient embedding methods have not been known for the case that the number of nodes of the complete binary tree is greater than that of the crossed cube. In this paper, we show that an N-node complete binary tree can be embedded into an M-node crossed cube with dilation 1 and load factor [N/M], N>M$\geq$2. The dilation and load factor is optimal. Our embedding has a property that the tree nodes on the same level are evenly distributed over the crossed cube nodes. The property is especially useful when tree-structured algorithms are processed on a crossed cube in a level-by-level way.

• The Korean Journal of Applied Statistics
• /
• v.7 no.1
• /
• pp.83-102
• /
• 1994

Some optimal designs and data analysis methods based on a Gaussian spatial linear model for computer simulation experiments are considered. For designs of computer experiments, Latin-hypercube designs and some optimal designs are combined. A two-stage computational (2-points exchange and Newton-type) algorithm for finding the optimal Latin-hypercube design is presented. The spatial prediction model which was discussed by Sacks, Welch, Mitchell and Wynn(1989) for computer experiments, is used for analysis of the simulated data. Moreover, a method of contructing sequential (optimal) Latin-hypercube designs is considered. An application of this approach to the quality improvement and optimization of the integrated circuit design via the main-effects plot and the sequential experimental strategy is presented.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.6
• /
• pp.262-274
• /
• 2019

The purpose of this study is to estimate the minimum proportion of probe vehicles for obtaining expressway traffic information using VISSIM, a micro traffic simulation model, between Yongin IC and Yangji IC on Yeongdong Expressway. 7,200 scenarios were created for the experiment, and 40 scenarios were adopted using the Latin hypercube sampling method because it was difficult to perform all the scenarios through experiments. The reliability of the experiment was improved by adding a situation when the general situation and the accident situation exist. In the experiments, the average travel time of probe vehicles at different market penetration rates were compared with the average travel time of the entire vehicles. As a result, the minimum market penetration rate of probe vehicles for obtaining expressway traffic information was found to be 45%. In addition, it is estimated that 25% market penetration rate of probe vehicle can meet 70% of traffic situations in accident scenario.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11C
• /
• pp.1044-1051
• /
• 2006

System level diagnosis algorithms use the properties of t-diagnosable system where the maximum number of the faults does not exceed 1. The existing diagnosis algorithms have limit when dealing with large fault sets in large multiprocessor systems. Somani and Peleg proposed t/k-diagnosable system to diagnose more faults than t by allowing upper bounded few number of units to be diagnosed incorrectly. In this paper, we propose adaptive hypercube diagnosis algorithm using t/k-diagnosable system. When the number of faults exceeds t, we allow k faults to be diagnosed incorrectly. Simulation shows that the performance of the proposed algorithm is better than Feng's HADA algorithm. We propose new algorithm to reduce test rounds by analyzing the syndrome of RGC-ring obtained in the first step of HADA/IHADA method. The proposed algorithm also gives similar performance compared to HYP-DIAG algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4343-4355
• /
• 2014

Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD（Hamming Distance）-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.