• Title/Summary/Keyword: 완전 최소화

Search Result 229, Processing Time 0.024 seconds

On variable bandwidth Kernel Regression Estimation (변수평활량을 이용한 커널회귀함수 추정)

  • Seog, Kyung-Ha;Chung, Sung-Suk;Kim, Dae-Hak
    • Journal of the Korean Data and Information Science Society
    • /
    • v.9 no.2
    • /
    • pp.179-188
    • /
    • 1998
  • Local polynomial regression estimation is the most popular one among kernel type regression estimator. In local polynomial regression function esimation bandwidth selection is crucial problem like the kernel estimation. When the regression curve has complicated structure variable bandwidth selection will be appropriate. In this paper, we propose a variable bandwidth selection method fully data driven. We will choose the bandwdith by selecting minimising estiamted MSE which is estimated by the pilot bandwidth study via croos-validation method. Monte carlo simulation was conducted in order to show the superiority of proposed bandwidth selection method.

  • PDF

Multi-Stage Path Planning Based on Shape Reasoning and Geometric Search (형상 추론과 기하학적 검색 기반의 다단계 경로 계획)

  • Hwang, Yong-K.;Cho, Kyoung-R.
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.493-498
    • /
    • 2004
  • A novel approach for path planning of a polygonal robot is presented. Traditional path planners perform extensive geometric searching to find the optimal path or to prove that there is no solution. The computation required to prove that there is no solution is equivalent to exhaustive search of the motion space, which is typically very expensive. Humans seems to use a set of several different path planning strategies to analyse the situation of the obstacles in the environment, and quickly recognize whether the path-planning problem is easy to solve, hard to solve or has no solution. This human path-planning strategies have motivated the development of the presented algorithm that combines qualitative shape reasoning and exhaustive geometric searching to speed up the path planning process. It has three planning stages consisting of identification of no-solution cases based on an enclosure test, a qualitative reasoning stage, and finally a complete search algorithm in case the previous two stages cannot determine of the existence of a solution path.

Prediction of Saturation Time for the Soil Slopes due to Rainfalls (지속적인 강우에 의한 토사사면의 포화시간 예측)

  • Park, Sungwon;Han, Taekon;Kim, Hongtaek;Baek, Seungcheol
    • Journal of the Korean GEO-environmental Society
    • /
    • v.8 no.4
    • /
    • pp.67-74
    • /
    • 2007
  • Many studies for slope stability studies have indicated that the infiltration of rainwater into a slope decrease the slope stability. In order to minimize damage caused by slope failure, most design codes suggest that the slope stability be analyzed by saturated condition during rainy season. However it would be excessively conservative condition that every soil slope is saturated in rainy season irrespective of rainfall intensity, soil type and slope geometry. In addition, because most soil slopes are in an unsaturated state, it is necessary to consider the unsaturated characteristics of slope. This paper suggests a prediction method of saturation time for the weathered granite soil slopes due to rainfalls. The finite element analysis of transient water flow through unsaturated slope was used to investigate effects of soil-water characteristics, permeability at saturation, slope geometry, and rainfall intensity. From the result of these analyses, the prediction charts considering soil-water characteristics, permeability at saturation, and slope height were proposed in this study. It is possible to the time required to be saturated slope after rainfall.

  • PDF

Requirements Trace Table Expansion and How to Normalization (요구사항추적테이블의 확장 및 정규화 방안)

  • Kim, Ju-Young;Rhew, Sung-Yul
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.201-212
    • /
    • 2009
  • There are various methods to trace output in software development to verify the consistency and completeness of requirements. Existing studies do present the trace meta-model or automated tools, but fail to list specifically traced output or traced items. Also, in regards to trace tables, which contain traced items, existing studies don‘t consider the whole software development process but merely its sub-process. Given this, the present study suggests an extended requirements tracetable that tracks output from the inception of the project through the architectural design phase to the application delivery, following up on the researcher’s previous study on a tracetable that considered only a sub-process of the whole development process. In addition, in order to address the problem of the tracking process becoming complicated with increased tracefields due to an extended trace table, the researcher suggests a method for normalizing a requirements tracetable that can integrate and separate by development process phase. Apply it to theH system development project of a D company, and this study caseverified application possibility of study, confirmed an effect of a chase to easily find out an error of requirements. Improve precision of a traceto verify consistency of requirements and completeness through this study, and will minimize failure of a software development.

