• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.366-376
• /
• 2019

Youth unemployment reached a record high in 2017, and business revitalization is emerging as a means of overcoming this situation. The number of venture companies and amounts of new venture investments are increasing year on year, and the government has upgraded Small and Medium Business Administration to the Ministry of SMEs and Startups. However, the success rate of startups is relatively poor. Over the past three years only 39.1% of Korean startups survived and 90% of companies failed in the Valley of Death phase. Survival this phase is critical for early startups, and thus, the amount and timing of investments are critical. Current models for establishing business startups do not effectively attract investments because they lack practical, corporate evaluation variables. In this paper, we develop a mixed process that incorporates the factors and business models focused on by venture capital investors. In addition, we compared our Death Valley Venture (DVV) process with current methods and provide an example of its application.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.73-85
• /
• 2004

Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.

• Journal of Korea Water Resources Association
• /
• v.55 no.10
• /
• pp.761-774
• /
• 2022

Accurate hydrologic prediction is essential to analyze the effects of drought, flood, and climate change on flow rates, water quality, and ecosystems. Disentangling the uncertainty of the hydrological model is one of the important issues in hydrology and water resources research. Hydrologic data assimilation (DA), a technique that updates the status or parameters of a hydrological model to produce the most likely estimates of the initial conditions of the model, is one of the ways to minimize uncertainty in hydrological simulations and improve predictive accuracy. In this study, the two ensemble-based sequential DA techniques, ensemble Kalman filter, and particle filter are comparatively analyzed for the daily discharge simulation at the Yongdam catchment using airGRdatassim. The results showed that the values of Kling-Gupta efficiency (KGE) were improved from 0.799 in the open loop simulation to 0.826 in the ensemble Kalman filter and to 0.933 in the particle filter. In addition, we analyzed the effects of hyper-parameters related to the data assimilation methods such as precipitation and potential evaporation forcing error parameters and selection of perturbed and updated states. For the case of forcing error conditions, the particle filter was superior to the ensemble in terms of the KGE index. The size of the optimal forcing noise was relatively smaller in the particle filter compared to the ensemble Kalman filter. In addition, with more state variables included in the updating step, performance of data assimilation improved, implicating that adequate selection of updating states can be considered as a hyper-parameter. The simulation experiments in this study implied that DA hyper-parameters needed to be carefully optimized to exploit the potential of DA methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.344-355
• /
• 2002

Having a variety of good characteristics against other pattern recognition techniques, Multilayer Perceptron (MLP) has been used in wide applications. But, it is known that Error Backpropagation (EBP) algorithm which MLP uses in learning has a defect that requires relatively long leaning time. Because learning data in pattern recognition contain abundant redundancies, in order to increase learning speed it is very effective to use online-based teaming methods, which update parameters of MLP pattern by pattern. Typical online EBP algorithm applies fixed learning rate for each update of parameters. Though a large amount of speedup with online EBP can be obtained by choosing an appropriate fixed rate, fixing the rate leads to the problem that the algorithm cannot respond effectively to different leaning phases as the phases change and the learning pattern areas vary. To solve this problem, this paper defines learning as three phases and proposes a Instant Learning by Varying Rate and Skipping (ILVRS) method to reflect only necessary patterns when learning phases change. The basic concept of ILVRS is as follows. To discriminate and use necessary patterns which change as learning proceeds, (1) ILVRS uses a variable learning rate which is an error calculated from each pattern and is suppressed within a proper range, and (2) ILVRS bypasses unnecessary patterns in loaming phases. In this paper, an experimentation is conducted for speaker verification as an application of pattern recognition, and the results are presented to verify the performance of ILVRS.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.73-73
• /
• 2019

