http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Yapures: 안전한 JavaScript 코드를 작성하는 편리한 프레임워크
류샤오,김연어,변석우,우균 한국정보과학회 2019 정보과학회 컴퓨팅의 실제 논문지 Vol.25 No.4
This paper introduces a framework named Yapures (Yet another PureScript) that represents a convenient strategy to use PureScript for generating JavaScript code with type safety. The type safety and the correctness of JavaScript are becoming more important since it can be run on the server side. Several Haskell-based systems assist developers in generating JavaScript code with type safety; however, most of them are difficult and cumbersome to use. Yapures is developed based on one of such systems known as PureScript. Yapures facilitates developers in writing original JavaScript and PureScript codes simultaneously to ensure the generation of the type-safe JavaScript code.
CDLint: A Cloud Service for Dynamic Analysis of JavaScript Code
류샤오 ( Xiao Liu ),우균 ( Gyun Woo ) 한국정보처리학회 2017 한국정보처리학회 학술대회논문집 Vol.24 No.1
This paper presents a cloud service called CDLint for checking and analyzing the Javascript code dynamically. The correctness of Javascript code is becoming more important since it can also run on the server side as well as the client side. There are several analysis systems for checking the bad code in JavaScript but they seem like have one or more weaknesses. CDLint is developed based on an existing work named DLint which is a powerful bad JavaScript checker. Compared with similar systems, CDLint shows the best performances with respect to the system extensibility, the freedom to use without installation, the automatic parsing of JavaScript code from website, and the environment configuration for JavaScript code checking.
GCaaS: A Light-weight Grid Computing Web Application
류샤오 ( Xiao Liu ),우군 ( Gyun Woo ) 한국정보처리학회 2015 한국정보처리학회 학술대회논문집 Vol.22 No.1
Recent global and cloud computing render the Internet and Web application to be a paramount field since it is uncomplicated to access and less time and space limitation. On the other hand, a growing number of computations using grid computing techniques indicates the requirements and quantities of large-scale computations are becoming foremost progressively. Therefore, that will be much practicable if there is a Web-based service that could provide Grid computing functions. In this paper, Several similar Web-based cloud and parallel computing systems will be discussed and a model of Web application termed GCaaS which supports grid computing services will be introduced.
Yapures: A Convenient Framework for Writing Safe JavaScript Code
Xiao Liu(류샤오),Yeoneo Kim(김연어),Sugwoo Byun(변석우),Gyun Woo(우균) 한국정보과학회 2019 정보과학회 컴퓨팅의 실제 논문지 Vol.25 No.4
이 논문은 Yapures(Yet another PureScript)라고 하는 JavaScript 프레임워크를 소개한다. Yapures를 사용하면 PureScript를 사용하여 더 간편한 방식으로 타입 안전성을 보장하는 JavaScript 코드를 생성할 수 있다. JavaScript가 서버의 백엔드(back-end) 쪽에서 많이 사용됨에 따라 타입 안전성과 정확성이 중요한 문제로 대두되었다. 하스켈을 기반으로 하여 타입 안전성을 보장하는 기존 JavaScript 프레임워크들은 어렵고 사용 편의성이 좋지 않다는 단점이 있다. Yapures는 기존 프레임워크 중에 PureScript라는 시스템을 개선하여 개발되었다. Yapures를 사용하면 원본 JavaScript 코드 파일 안에서 PureScript 코드를 함께 사용할 수 있으며 최종적으로 타입 안전성을 보장하는 JavaScript 코드를 생성할 수 있다. This paper introduces a framework named Yapures (Yet another PureScript) that represents a convenient strategy to use PureScript for generating JavaScript code with type safety. The type safety and the correctness of JavaScript are becoming more important since it can be run on the server side. Several Haskell-based systems assist developers in generating JavaScript code with type safety; however, most of them are difficult and cumbersome to use. Yapures is developed based on one of such systems known as PureScript. Yapures facilitates developers in writing original JavaScript and PureScript codes simultaneously to ensure the generation of the type-safe JavaScript code.
Research on Users Willingness to Continuously Purchase Online Music Pay Services
LIUZIYANG,류가옥,류샤오인 한국동양예술학회 2020 동양예술 Vol.47 No.-
By analyzing online music paied services, the purpose of this research is to explore users’ willingness to purchase paid service, to investigate the possibility of their continuous purchase in the future, and to understand users’ needs and preference of the online music service. In this paper, the self-satisfaction, copyright awareness, flow experience and satisfaction of the service are used as independent variables, and users’ continuous-purchase willingness is used as the dependent variable. SPSS 22.0 and AMOS statistical analysis tools are used for empirical research. According to the data analysis results, the research conclusions are: self-satisfaction has a positive impact on satisfaction; copyright awareness does not hold the assumption of satisfaction; flow experience has a positive impact on satisfaction; self-demand has a positive impact on users' intention for continuous-purchase; satisfaction has a positive impact on users' willingness to continues-purchase.
분할 정복법을 이용한 Haskell GC 조정 시간 개선
안형준,김화목,류샤오,김연어,변석우,우균,An, Hyungjun,Kim, Hwamok,Liu, Xiao,Kim, Yeoneo,Byun, Sugwoo,Woo, Gyun 한국정보처리학회 2017 정보처리학회논문지. 컴퓨터 및 통신시스템 Vol.6 No.9
발열 때문에 더이상 회로 집적도를 높일 수 없기 때문에 단일 코어 프로세서의 성능 향상은 한계에 달했다. 그래서 코어를 여러 개 사용하는 멀티 코어, 매니 코어 형태의 프로세서가 등장했으며 병렬 프로그래밍이 중요해졌다. 이러한 상황에서 병렬 프로그래밍에 여러 장점이 있는 순수 함수형 언어 Haskell이 주목받고 있다. Haskell은 식 계산 방식에서 이미 병렬성이 내재되어 있으며 병렬 구조를 지원하는 모나드 도구를 제공한다. 그런데 Haskell 병렬 프로그램의 성능은 메모리 재사용 시스템을 포함한 실행시간 시스템에 큰 영향을 받는다. 이미 Haskell이 제공하는 메모리 프로파일링 도구로 GC-tune이 있지만, GC-tune은 가능한 모든 GC 옵션에 대해 프로그램 실행 시간을 반복 측정하기 때문에 GC 조정 시간이 너무 오래 걸린다. 그래서 본 연구에서는 기본적인 분할 정복법을 이용해서 GC-tune의 탐색 영역을 매 단계마다 4분의 1로 줄이는 방법을 제안한다. 제안하는 방법을 두 가지 병렬 프로그램(극대 독립 집합 프로그램과 K-평균 프로그램)에 적용한 결과, 평균 98%의 정확도로 실행 시간을 평균 7.78배 단축시켰다. The performance improvement of a single core processor has reached its limit since the circuit density cannot be increased any longer due to overheating. Therefore, the multicore and manycore architectures have emerged as viable approaches and parallel programming becomes more important. Haskell, a purely functional language, is getting popular in this situation since it naturally supports parallel programming owing to its beneficial features including the implicit parallelism in evaluating expressions and the monadic tools supporting parallel constructs. However, the performance of Haskell parallel programs is strongly influenced by the performance of the run-time system including the garbage collector. Though a memory profiling tool namely GC-tune has been suggested, we need a more systematic way to use this tool. Since GC-tune finds the optimal memory size by executing the target program with all the different possible GC options, the GC-tuning time takes too long. This paper suggests a basic divide-and-conquer method to reduce the number of GC-tune executions by reducing the search area by one-quarter for every searching step. Applying this method to two parallel programs, a maximally independent set and a K-means programs, the memory tuning time is reduced by 7.78 times with accuracy 98% on average.