• 인터넷정보학회논문지
• /
• 제4권1호
• /
• pp.67-74
• /
• 2003

디자인 패턴, 컴포넌트 기반 기법 등의 소프트웨어 개발기법 변화에 따라 웹 서버 시스템 개발 부분에서도 이를 도입하여 다양한 사용자 요구사항에 맞도록 능동적으로 대처하고 있다. 특히, EJB는 서버측 컴포넌트 모델로서 쉽고 다양한 개발지원으로 인하여 많은 연구 및 도입되고 있다. 또한, 컴포넌트 조립기법은 메시지 전달방법에 의한 아키텍처기반의 C2 스타일 아키텍처가 쉽고 효율적인 적용방안으로 많은 관심을 받고 있다. 그러나, 쓰레드를 호출 할 수 없는 EJB컴포넌트의 경우, C2 스타일 아키텍처에 의한 컴포넌트 합성을 위해서는 C2 프레임워크의 수정이 불가피하다. 이를 위해 패턴 중 구조패턴의 하나인 Adapter패턴을 이용한 기법을 제안하고자 한다. 즉, Adapter패턴에 의하여 쓰레드를 호츨할 수 있는 EJB로 변환함으로써 C2 스타일 아키텍처에 의한 컴포넌트 합성이 가능하도록 하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2762-2777
• /
• 2017

A fuzzy identity based signature (FIBS) scheme allows a signer with identity ${\omega}$ to generate a signature which could be verified under identity ${\omega}^{\prime}$ if and only if ${\omega}$ and ${\omega}^{\prime}$ are within a certain distance of each other as judged by some metric. In this paper, we propose an efficient FIBS scheme from lattice assumption, which can resist quantum-computer attacks. Without using the Bonsai Tree technique, we utilize the lattice basis delegation technique to generate the private key, which has the advantage of keeping the lattice dimension invariant. We also prove that our proposed scheme is existentially unforgeable under an adaptive chosen message and identity attack in the random oracle model. Compared with existing scheme, our proposed scheme is much more efficient, especially in terms of communication overhead. Since our FIBS scheme possesses similar error-tolerance property, it can be well applied in post-quantum communication biometric authentication environments, where biometric identifiers such as fingerprints, voice, iris and gait are used in human identification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4527-4547
• /
• 2018

Signcryption is a cryptographic primitive that provides authentication (signing) and confidentiality (encrypting) simultaneously at a lower computational cost and communication overhead. With the proposition of certificateless public key cryptography (CLPKC), certificateless signcryption (CLSC) scheme has gradually become a research hotspot and attracted extensive attentions. However, many of previous CLSC schemes are constructed based on time-consuming pairing operation, which is impractical for mobile devices with limited computation ability and battery capacity. Although researchers have proposed pairing-free CLSC schemes to solve the issue of efficiency, many of them are in fact still insecure. Therefore, the challenging problem is to keep the balance between efficiency and security in CLSC schemes. In this paper, several existing CLSC schemes are cryptanalyzed and a new CLSC scheme without pairing based on elliptic curve cryptosystem (ECC) is presented. The proposed CLSC scheme is provably secure against indistinguishability under adaptive chosen-ciphertext attack (IND-CCA2) and existential unforgeability under adaptive chosen-message attack (EUF-CMA) resting on Gap Diffie-Hellman (GDH) assumption and discrete logarithm problem in the random oracle model. Furthermore, the proposed scheme resists the ephemeral secret leakage (ESL) attack, public key replacement (PKR) attack, malicious but passive KGC (MPK) attack, and presents efficient computational overhead compared with the existing related CLSC schemes.

• 정보과학회 논문지
• /
• 제42권12호
• /
• pp.1467-1473
• /
• 2015

본 논문에서는 고성능 병렬 계산 장치로 주목받고 있는 GPU에서의 선형 합동 방식(linear congruential)의 병렬 난수 생성 프로그램을 구현하였다. 난수는 임의성을 필요로 하는 모든 분야에서 중요하게 사용되며, 선형 합동 난수 방식은 컴퓨터 계산을 통하여 생성되는 의사 난수(pseudo random numbers) 생성 방식 중에 가장 많이 사용되는 방식이다. 본 논문에서는 NVIDIA CUDA 프로그래밍 모델을 사용하여 구현된 프로그램 및 MPI를 사용한 다중 GPU를 구동하는 병렬프로그램을 설명하고, 생성된 난수들의 임의성과 성능을 알아보았다. 또한 원주율(${\pi}$)을 계산하기 위한 몬테카를로 알고리즘을 사용하여 CUDA 라이브러리 함수인 cuRAND와 성능을 비교하였으며, 다수의 GPU를 동시에 계산한 성능의 변화도 알아보았다.

• The Journal of Asian Finance, Economics and Business
• /
• 제7권11호
• /
• pp.413-419
• /
• 2020

This research focuses on the analysis of factors affecting the market share of retailers in Vietnam. This research uses Smith and Chaffey's (2005) 5Ss e-marketing model for analysis, which include Sell, Serve, Speak, Save, and Sizzle. Both quantitative and qualitative methods will be used to conduct the study. The researchers collected information from customers, managers, and directors in 25 retailers in Vietnam. A survey questionnaire was delivered to 15 people in each of the retailers who are customers, managers and directors. The researcher used the SPSS 16.0 software to analyze the data collected and in-depth interviews were carried out with the purpose of testing the hypothesis as well as the overall framework of the research. Out of the 375 questionnaires delivered, 360 were returned. The means of 23 items in the survey questionnaire ranged from 3.3733 to 4.3533 representing the outcome of the descriptive analysis. Research results showed that Cronbach's Alpha coefficient of five factors affecting the market share of the retailers is sizzle, save, sell, serve and speak. This research has proposed some implications for the market share of retailers, including technology enhancement for full message delivery, ways to approach target customers, and improving product diversity.

