• The Pure and Applied Mathematics
• /
• v.16 no.4
• /
• pp.427-441
• /
• 2009

The method of Lattice Dynamical System is used to establish a global model on an infinite chain of many local markets interacting each other through a diffusion of prices between them. This global model extends the Walrasian evolutionary cobweb model in an independent single local market to the global market evolution. We assume that each local market has linear decreasing demands and quadratic supplies with naive predictors, and investigate the stationary behaviors of global price dynamics and show that their dynamics are conjugate to those of $H{\acute{e}}non$ maps and hence can exhibit complicated behaviors such as period-doubling bifurcations, chaos, and homoclic orbits etc.

• The Pure and Applied Mathematics
• /
• v.17 no.1
• /
• pp.93-106
• /
• 2010

We employ the methods of Lattice Dynamical System to establish a global model extending the Walrasian evolutionary cobweb model in an independent single local market to the global market evolution over an infinite chain of many local markets with interaction of each other through a diffusion of prices between them. For brevity of the model, we assume linear decreasing demands and logistic supplies with naive predictors, and investigate the traveling wave behaviors of global price dynamics and show that their dynamics are conjugate to those of H$\acute{e}$non maps and hence can exhibit complicated behaviors such as period-doubling bifurcations, chaos, and homoclic orbits etc.

• The Pure and Applied Mathematics
• /
• v.16 no.2
• /
• pp.243-254
• /
• 2009

The main purpose of this paper is to use the methods of Lattice Dynamical System to establish a global model, which extends the Walrasian evolutionary cobweb model in an independent single local market to the global market evolution over an infinite chain of many local markets interacting each other through a diffusion of prices between them. For brevity of the model, we assume linear decreasing demands and quadratic supplies with naive predictors, and investigate the spatially homogeneous global price dynamics and show that the dynamics is topologically conjugate to that of well-known logistic map and hence undergoes a period-doubling bifurcation route to chaos as a parameter varies through a critical value.

• The Pure and Applied Mathematics
• /
• v.16 no.1
• /
• pp.133-145
• /
• 2009

The purpose of this paper is to extend and globalize the Walrasian evolutionary cobweb model in an independent single local market of Brock and Hommes ([3]), to the case of the global market evolution over an infinite chain of many local markets interacting each other through a diffusion of prices between them. In the case of decreasing demands and increasing supplies with a weighted average of rational and naive predictors, we investigate, via the methods of Lattice Dynamical System, the spatial-temporal behaviors of global market dynamics and show that some kind of bounded dynamics of global market do exist and can be controlled by using the parameters in the model.

• Journal of Korean Society of Rural Planning
• /
• v.10 no.3 s.24
• /
• pp.53-58
• /
• 2004

In this study the effect caused by limited storage lift of agricultural products for determining shipping amount can be analyzed by $l^{st}$ order autoregressive model based on cobweb theorem. Carrying capacity and auction price of upland-grown cabbage and garlic from 2000 to 2003 in wholesale markets were used for analysis. In result regression models of cabbage can not be used in verification periods although those of garlic approximately predicted shipping amounts in verification periods. It can be inferred that it is hard to control shipping amounts depending on price fluctuation for agricultural products which have limited storage life so cultivated areas and meteorological risk should be managed for stable price.

• Journal for History of Mathematics
• /
• v.27 no.3
• /
• pp.197-210
• /
• 2014

Species like insects and fishes have, in many cases, non-overlapping time intervals of one generation and their descendant one. So the population dynamics of such species can be formulated as discrete models. In this paper various discrete population models are introduced in chronological order. The author's investigation starts with the Malthusian model suggested in 1798, and continues through Verhulst model(the discrete logistic model), Ricker model, the Beverton-Holt stock-recruitment model, Shep-herd model, Hassell model and Sigmoid type Beverton-Holt model. We discuss the mathematical and practical significance of each model and analyze its properties. Also the stability properties of stationary solutions of the models are studied analytically and illustratively using GSP, a computer software. The visual outputs generated by GSP are compared with the analytical stability results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.949-952
• /
• 2002

