• Annual Conference of KIPS
• /
• 2002.04a
• /
• pp.485-488
• /
• 2002

J2EE 기반의 웹 애플리케이션의 개발의 장점은 개발자로 하여금 시스템적 문제들에 대한 부담을 절감시켜 비즈니스 로직 개발에 중점을 두도록 하는데 있다. 그러나 시스템적 문제들에 대한 부담은 많이 사라진 반면 실질적인 비즈니스 로직을 개발하는 개발자가 프리젠테이션 계층의 개발 부분에도 참여해야 하고 프리젠테이션 계층에서 사용되는 여러 기술들도 익혀야 하는 부담을 가지게 된다. 따라서 본 연구에서는 이러한 부담을 최소화하고, 웹 애플리케이션 프리젠테이션 계층 프레임워크를 신뢰성 있게 구축하며 프레임워크를 자동 생성하고자 프레임워크를 명세하여 XML 기반의 문서로 변환한다. 이렇게 함으로써 웹 애플리케이션 서버에 의존적인 것들과 또 다른 많은 것들을 확장할 수 있는 여지를 남겨둠으로써 사용자의 편이성을 증가시킬 수 있다.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1987-1988
• /
• 2006

본 논문에서는 필드버스를 이용한 지능형 전송기의 FOUNDATION 필드버스 응용계층에 관해 설계하였다. 필드버스 전송기에는 물리계층 데이터링크 계층 응용계층이 있는데 여기서는 응용 계층 중에서 FAS(Fieldbus Access Sublayer)에 대해서만 설명하고자 한다. FAS는 DLL(Data Link Layer) 계층과 응용 계층인 FMS(Fieldbus Message Specification)간에 인터페이스 기능을 수행한다. FMS에서 생성된 메시지가 DLL에서 제공하는 토큰 패싱 또는 스케줄 방식을 통해서 전송되기 위해서는 전송단과 수신단간에 통신관계가 설정되어야 하며, 이러한 기능이 FAS 계층에서 수행된다. FAS에서 통신관계를 설정하기 위한 서비스 종류는 VCR(Virtual Communication Relationship)에 의하여 결정된다. 하드웨어 설계 부분에 대해서는 본 논문에서 설명하지 않았다.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.641-647
• /
• 2017

In this paper, we propose a method to automatically generate a configured song with melodies composed of front/middle/last parts by using hierarchical artificial neural networks in automatic composition. In the first layer, an artificial neural network is used to learn an existing song or a random melody and outputs a song after performing rhythm post-processing. In the second layer, the melody created by the artificial neural network in the first layer is learned by three artificial neural networks of front/middle/last parts in the second layer in order to make a configured song. In the artificial neural network of the second layer, we applied a method to generate repeatability using measure identity in order to make song with repeatability and after that the song is completed after rhythm, chord, tonality post-processing. It was confirmed from experiments that our proposed method produced configured songs well.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3064-3074
• /
• 2000

Lately computing environment is changing into integrating open system Some corporations and research institutions are still using old codes and not dealing with the rapid canging environment actively. Also several software developers have difficulties with the problems of productivity and translating old codes. This paper proposes Integration Object Management Model to deal with the rapid changing environment effectively and to improe productivity about new software development. The model is divided into three layers the first layer classifies and displays information to users, the second layer controls function, the integrationand management layer, and the last layer manages data, the object management stroage later. So it designs and implenments F77/J++ Generator system(FORTRAN77/Java code generator) for Integrated Object Management Model. The generator helps to translate old codes into new codes in redesigning the business and promoting productivity. In consists of nine-stage strategies using reengineering. This might support agterward protolyping in maximizing the reuse of software, which is advanlage to the integrationof the system and in pro,oting its productivity.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1155-1160
• /
• 2013

The rapid growth of smart phones has made location-based services (LBSs) widely available. However, the use of LBS can raise privacy issues, as LBS can allow adversaries to violate the location privacy of users. There has been a considerable amount of research on preserving user location privacy. Most of these studies try to preserve location privacy by achieving what is known as location K-anonymity. In this paper, we propose a hierarchical clustering-based spatial cloaking algorithm for LBSs. The proposed algorithm constructs a tree using a modified version of agglomerative hierarchical clustering. The experimental results show, in terms of the ASR size, that the proposed algorithm is better than Hilbert Cloak and comparable to RC-AR (R-tree Cloak implementation of Reciprocal with an Asymmetric R-tree split). In terms of the ASR generation time, the proposed algorithm is much better in its performance than RC-AR and similar in performance to Hilbert Cloak.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.617-619
• /
• 2018