지구 표면의 약 2%에 해당하는 담수에서 육상계 전체가 흡수하는 탄소의 50%가 배출되며, 이는 토양표면에서 배출되는 탄소량에 비해 더 큰 수치로 전 지구적 탄소순환 해석에 중요한 역할을 한다. 특히, 내륙수역과 대기의 경계면에서 $CO_2$ 이동은 전 지구적 탄소순환의 중요한 구성요소로 평가되고 있다. 호수와 저수지 같은 담수 저류시설은 육상에서 기인한 탄소의 운송 및 처리 역할을 한다. 하지만, 저수지에서 온실가스배출량을 평가할 수 있는 명확한 방법론이 부족하며, 전지구 규모 GHGs배출량에 대한 추정에 대한 불확실성이 상당히 큰 상황이다. 본 연구에서는 몬순기후대에 위치한 인공저수지를 대상으로 보다 신뢰도있는 온실가스 배출량 추정을 위해 $CO_2$ NAF 산정하고, 산정에 영향을 미치는 인자들을 분석 하였다. 분석을 위해 $CO_2$ NAF 산정에 필요한 수리 및 수질 인자들을 2017년부터 2018년까지 수집하고, 기초통계량 및 상관분석을 실시하였다. 또한, 주성분분석(PCA) 및 다중선형회귀모델(MLR)과 랜덤포레스트(RF) 기법을 사용해 변수 중요도를 평가하였으며, $CO_2$ NAF 산정 주요인자인 기체교환 계수를 경험적 모델 3종(Cole and Caraco, Crusius, Vachon), 표면갱신형 모델 4종(Heiskanen, Maclntyre, Read, Soloviev)을 비교, 검토하였다. 조사기간 동안 기체교환계수 산정 결과 Crusius 모델 예측값이 평균 $0.342(0.047{\sim}4.323)cm\;hr^{-1}$으로 검토한 모델중 가장 낮은 평균값을 보였으며, Heiskane 모델이 $2.135(0.337{\sim}5.152)cm\;hr^{-1}$으로 가장 큰 평균값을 보였다. 대상 수체는 연주기로 완전혼합되며 수온성층이 약화되는 시기에 저수지 표층 아래에 축적된 탄소가 표층으로 전달되어 높은 수준의 p$CO_2$를 보이며, 수표면에 큰 난류 강도가 작용하는 기간에 대기중으로 배출(pulse emission) 기작이 나타난다. NAF 산정결과 경험적 모델의 NAF값($-1246.0{\sim}6510.3mg-CO_2m^{-2}day^{-1}$)은 표면갱신형 모델 NAF값($-1436.1{\sim}8485.7mg-CO_2m^{-2}day^{-1}$)보다 낮은 수준을 보였으며, 풍속의 함수만을 이용하는 경험적 모델보다 부력 플럭스와 난류 혼합의 영향을 고려하는 Macintyre, Heiskanen모델이 성층 저수지의 $CO_2$ NAF 산정에 적합한 것으로 나타났다. $CO_2$ NAF 산정의 주요인자로 MLR모델은 Tw, EC, pH, Chla, TOC, Alk, RF모델은 EC, DO, TOC가 중요 변수로 평가되었다. PCA 분석결과, 수온이 낮고 성층이 약화되며 pH가 낮은 상태에서 NAF가 큰 것으로 나타났다.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.818-826
• /
• 2006

In this paper, we investigate the relationship of bitrate and quantization parameter needed for the trans-coding method that makes the H.264 bitstream of a particular bitrate to the other titrate. Also we propose the new method in order to transcode the titrate between H.264 video coded bitstreams. The proposed transcoding method updates the model parameters from previous picture or slice by using the approximated relationship of bitrate and quantization step-size and finds the target quantization step-size, and then generates the target titrate by simple coding processing just after requantization. Therefore, the proposed method does not need the complex bitrate control and converts to the target titrate by simple implementation. From simulation, we can see that the proposed method transcodes exactly to an assigned target bitrate for the four test sequences with different their characteristics.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.29 no.3
• /
• pp.237-244
• /
• 2016

