http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Central Repository System on Cloud Foundry Platform
Abhilash Sreeramaneni,Chan KOH 한국정보기술학회 2016 Proceedings of KIIT Conference Vol.2016 No.6
Gitlab 커뮤니티 에디션(CE)은 프로젝트 팀을 위한 분산 코드 호스팅 서비스를 제공하는 중앙 저장소 시스템이다. 모든 권한이 부여 된 사용자는 검토, 편집 주석을 분석하고, 원래 프로젝트의 새로운 버전으로 변경사항을 적용 할 수 있도록 한다. Gitlab는 github에 같은 기능의 대부분을 제공한다. 본 연구에서, 클라우드 파운드리 시스템의 자장소에 관련된 기술들과 전망을 고찰하고 이것을 사용하기에 효과적인 방밥을 모색해 본다. Gitlab Community Edition (CE) is a central repository system which gives a distributed code hosting services for project teams. So that every authorized user can analyze, review, edit comment, and commit the changes to newer version of original project. Gitlab offers many of the same feature as github. In this study, we review of technology status and trend of Repository system on the Cloud Foundry Platform and try to find more efficiency method to use it.
Multi-Level Security Process on the Cloud Computing Environment
Abhilash Sreeramaneni,PavanKumar Siran,Chan KOH 한국정보기술학회 2016 Proceedings of KIIT Conference Vol.2016 No.6
빅 데이터를 저렴하게 저장하고 이용하기 위해서 클라우드 컴퓨팅 환경이 점점 더 확대되고 있다. 클라우드 컴퓨팅 환경에서 보안 프로세스의 문제는 중요하다. 데이터 소유자와 클라이언트의 소통은 클라우드 서비스 프로바이더(CSP)의 도움은 배재된 상태로 그들의 네트워크 상 에서 이루어진다. 본 연구에서는 서로 다른 CSP 사이트에 DB 분배 및 저장 되고, 다중레벨 보안 체크 포인트 중심으로 암호화 되는 시스템을 중심으로 고찰한다. Nowadays cloud computing technology is inserting an outstanding role in our day to day life, its benefit’s primarily for organizations to store and organize their big data with low cost and instant access from anyplace. The data that is stored in a cloud environment is maintained by cloud service provider. The data owners and clients communicate with each other using their own network without the help of CSP (cloud service provider). In this paper study about system that distributing database and store that in different cloud service provider’s site and this system is encrypted with a multi-level security checkpoint.
Dynamic Multi-Agent Pathfinding Algorithm(DMAP) using Optimized A* (OPA*)
Abhilash Sreeramaneni,Chan KOH 한국정보기술학회 2015 Proceedings of KIIT Conference Vol.2015 No.6
In day todays advanced gaming technology and real world transportation an intelligent pathfinder is necessary, for user satisfaction. This paper presents a multi-agent pathfinding algorithm (MAPF) for dynamic environments, where objects consistently change due its nature. Several pathfinding algorithms are exists today such as regular A<SUP>*</SUP>, IDA<SUP>*</SUP> etc. All these methods are built for static environment, typically performs low quality in dynamic environments. In this paper we apply our search algorithm in connected grid (3*3=9), to construct the real world environment. In this context first we proposed optimized A<SUP>*</SUP> (OPA<SUP>*</SUP>) to reduce the regular A<SUP>*</SUP> concerns such as, CPU cycles, expanding surplus nodes and memory issues. At last we implement centralized version of optimized A<SUP>*</SUP> with the help of hlocal. Local heuristic hlocal, calculate movement cost from start to goal and recursively from goal to start nodes (at main-level). Next it will assign links between the graphs and calculate minimum distance cost by evaluating, the nearest neighbor nodes of both ends. Finally agent triggers the OPA<SUP>*</SUP> (at sublevel), to calculate the optimized path between, a connected grids. We evaluate our method in two different random grid world with four different walls frequencies. In all environments our proposed algorithm (DMAP), achieves 60-75% efficiency without exponential complexity (i.e., Execution time, memory consumption, agents and ratio (cells\ms) than existing algorithms.