http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : 길현영(Hyunyoung Kil) (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
A Study on Efficient Software Education Donation Ecosystem
길현영(Hyunyoung Kil),이원주(Won Joo Lee),임춘성(Chunsung Lim) 한국컴퓨터정보학회 2018 韓國컴퓨터情報學會論文誌 Vol.23 No.4
In this paper, we propose a software education ecosystem model for activating software education donation. First, in order to investigate current software education donation status, we will conduct a survey on software education donors and analyze the results. 39.6% of the software education donors responded that they were introduced to software education donation activities through their affiliated companies, institutions, organizations. Therefore, it can be seen that the promotion of software education donation activities is the most effective by promoting through software companies, organizations, and organizations and using human networks. The subjects of software education donation activities were the highest at middle school students (73.9%), and the contents of software education donations were the highest at programming practice (63.3%). Donors" satisfaction with software education donation activities was 57.9%. The social support for SW education donors was in the order of software education contents support, activity cost support, equipment and network support, and place sponsorship. 87.4% of donors were willing to continue to donate to software education. The reason why they did not want to continue donating software education was "lack of personal time" (65.4%). Therefore, it is necessary to develop appropriate social support and incentive system to overcome shortage of personal time in order to activate software education contribution. In order to promote sustainable software education donations, it is essential to establish a virtuous circle of software education donation ecosystem based on cooperation and solidarity with various organizations such as government, corporations, institutions, universities and civil society organizations.
-
이더리움 스마트 컨트랙트 검증을 위한 ATL 모델 체킹
남원홍(Wonhong Nam),길현영(Hyunyoung Kil) 대한전기학회 2021 전기학회논문지 Vol.70 No.12
A blockchain is a growing list of cryptographically secured blocks to maintain shared data on decentralized systems, in order to archive transactions between untrusted participants. Smart contracts are computer programs that automatically execute legal events according to the terms of contracts. Although the Ethereum blockchain has been successfully applied to a number of interesting applications, there have been several events that subtle flaws in smart contracts induce a huge amount of financial loss such as the DAO attack. Accordingly, to analyze smart contracts, we propose a novel formal verification technique to employ ATL (Alternating-time Temporal Logic) model checking. Our methodology represents the interaction between users and smart contracts with a two-player game and verify game properties by using MCMAS that is an efficient ATL model checker.
-
Optimistic Scheduling Scheme for Mobile Transactions
Kil, HyunYoung,Kim, SungSuk,Hwang, Chong-Sun 고려대학교 컴퓨터과학기술연구소 2001 JOURNAL OF COMPUTER SCIENCE & ENGINEERING TECHNOLO Vol.3 No.-
무선 통신 기술이 발달함에 따라, 무선 이동 컴퓨팅 환경에서 데이터를 질의하는 주제가 많이 연구되고 있다. 그러나 트랜잭션 개념을 지원하는 분야는 충분히 지원되지 않고 있다. 이동 컴퓨팅 환경에서 제약조건은 특히 이러한 개념을 지원하는 것을 곤란하게 만들기 때문이다. 이 논문에서 우리는 두가지 낙관적 트랜잭션 처리 알고리즘 -OCC-WR, AOCC-WR-을 제안한다. 이 알고리즘에서 이동 클라이언트들은 서버로부터의 주기적으로 브로드캐스트되는 제어 정보 및 캐쉬 데이터를 이용하여 트랜잭션을 낙관적으로 수행시킨다. 직렬화가능성을 보장하기 위하여 우리는 이동 트랜잭션간에 발생한 충돌 순서를 결정하기 위해 재순서화 개념을 제안한다 또한 불필요한 철회를 준이기 위해 AOCC-WR 알고리즘에서는 완료 순서를 조절하도록 재순서화 개념을 확장하였다. With the advance of wireless communication technology, the topic of querying data in a wireless mobile computing environment has been a lot of attention in the literature. The concept of transaction semantics, however, has not been fully provided. The reason is that the limitations of mobile computing environments make difficult in developing those systems. In this paper, we propose two optimistic concurrency control algorithms called OCC-WR and AOCC-WR. In these algorithms, the mobile clients listen to periodic broadcast information from the server, and optimistically execute their read/write operations based on both the cache data and the control information from broadcast. To ensure serializability, we propose the reordering technique which determines the conflict order among the mobile transactions. To reduce the unnecessary aborts, we expand the reordering technique by adjusting the commit order in AOCC-WR.
ScienceON
DBpia연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
