• Title/Summary/Keyword: 초기적응과정

Search Result 140, Processing Time 0.024 seconds

The Study on Evolution of Online-game Item Cash-trade-system as Complex Adaptive System (복잡적응계로서 온라인게임 아이템 현금거래체계의 진화에 관한 연구)

  • Chang, Yong-Ho;Joung, Won-Jo
    • Journal of Korea Game Society
    • /
    • v.10 no.3
    • /
    • pp.47-59
    • /
    • 2010
  • Differing from most of current studies which recognizing game item cash-trade as simple static system, this study approaches game item cash-trade as Complex Adaptive System through historical analysis. The item-trade is a complex phenomenon converging between cyber-economy and real-economy, and production and consumption process of game-item are evolving dynamically over time. The results are following: first, the early item-trade emerges in endogenously rather than results from purposed system designed by singular actor. Second, after the early item-trade, the trade system as a CAS which various voluntary actors(single user, factory, game company, user community, agency, etc.) participates in is self-organizing for trading safety and efficiency. Third, the complex adaptive item-trade system satisfies actor's needs interdependently and accelerate positive feedback powerfully. This study implies that purposeful control disregarding emergent adaptive item-trade system distorts system efficiency and can lead to unintended policy failure.

Multi-resolutional Deformable Modeling for Real-time Interaction (실시간 인터랙션을 위한 다해상도 변형 모델링)

  • Choi, Yoo-Joo;Kim, Myoung-Hee
    • Journal of the Korea Computer Graphics Society
    • /
    • v.10 no.1
    • /
    • pp.7-13
    • /
    • 2004
  • 본 논문에서는 cavity 변형 물체의 전역적 변형 형태는 유지하면서 계산 복잡도를 줄이기 위하여 모델의 다중해상도적 표현 기법 및 서로 다른 상세 레벨간 물리적 특성변수에 대한 적응기법을 제안한다. 또한, 객체의 안정적 변형을 지원하기 위한 형태유지 스프링을 제안한다. 일반적으로 위나 풍선과 같은 cavity 변형객체는 전체 구성노드의 수를 줄이기 위하여 표면 메쉬 구조로 모델링 된다. 이 경우, 표면의 인접 노드만이 감쇠(damping) 스프링으로 연결되고, 모델의 체적정보의 부재로 인하여 외부 힘이 일정시간 동안 지속적으로 주어지는 경우, 객체의 형태변형이 왜곡되고, 초기형태로의 복원이 불가능해진다. 본 논문에서 제안하는 형태유지 스프링은 외부힘에 의한 변형 후 초기형태로의 복원을 보장함으로써, 복잡한 계산과정 없이 간접적으로 객체의 볼륨유지 효과를 제공하고 변형의 불안전성을 제거한다.

  • PDF

The Process of Local Adaptation in the Community with High Foreign Population: The Case of Chinese Ethnic Community in Jayang-Dong, Seoul, Korea (외국인 밀집지역 형성에 따른 지역사회 적응과정 연구 -광진구 자양동 중국인 밀집지역을 중심으로-)

  • Cho, Minkyung;Jang, Wonho
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.19 no.2
    • /
    • pp.225-241
    • /
    • 2016
  • This paper looks into the process of the formation of a Chinese ethnic place in Jayang-dong, Gwangjin-gu. In doing so, the paper reviews Chinese immigrants with the approach of cultural adaptation. Specifically, in-depth interviews with both Chinese immigrants and Korean native people in Jayangdong has been conducted to analyze the local residents' reaction to the Chinese immigrants, the conflicts between the natives and the Chinese immigrants, and communications among them. Based on the analyses, the paper recognizes the change of relationship between the natives and the Chinese immigrants in the development of the ethnic place. The relationship between the Korean native people and Chinese immigrants in Jayang-dong turns out to be more positive than that in other Chinese towns. In Jayang-dong, in the early period of the formation of the area, the Korean native people and Chinese immigrants used to have conflicts. However, as time goes by, the conflicts has been resolved and they have embraced each other through interchanges between them based on mutual understanding and consideration. Cultural adaptation in Jayang-dong has occurred in the way that the immigrants have been integrated into the mainstream society based on the connectedness with both the native people and immigrants embracing each other.

  • PDF

Adaptive Self Organizing Feature Map (적응적 자기 조직화 형상지도)

  • Lee , Hyung-Jun;Kim, Soon-Hyob
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.6
    • /
    • pp.83-90
    • /
    • 1994
  • In this paper, we propose a new learning algorithm, ASOFM(Adaptive Self Organizing Feature Map), to solve the defects of Kohonen's Self Organiaing Feature Map. Kohonen's algorithm is sometimes stranded on local minima for the initial weights. The proposed algorithm uses an object function which can evaluate the state of network in learning and adjusts the learning rate adaptively according to the evaluation of the object function. As a result, it is always guaranteed that the state of network is converged to the global minimum value and it has a capacity of generalized learning by adaptively. It is reduce that the learning time of our algorithm is about $30\%$ of Kohonen's.

  • PDF

Cross Diamond Search Using Motion Direction Biased Characteristics (움직임 방향 치우침 특성을 이용한 십자형 다이아몬드 탐색)

  • Ryu, Kwon-Yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1527-1533
    • /
    • 2009
  • In this paper, we design directional search pattern using motion direction biased characteristics of MVP distribution, and proposes a direction applied cross diamond search method that adaptively change search pattern according to moving direction of search point. Proposed method predict motion vectors from neighbor macro blocks, and define initial motion direction by using predicted motion vectors. It improve search efficiency by using alternately proposed search pattern according to motion direction of BMP in search process. The simulation results show that proposed method is able to fast motion estimation compared with conventional cross diamond search, according as it reduce computational complexity that is required of motion estimation with $0.43%{\sim}1.76%$.