Wide Beam Design of a Fully Digital Active Array Radar Using Convex Optimization with Only Phase Control (위상 조정 Convex 최적화 알고리즘을 이용한 완전 디지털 능동배열레이다의 광역빔 설계)

  • Yang, Woo-Yong;Lee, Hyun-Seok;Yang, Sung-Jun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.30 no.6
    • /
    • pp.479-486
    • /
    • 2019
  • The fully digital active array radar uses a wide beam for effective mission performance within a limited time. This paper presents a convex optimization algorithm that adjusts only the phase of an array element. First, the algorithm applies a semidefinite relaxation technique to relax the constraint and convert it to a convex set. Then, the constraint is set so that the amplitude is fixed to some extent and the phase is variable. Finally, the optimization is performed to minimize the sum of the eigenvalues obtained through eigenvalue decomposition. Compared to the application results of the existing genetic algorithm, the proposed algorithm is more effective in wide beam design for a fully digital active array radar.

Markov Chain Monte Carlo Simulation to Estimate Material Properties of a Layered Half-space (층상 반무한 지반의 물성치 추정을 위한 마르코프 연쇄 몬테카를로 모사 기법)

  • Jin Ho Lee;Hieu Van Nguyen;Se Hyeok Lee
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.36 no.3
    • /
    • pp.203-211
    • /
    • 2023
  • A Markov chain Monte Carlo (MCMC) simulation is proposed for probabilistic full waveform inversion (FWI) in a layered half-space. Dynamic responses on the half-space surface are estimated using the thin-layer method when a harmonic vertical force is applied. Subsequently, a posterior probability distribution function and the corresponding objective function are formulated to minimize the difference between estimations and observed data as well as that of model parameters from prior information. Based on the gradient of the objective function, a proposal distribution and an acceptance probability for MCMC samples are proposed. The proposed MCMC simulation is applied to several layered half-space examples. It is demonstrated that the proposed MCMC simulation for probabilistic FWI can estimate probabilistic material properties such as the shear-wave velocities of a layered half-space.

A Dynamic Buffer Allocation Scheme in Video-on-Demand System (주문형 비디오 시스템에서의 동적 버퍼 할당 기법)

  • Lee, Sang-Ho;Moon, Yang-Sae;Whang, Kyu-Young;Cho, Wan-Sup
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.9
    • /
    • pp.442-460
    • /
    • 2001
  • In video-on-demand(VOD) systems it is important to minimize initial latency and memory requirements. The minimization of initial latency enables the system to provide services with short response time, and the minimization of memory requirements enables the system to service more concurrent user requests with the same amount of memory. In VOD systems, since initial latency and memory requirement increase according to the increment of buffer size allocated to user requests, the buffer size allocated to user requests must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that thy system is in fully loaded state. Thus, when the system is in partially loaded state, the scheme allocates user requests unnecessarily large buffers. This paper proposes a dynamics buffer allocation scheme that allocates user requests the minimum buffer size in fully loaded state as well as a partially loaded state. This scheme dynamically determines the buffer size based on the number of user requests in service and the number of user requests arriving while servicing current requests. In addition, through analyses and simulations, this paper validates that the dynamics buffer allocation outperforms the statics buffer allocation in initial latency and the number of concurrent user requests that can be supported. Our simulation results show that, in proportion to the static buffer allocation scheme, the dynamic buffer allocation scheme reduces the average initial latency by 29%~65%, and in a systems having several disks. increases the average number of concurrent user requests by 48%~68%. Our results show that the dynamic buffer allocation scheme significantly improves the performance and reduce the capacity requirements of VOD systems.

  • PDF

