• 농촌계획
• /
• 제14권2호
• /
• pp.55-64
• /
• 2008

This study aims to analyze the sensitivity of WSM(weighted scenario method)-AHP method according to variation of nonlinear exponent for accessibility criteria, which are used to make urbanization potential maps with the optimal weighting value for multiple criteria in grid-based GIS technique. Besides this study tried to develop WSM-AHP2 which is simplified by using rank of the potential value for each scenario. The two methods were applied to the test area, Suwon city located south area of Seoul, with time series land-use maps of 1986 and 1996. The evaluation system of urbanization potential have 7 criteria including 6 accessibility criteria. The results of WSM-AHP2, the optimal weighting values and their corresponding potential maps, have almost similar with those of WSM-AHP. In the application of CA(cellular automata) model for expansion of urbanized area using the three potential maps by WSM-AHP, WSM-AHP2, and specialists's AHP evaluation, it also showed that the accuracy of simulation for actual urban area is the highest in the potential map of WSM-AHP, followed by WSM-AHP2 and specialists's AHP evaluation. From the results of this study, WSM-AHP and simplified WSM-AHP2 will be used to generate the optimal potential maps for land-use planning in urban fringe area.

• Journal of Communications and Networks
• /
• 제18권6호
• /
• pp.902-912
• /
• 2016

Recent advances in energy harvesting (EH) technology have motivated the adoption of rechargeable mobile devices for communications. In this paper, we consider a point-to-point (P2P) wireless communication system in which an EH transmitter with a non-ideal rechargeable battery is required to send a given fixed number of bits to the receiver before they expire according to a preset delay constraint. Due to the possible energy loss in the storage process, the harvest-use-and-store (HUS) architecture is adopted. We characterize the properties of the optimal solutions, for additive white Gaussian channels (AWGNs) and then block-fading channels, that maximize the energy efficiency (i.e., battery residual) subject to a given rate requirement. Interestingly, it is shown that the optimal solution has a water-filling interpretation with double thresholds and that both thresholds are monotonic. Based on this, we investigate the optimal double-threshold based allocation policy and devise an algorithm to achieve the solution. Numerical results are provided to validate the theoretical analysis and to compare the optimal solutions with existing schemes.

• 품질경영학회지
• /
• 제28권2호
• /
• pp.135-146
• /
• 2000

This study has adapted a genetic algorithm for an optimal design for the first time. The models using a simulation are the nonlinear models. Using an genetic algorithm in D-optimal, it is more efficient than previous algorithms to get an object function. Not like other algorithms, without any troublesome restrictions about the initial solution, not falling into a local optimal solution, it's the most suitable algorithm. Also if we use it without any adding experiments, we can use it to find optimal design of experimental condition efficiently.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.1171-1173
• /
• 2003

There are two datasets to estimate the area-mean and time-mean precipitation rate. For one, an array of surface rain gauges represents a series of rods that have to the time axis of the volume. And another data is that of a remote sensing make periodic overpasses at a fixed interval such as radar. The problem of optimally combining data from surface rain gauge data and remote sensed data is considered. In order to combining remote sensed data with Automatic Weather Station (AWS), we use optimal weighting method, which is similar to the method of [2]. They had suggested optimal weights that minimized value of the mean square error. In this paper, optimal weight is evaluated for the cases such as Changma, summer Monsoon, Typhoon and orographic rain.

• 한국컴퓨터정보학회논문지
• /
• 제24권1호
• /
• pp.137-143
• /
• 2019

As the performance of computers increases, the use of deep learning, which has faced technical limitations in the past, is becoming more diverse. In many fields, deep learning has contributed to the creation of added value and used on the bases of more data as the application become more divers. The process for obtaining a better performance model will require a longer time than before, and therefore it will be necessary to find an optimal model that shows the best performance more quickly. In the artificial neural network modeling a tuning process that changes various elements of the neural network model is used to improve the model performance. Except Gride Search and Manual Search, which are widely used as tuning methods, most methodologies have been developed focusing on heuristic algorithms. The heuristic algorithm can get the results in a short time, but the results are likely to be the local optimal solution. Obtaining a global optimal solution eliminates the possibility of a local optimal solution. Although the Brute Force Method is commonly used to find the global optimal solution, it is not applicable because of an infinite number of hyper parameter combinations. In this paper, we use a statistical technique to reduce the number of possible cases, so that we can find the global optimal solution.