• 한국인터넷방송통신학회논문지
• /
• 제15권6호
• /
• pp.201-208
• /
• 2015

3차원 입체 방송을 가능하게 하기 위해서는 실세계에 존재하는 한 사물에 대한 깊이 정보를 획득하여야 한다. 따라서 본 논문에서는 네트워크 알고리즘인 신뢰확산(belief propagation) 알고리즘을 다해상도 영역에서 적용하여 3차원 정보의 근간이 되는 변이(disparity) 영상이나 깊이(depth)영상을 정확하면서도 빠르게 생성하는 것을 목적으로 한다. 신뢰확산 알고리즘은 기본적으로 여러 번의 반복을 통하여 변이정보를 보다 정확하게 갱신하게 되어 많은 연산량과 넓은 탐색영역으로 인하여 성능의 수렴까지 오랜 시간이 걸린다. 다해상도 변환은 공간영역과 주파수영역 모두에서 우수한 해상도를 갖기 때문에 이를 이용하여 스테레오 정합의 연산 속도를 증가시키고 성능을 향상시키는 것을 보여주었다.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2014년도 추계학술대회
• /
• pp.114-116
• /
• 2014

The interpolation of the missing AIS dynamic data can be used for predicting the lost data of the ship's state which is able to product the valuable information for analyzing and investigating the maritime accidents. The previous research proposed some interpolating methods however there exists some problem, firstly, the interpolated parameters such as COG, SOG, HDG weren't described sufficiently and accurately as in AIS message, secondly, each method is only suitable to some kinds of given AIS data, finally at heavy wind and current area, the parameters of AIS dynamic change quickly in short time, therefore, the modelling of the variation of ship's dynamic based on the physical characteristic is very difficult, in these cases the time-series and numerical method are usually better. This research proposes the other method through numerical analysis which can be suitable for many different kinds of the lost data, parameters are interpolated sufficiently, beside that this model is appropriate to all variation in short time interval. All the given AIS dynamic are regarded as the functions to time, then curves are established for fitting all data. Experiments are carried out to evaluate the performance of this approach, the interpolation results show this approach can be applied well in practice.

• ETRI Journal
• /
• 제37권4호
• /
• pp.696-706
• /
• 2015

This paper presents an achievable secure videoconferencing system based on quantum key encryption in which key management can be directly applied and embedded in a server/client videoconferencing model using, for example, OpenMeeting. A secure key management methodology is proposed to ensure both a trusted quantum network and a secure videoconferencing system. The proposed methodology presents architecture on how to share secret keys between key management servers and distant parties in a secure domain without transmitting any secrets over insecure channels. The advantages of the proposed secure key management methodology overcome the limitations of quantum point-to-point key sharing by simultaneously distributing keys to multiple users; thus, it makes quantum cryptography a more practical and secure solution. The time required for the encryption and decryption may cause a few seconds delay in video transmission, but this proposed method protects against adversary attacks.

• 대한임베디드공학회논문지
• /
• 제5권1호
• /
• pp.29-38
• /
• 2010

It is highly requested that the more complicated embedded software is used for high performance and multiple functions of the systems. This is inevitably increasing the errors. Therefore the embedded software testing is getting important recently. There are not general testing methods which are able to be applied for any embedded systems, but via this research, we introduce a testing method which is based on TTCN-3, a testing standard, for embedded systems. A testing environment for network-based embedded software is implemented with considering the features of TTCN-3 testing which is based on message exchange. The testing environment has two additional parts with TTCN-3 test system, the network analyzer to access the network-based systems and the communication interface which is suggested for embedded systems in previous work, and we have implemented the whole testing environment with interacting these two parts. In addition to the normal testing domain, called single node testing as a unit testing of V-model, we suggest another concept to test multiple nodes in network. It could be achieved by adding keywords such as supervisor and object which are describing the feature of TTCN-3 testing component and generating the TTCN-3 Executable code which contains new keywords. The testing has done for embedded software which is based on CAN network and the demonstration of the testing environment has been shown in this paper.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 추계학술대회 학술발표 논문집
• /
• pp.361-367
• /
• 1998

The main two applications of the Genetic Algorithms(GA) are the optimization and the machine learning. Machine Learning has two objectives that make the complex system learn its environment and produce the proper output of a system. The machine learning using the Genetic Algorithms is called GA machine learning or genetic-based machine learning (GBML). The machine learning is different from the optimization problems in finding the rule set. In optimization problems, the population of GA should converge into the best individual because optimization problems, the population of GA should converge into the best individual because their objective is the production of the individual near the optimal solution. On the contrary, the machine learning systems need to find the set of cooperative rules. There are two methods in GBML, Michigan method and Pittsburgh method. The former is that each rule is expressed with a string, the latter is that the set of rules is coded into a string. Th classifier system of Holland is the representative model of the Michigan method. The classifier systems arrange the strength of classifiers of classifier list using the message list. In this method, the real time process and on-line learning is possible because a set of rule is adjusted on-line. A classifier system has three major components: Performance system, apportionment of credit system, rule discovery system. In this paper, we solve the food search problem with the learning and evolution of an artificial ant using the learning classifier system.