An Efficient Partial Reanalysis Algorithm for the Locally Changed Structures (부분적 강성 변화에 따른 효율적 부분 재해석 알고리즘)

  • Kim Chee-Kyeong
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.17 no.4
    • /
    • pp.459-467
    • /
    • 2004
  • This paper presents an efficient reanalysis algorithm, named PRAS (Partial Reanalysis algorithm using Adaptable Substructuring), for the partially changed structures. The algorithm recalculates directly any displacement or member force under consideration in real time without a full reanalysis in spite of local changes in member stiffness or connectivity_ The key procedures consists of 1) partitioning the whole structure into the changed part and the unchanged part, 2) condensing the internal degrees of freedom and forming the unchanged part substructure, 3) assembling and solving the new stiffness matrix from the unchanged part substructure and the changed members.

Range of Motion, Stretching, and Aerobic Exercise in Accelerated Rehabilitation of Knee and Shoulder (슬관절과 견관절의 초기재활과정에서 관절운동범위와 스트레칭, 그리고 유산소성 운동 프로그램)

  • Kim Yong-Kweon;Jin Young-Soo
    • Journal of Korean Orthopaedic Sports Medicine
    • /
    • v.2 no.1
    • /
    • pp.56-61
    • /
    • 2003
  • This is a review article about range of motion, stretching, and aerobic exercise in accelerated rehabilitation of knee and shoulder. If the joint was immobilized for a long time after injury, it would cause stiffness and atrophy. Therefore, this program includes various exercise techniques; range of motion for joint stiffness, and stretching for muscle relaxation, and cardiovascular training (e.g., swimming, upper body extremity, stationary bicycle) for prevention of cardiopulmonary function decrease. In accelerated rehabilitation, It is very important factor to make interaction between clinical exercise specialist and patients. Also, we recommend that they should discuss with sports medicine doctor as a team members the following; pain, adaptation of exercise, fitness level, and progression of program.

  • PDF

The Performance improvement of CMA Blind Adaptive equalizer using the Constellation Matching Method (Constellation Matching 기법을 이용한 CMA 블라인드 적응 등화기의 성능 개선)

  • Lim, Seung-Gag;Kang, Dae-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.121-127
    • /
    • 2010
  • This paper relates with the improved CMA blind adaptive equalization algorithm which uses the constellation matching method that improve the inverse modelling efficiency of a communication channel compared to the present CMA blind adaptive equalizer. The amplitude distortion can be compensated in the present CMA blind adaptive equalizer which is used for the reduction of intersymbol interference by distortion that generate such as a band limited wireless mobile channel, but in the improved adaptive alogorithm operates with the minimize the amplitude phase distortion in the output of equalizer by applying the cost function that is composition of additional signal constellation matching error terms. In order to evaluation of the inverse modeling efficiency of improved algorithm, the residual intersymbol interference and recovered signal constellation were compared by computer simulation. As a result of comparion of computer simulation, the improved algorithm has a good stability in the residual intersymbol interference in the steady state, but it has a slow convergence rate in the adaptation state in initial state.

A Fast K-means and Fuzzy-c-means Algorithms using Adaptively Initialization (적응적인 초기치 설정을 이용한 Fast K-means 및 Frizzy-c-means 알고리즘)

  • 강지혜;김성수
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.516-524
    • /
    • 2004
  • In this paper, the initial value problem in clustering using K-means or Fuzzy-c-means is considered to reduce the number of iterations. Conventionally the initial values in clustering using K-means or Fuzzy-c-means are chosen randomly, which sometimes brings the results that the process of clustering converges to undesired center points. The choice of intial value has been one of the well-known subjects to be solved. The system of clustering using K-means or Fuzzy-c-means is sensitive to the choice of intial values. As an approach to the problem, the uniform partitioning method is employed to extract the optimal initial point for each clustering of data. Experimental results are presented to demonstrate the superiority of the proposed method, which reduces the number of iterations for the central points of clustering groups.

A Study on Broadcast Encryption Using Multicast Key Management (멀티캐스트 키 관리 기법을 적용한 브로드캐스트 암호화에 관한 연구)

  • 이덕규;이임영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.595-597
    • /
    • 2003
  • 브로드캐스트 암호화 기법은 공개된 네트워크 상에서 멀티미디어, 소프트웨어, 유료 TV 등의 디지털 점보들을 전송하는데 적응되고 있다. 브로드캐스트 암호화 기법에서 중요한 것은 오직 사전에 허가된 사용자만이 디지털 정보를 얻을 수 있어야 한다는 것이다. 브로드캐스트 메시지가 전송되면 권한이 있는 사용자들은 자신이 사전에 부여받은 개인키를 이용하여 먼저 세션키를 복호화하고 이 세션키를 통하여 디지털 정보를 얻게 된다. 이와 같이 사용자는 브로드캐스터가 전송하는 키를 이용하여 메시지나 세션키를 획득하게 되는데. 이러한 과정에서 브로드캐스터가 키를 생성하고 분배하는 과정이 필요하다. 또한 사용자가 탈퇴나 새로운 가입시에 효율적인 키 갱신이 필요하게 된다. 이에 본 논문에서는 기존에 서버가 단독으로 사용자를 예측하여 사용자에게 키를 분배하는 것이 아니고 초기 중심 서버가 키를 생성한 후 하부의 서버에 권한위임을 하면 하부 서버는 다시 사용자에게 키를 배포하는 방식으로 키를 생성 분배하도록 한다. 본 제안 방식은 기존의 서버 중심의 단독 키 분배보다 보다 효율적인 키 생성과 분배, 키 갱신을 하도록 제안하였다.

  • PDF