In this paper, We suggest a face image generating GAN model which is improved by an additive discriminator. This discriminator is trained to be specialized in preventing frequent mistake of generator. To verify the model suggested, we used $^*Inception$ score. We used 155,680 images of $^*celebA$ which is frontal face. We earned average 1.742p at Inception score and it is much better score compare to previous model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.465-472
• /
• 2004

Proxy signatures is a signature scheme that an original signer delegates one's signature capability to a proxy signer, and then the proxy signer creates a signature on behalf of the original signer. Delegation of authority is a common practice in the real world, in particular, it happens naturally in hierarchical groups such as company, bank and army, etc. In this paper, we propose a new dynamic multi-proxy signature scheme allowing repetitive delegations in a hierarchical group. We adopt multi-proxy signatures to enhance the security of proxy signature. In multi-proxy signatures, plural proxy signers can generate a valid proxy signature collectively on behalf of one original signer. In our scheme, the proxy group is not fixed but constructed dynamically according to some situations. Delegations are processed from higher level to lower level in the hierarchy using delegation tickets. When the original signer wants to delegate one's signature authority, the original signer generates a delegation ticket based on secret sharing and Diffie-Hellman problems. The delegation ticket is shared among proxy signers and then all the proxy signers can generate a valid proxy signature collectively by reconstructing the original signer's delegation ticket. If a certain proxy signer can not attend the proxy signature generating protocol, the proxy signer can also delegate repetitively his partial signature authority to the lower level participants, and then the proxies are constructed dynamically.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.61-76
• /
• 2015

In general, we have utilized the hierarchical concept tree as a crucial data structure for indexing huge amount of textual data. This paper proposes a generality rank-based method that can automatically develop hierarchical concept structures with the Wikipedia data. The goal of the method is to regard each of Wikipedia articles as a concept and to generate hierarchical relationships among concepts. In order to estimate the generality of concepts, we have devised a special ranking function that mainly uses the number of hyperlinks among Wikipedia articles. The ranking function is effectively used for computing the probabilistic subsumption among concepts, which allows to generate relatively more stable hierarchical structures. Eventually, a set of concept pairs with hierarchical relationship is visualized as a DAG (directed acyclic graph). Through the empirical analysis using the concept hierarchy of Open Directory Project, we proved that the proposed method outperforms a representative baseline method and it can automatically extract concept hierarchies with high accuracy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.236-238
• /
• 2000

현재 대부분의 사람들은 자신의 원하는 정보를 찾기 위하여 먼저 사이버공간을 이용한다. 웹 브라우저를 이용하여 망망대해와 같은 거대한 정보의 바다인 인터넷을 항해하는 것이다. 그러나 인터넷에 등록되는 정보의 양은 기하급수적으로 증가하고 있어, 우리가 원하는 정보를 짧은 시간에 찾기가 점점 어려워지고 있다. 따라서 사용자가 웹에서 정보를 탐색할 때, 웹사이트에서 여러 단계의 복잡한 계층구조들을 탐색하는데 많은 시간을 소비하지 않고, 본인이 관심과 흥미를 가지고 있는 유용한 정보를 쉽게 선택할 수 있는 방법이 필요하다. 본 논문에서는 사용자가 검색하고자 하는 웹사이트의 계층적 목차 디렉토리(Hierarchical Directory of Contents)를 자동으로 생성하는 에이전트(HDOCA)에 관해 연구하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.217-219
• /
• 2002

스포츠 경기의 하이라이트(highlight) 브라우징을 위해 하이라이트 이벤트(주요 사건)와 하이라이트 객체(선수)를 묘사하는 하이라이트 테마를 계층구조로 정의하고, 이를 이용해 하이라이트 세그먼트를 설정하고, 자동적으로 계층구조의 하이라이트 메타데이타를 생성하는 하이라이트 인덱싱 방법을 제안하였다. 하이라이트에 관련된 모든 메타데이타는 MPEG-7으로 기술하였다. 그리고 제안한 방법으로 생성된 메타데이타를 이용한 set-top box용 하이라이트 브라우저를 구현하였다.