• 품질경영학회지
• /
• 제24권4호
• /
• pp.14-28
• /
• 1996

We consider optimal designs of partially accelerated life testing which is deviced for parallel systems with the considerably long life time. In partially step-stress life testing, test items are first run simultaneously at use condition for a specified time, and the surviving items are then run at accelerated condition until a predetermined censoring time. In partially constant-stress life testing, test items are run at either use or accelerated condition only until a specified censoring time. The optimal criterion for each test is to minimize either the generalized asymptotic variance of maximum likelihood(ML) estimators of the hazard rates at use condition and the acceleration factors or the asymptotic variance of the ML estimators of the acceleration factors.

• EDISON SW 활용 경진대회 논문집
• /
• 제5회(2016년)
• /
• pp.384-388
• /
• 2016

This paper proposed a m.Sketch to search the optimal link lengths for a legged walking robot. In order to apply the m.Sketch for the proposed, set the design parameters of the constraints and use the m.Skecth to get optimal GL(Groud Length) and GAC(Ground Angle Coefficient). The legged robot designed based on four-bar linkage theory and Theo Jansen mechanism. The stride length of the legged walking robot was defined based on the proposed kinematic analysis. Use the Edison Design m.Sketch simulate and find the optimal link length having the best of the Ground Length (GL) and Ground Angle Coefficient(GAC). And use these length implemented the Theo Jansen mechanism both in Science box parts and acrylic. In addition to the further expansion of the legs to reach the goaltranslating heavy objects or person.

• 한국농공학회논문집
• /
• 제50권3호
• /
• pp.91-104
• /
• 2008

This study developed the WSM (weighted scenario method)-AHP method that can optimize the weighting value for multi-criteria to make GIS grid-based potential surface. The potential surface has been used to simulate urban expansion using distributed cellular automata model and to generate land-use planning as basic data. This study formulated the WSM-AHP method in mathematically and applied to test region, Suwon city, which located on south area from Seoul. WSM-AHP method generates potential map for each pair of weighting value for all criteria, which one criterion is weighted with high weighting value and the others use low weighting value, considering that the summation for all criteria weighting values should be "1". The potential change rate to the step of weighted scenario for weighting value of criteria is standardized like AHP intensity matrix in this study. From the standard potential change rate, WSM-AHP intensity matrix is completed, and then the optimal weighting value is calculated from the maximum eigenvector of the WSM-AHP matrix, according to the new WSM-AHP method developed in this study. The applied results of new method showed that the optimal weighting value from WSM-AHP is more resonable than the general AHP specialists' evaluation for weighting value. The another new finding of this study is to suggest the deterministic approach to optimize the weighting value for the distributed CA model, which is used to find new city area and to generate rational land-use planning.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 춘계학술대회 논문집
• /
• pp.477-480
• /
• 1995

Dccisions of optimal filling conditions for the chip encapsulation have been done primarily by an ad hoc use of expertise accumulated over the years because the chip encapsulation process is quite complicated. The current CAE systems do not provide mold designers with necessary knowledge of the chip encapsulation for the successful design of optimal filling except flow simulation capability. There have been no attempts to solve the optimal filling problem in the process of the chip encapsulation. In this paper, we have constructed an design system for optimal filling to avoid short shot in the chip encapsulation process which combines an optimization methodology with CAE software.

• 충청수학회지
• /
• 제27권2호
• /
• pp.219-225
• /
• 2014

I use the dynamic programming approach to study the optimal consumption and investment problem with regime-switching and constant labor income. I derive the optimal solutions in closed-form with constant absolute risk aversion (CARA) utility and constant disutility.