비정상 행위를 탐지하는 네트워크 기반 침입탐지 시스템은 다른 네트워크 환경에서도 같은 학습정확도와 탐지 성능을 보여야 한다. 그러나 학습을 통한 패턴생성 알고리즘의 특성에 따라 정확도의 불일치가 나타날 수 있으며, 이에 따른 탐지 성능 또한 네트워크 환경에 따라 다르게 보고될 수 있는 가능성을 가진다. 본 논문은 침입탐지를 위한 학습 알고리즘으로 Instance 기반의 알고리즘인 IBL(Instance Based Learning)을 선택하여 학습시간의 단축과 패턴생성에 따른 분류근거의 명확성을 고려하였으며, 학습 환경 즉, 네트워크 환경의 차이에서 나타날 수 있는 정확도의 저하를 고려하여 COBWEB 과 C4.5 로 구성된 평가 요소를 침입탐지 모델에 추가함으로써 네트워크 보안관리자에게 좀더 유연한 비정상 행위 수준 탐지결과를 보고할 수 있게 하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.869-872
• /
• 2002

네트워크 기반 침입탐지시스템은 연속적으로 발생하는 패킷의 무손실 축소와, 패킷으로 정상 또는 비정상 행위패턴을 정확히 모델링한 모델 생성이 전체성능을 판단하는 중요한 요소가 된다. 네트워크 기반 비정상행위 판정 침입탐지시스템에서는 이러한 탐지모델 구축을 위해 주로 감독학습 알고리즘을 사용한다. 본 논문은 탐지모델 구축에 사용하는 감독 학습 방식이 가지는 문제점을 지적하고, 그에 대한 대안으로 비감독 학습방식의 학습알고리즘을 제안한다. 감독 학습을 사용하여 탐지모델을 구축하기 위해서는 정상행위의 패킷을 취합해야 하는 사전 부담이 있는 반면에 비감독 학습을 사용하게 되면 이러한 사전작업 없이 탐지모델을 구축할 수 있다. 본 논문에서는 비감독학습 알고리즘을 비교 분석하기 위해서 COBWEB, k-means, Autoclass 알고리즘을 사용했으며, 성능을 평가하기 위해서 비정상행위도(Abnormal Behavior Level)를 계산하여 에러율을 구하였다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.5
• /
• pp.898-904
• /
• 2009

The objective of the present study lies in constructing web-based GIS system providing broad range of information applicable for power/telecommunications distribution facilities through cable. Nowadays, Korea is renowned forits faste sttele communications network across the nation enjoyable for being a test-runbed by worldwide contents providers. It is not too much to say that the trend is caused by the fact that Korea utilizes the cobweb-like power transmission cables applicable for the nationwide telecommunications networking. In particular, the trend has been all the more encouraged by the governmental drive to expedite the telecommunication network by way of the established power transmission facilities deemed as publicutility. Nevertheless, few can deny that the overexcessive competition among telecommunication service providers increasingly gives rise to unauthorized, arbitrary facilitation of distribution devices, which becomes much burden in operating the normal power/telecommunications distribution facilities by a power-generating company. In this regard, the study, to cope with such problems, attempts to develop a web GIS-based information management system compatible with NDIS(New Distribution Information System), a distribution facility management system now under operation by KEPCO, making advantage of GE Energy's SIAS(Smallworld Internet Application) technology. The model provided by this study is expected to get closer into effective operation of distribution facilities along with better sharing of information among conventional telecommunications operators, while getting rid of infringed facilitation cases

• International journal of advanced smart convergence
• /
• v.8 no.3
• /
• pp.46-53
• /
• 2019

When a partitioned structure is derived from a data set using a clustering algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of data. This problem is known as the order bias problem. Many algorithms in machine learning fields try to achieve optimized result from available training and test data. Optimization is determined by an evaluation function which has also a tendency toward a certain goal. It is inevitable to have a tendency in the evaluation function both for efficiency and for consistency in the result. But its preference for a specific goal in the evaluation function may sometimes lead to unfavorable consequences in the final result of the clustering. To overcome this bias problems, the first clustering process proceeds to construct an initial partition. The initial partition is expected to imply the possible range in the number of final clusters. We apply the data centric sorting to the data objects in the clusters of the partition to rearrange them in a new order. The same clustering procedure is reapplied to the newly arranged data set to build a new partition. We have developed an algorithm that reduces bias effect resulting from how data is fed into the algorithm. Experiment results have been presented to show that the algorithm helps minimize the order bias effects. We have also shown that the current evaluation measure used for the clustering algorithm is biased toward favoring a smaller number of clusters and a larger size of clusters as a result.