This paper presents a nonlinear Moving Least Squares(MLS) difference method for material nonlinearity problem. The MLS difference method, which employs strong formulation involving the fast derivative approximation, discretizes governing partial differential equation based on a node model. However, the conventional MLS difference method cannot explicitly handle constitutive equation since it solves solid mechanics problems by using the Navier's equation that unifies unknowns into one variable, displacement. In this study, a double derivative approximation is devised to treat the constitutive equation of inelastic material in the framework of strong formulation; in fact, it manipulates the first order derivative approximation two times. The equilibrium equation described by the divergence of stress tensor is directly discretized and is linearized by the Newton method; as a result, an iterative procedure is developed to find convergent solution. Stresses and internal variables are calculated and updated by the return mapping algorithm. Effectiveness and stability of the iterative procedure is improved by using algorithmic tangent modulus. The consistency of the double derivative approximation was shown by the reproducing property test. Also, accuracy and stability of the procedure were verified by analyzing inelastic beam under incremental tensile loading.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.1
• /
• pp.47-53
• /
• 1997

This paper concerns an efficient approach to forming a beam pattern of a microphone array to deal with broadband signals such as speech in a teleconference. A numerical method is proposed to find updated location of sidelobes for equalizaing the sidelobes via perturbation of array parameters such as array weight or microphone spacing. Thus the microphone array is optimized in a Dolph-Chebyshev sense such that directional or background noises incident in an array visual range are eliminated efficiently. It is shown that perturbation of microphone spacing yields an optimum pattern more appropriate for dealing with broadband signals than that of array weight. Also, a novel method is proposed to find a beam pattern which is robust with respect to sidelobe in a scanning situation. Computer simulation results are presented.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.173-173
• /
• 2021

현재까지 상수도관망 내 수질적 거동에 대한 분석은 (1) 네트워크 수질 모델(EPANET 수질모의 등)에 기반한 방법과 (2) 시공간적 저해상도 데이터에 기반한 데이터 분석법이 주를 이루었다. 그러나 현존 네트워크 수질 모델은 수질 사고의 복잡한 물리·화학적 거동을 상세히 모의하기 어렵다. 반면 계측 및 통신기술의 발달로 고해상도 수질 데이터의 실시간 수집이 가능해지면서 사고의 사전감지, 발생시 즉각적 탐지 및 대응을 위한 데이터 분석법에 관심이 증가하고 있다. 서울 문래동, 인천, 포항의 경우에서도 알 수 있듯이, 수질사고 발생 시 원인물질의 시공간적 이송 또는 전파에 대한 정보는 사고대응에 유용하게 활용된다. 본 연구는, 비정상적인 수질변화의 계통 내 전달 시간을 계산하기 위해 고해상도 수질 스마트 미터 데이터에 기반한 데이터 분석법을 개발하였다. 물공급 하류방향의 수질변화 전달 시간 정량화를 위해 화음탐색법 기반 동적시간워핑(Dynamic time warping; DTW) 기술을 이용하였고, 원데이터의 전처리를 위해 이동평균필터링을 수행하였다. 개발된 분석법은 A시 생산 및 배·급수과정의 감시지점에서 10초 단위로 계측된 다양한 수질변수(pH, 탁도, 잔류염소, 전기전도도, 수온 등)의 공간적 변이 전파시간을 결정하기 위해 적용되었다. 분석에 활용한 데이터는 데이터 통신 및 측정 기기에 의한 이상값과 운영상황의 변화에 따라 변동한 값을 처리하기 이전의 데이터이다. 데이터 품질에 의한 영향을 배제하기 위해 이상값이 발생하지 않은 기간을 파악한 후, 그 기간에 대하여 분석하였다. 계통 내 위계에 따라 두 지점의 측정값의 전파시간을 정량화한 결과, 지점에 따라 전파시간이 다르게 나타났다. 또한, 같은 두 지점에 적용한 결과라도 DTW를 적용하는 기간과 이동평균필터링의 크기에 따라 수질변화 전달 시간이 다르게 나타나는 것을 확인할 수 있었다. 본 연구에서 개발된 분석법은 다변량 수질변수 간의 영향관계를 파악하는데 확장 적용이 가능하다. 또한, 이 방법의 실시간 적용을 통해 동적으로 변화하는 전달시간을 주기적, 공간적으로 갱신하여 관망 수질 변화 모니터링이 가능하다.