A Comparative Study on Distortion Correction Algorithms for Digital Cadastral Maps (전산화 지적도의 왜곡 최소화 알고리즘 비교연구)

  • 김병국;정동훈;김해명
    • Spatial Information Research
    • /
    • v.11 no.4
    • /
    • pp.421-437
    • /
    • 2003
  • In order to calculate the position of parcel boundary points, the area of the Parcel, and the length of the parcel boundary lines using a digitalized cadastral map or maps, the distortion of the map has to be corrected. The correction methods, such as the method of 2D affine transformation using 4 comer points of the edge lines, the method of tessellation into 9 subregions, the method of using the original surveying sheets, and the method of straightening the 4 edge lines, have been developed. In this Paper, the four methods were programed and applied to some sample cadastral maps and the correction accuracies were obtained and analysed. No method could prefectly correct the distortions because the distortions were irregular throughout the maps. However, it is found that tile method of straightening the 4 edge lines is the one which can minimize the distortions when the method is applied after applying the 2D projective transformation on the maps using the 4 comer points of the edges.

  • PDF

Minimizing Energy Consumption of Sensor Networks with Energy Balance Ratio and Relay Node Placement (에너지 균형비와 중계노드 위치를 함께 고려한 센서 네트워크의 에너지 소비 최소화)

  • Sohn, Surg-Won;Han, Kwang-Rok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.7
    • /
    • pp.1549-1555
    • /
    • 2009
  • The Relay node placement problem is one of the most important requirements for many wireless sensor networks because the lifetime of sensor networks is closely related with the placement of relay nodes which receive sensed data from sensor nodes and forward them to the base station. Relay node placement problem has focused at minimization of dissipated total energy of the sensor nodes in whole networks. However, minimum total energy causes the unbalance of consumed energy in sensor nodes due to different distances between relay nodes and sensor nodes. This paper proposes the concept of energy balance ratio and finds the locations of relay nodes using objective functions which maximize the energy balance ratio. Maximizing this ratio results in maximizing the network lifetime by minimizing the energy consumption of large-scale sensor networks. However, finding a solution to relay node placement problem is NP-hard and it is very difficult to get exact solutions. Therefore, we get approximate solutions to EBR-RNP problem which considers both energy balance ratio and relay node placement using constraint programming.

치매 예방 및 치료소재의 개발 동향

  • Ha, Tae-Yeol;An, Ji-Yun
    • Bulletin of Food Technology
    • /
    • v.16 no.1
    • /
    • pp.55-63
    • /
    • 2003
  • 의료기술 및 생활수준의 향상과 함께 우리나라의 평균수명은 꾸준하게 늘어 2016년에는 65세 이상 인구가 전체의 20% 넘을 것으로 예상되고 있다. 이러한 노인인구의 증가와 더불어 노인성 치매는 오늘날의 고령화 사회에서 높은 발병율(65세 이상 인구의 10%, 75세 이상 인구의 25%, 85세 이상 인구의 50%에서 발생)을 보이고 있어 심각한 사회문제의 하나로 대두되고 있다. 또한 우리나라 치매노인의 증상은 가벼운 경우가 59.2%, 중등정도 27.2%, 아주 심한 경우가 13.6%이며 이중 치료를 통해 완치되는 경우는 겨우 14%에 불과하며 85% 이상이 치료불가능으로 보고되고 있다. 이와 같이 노인성 치매는 일단 발병하면 완전 치료가 거의 불가능할 뿐만 아니라 심하면 한 가정의 파탄을 초래하기도 할만큼 치매간호에 소요되는 정신적, 육체적, 경제적 고통은 막대하다. 따라서 의.약학계에서도 치매치료제에 대하여 다각도로 연구하고 있으나 지금까지 개발된 화학적 합성 의약품은 그 효능여부와 부작용 등의 논란이 크게 대두되고 있으며 또한 치매는 어떠한 질병보다 예방의 중요성이 인식되고 있는 만큼 이러한 부작용을 최소화 할 수 있는 예방 또는 개선차원의 식품소재개발이 중요하다고 하겠으며 이에 대한 연구자의 관심이 집중되고 있다. 본고에서는 현재 치매예방 및 치료제의 개발현황과 연구동향을 소개하고자 한다.

  • PDF