• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.38-57
• /
• 2016

Service discovery is one of the major challenges in cloud computing environment with a large number of service providers and heterogeneous services. Non-uniform naming conventions, varied types and features of services make cloud service discovery a grueling problem. With the proliferation of cloud services, it has been laborious to find services, especially from Internet-based service repositories. To address this issue, services are crawled and clustered according to their similarity. The clustered services are maintained as a catalogue in which the data published on the cloud provider's website are stored in a standard format. As there is no standard specification and a description language for cloud services, new efficient and intelligent mechanisms to discover cloud services are strongly required and desired. This paper also proposes a key-value representation to describe cloud services in a formal way and to facilitate matching between offered services and demand. Since naïve users prefer to have a query in natural language, semantic approaches are used to close the gap between the ambiguous user requirements and the service specifications. Experimental evaluation measured in terms of precision and recall of retrieved services shows that the proposed approach outperforms existing methods.

• 방송공학회논문지
• /
• 제16권5호
• /
• pp.782-792
• /
• 2011

In this paper, we address a new fast DCT-II/DFT/HWT hybrid transform architecture for digital video and fusion mobile handsets based on Jacket-like sparse matrix decomposition. This fast hybrid architecture is consist of source coding standard as MPEG-4, JPEG 2000 and digital filtering discrete Fourier transform, and has two operations: one is block-wise inverse Jacket matrix (BIJM) for DCT-II, and the other is element-wise inverse Jacket matrix (EIJM) for DFT/HWT. They have similar recursive computational fashion, which mean all of them can be decomposed to Kronecker products of an identity Hadamard matrix and a successively lower order sparse matrix. Based on this trait, we can develop a single chip of fast hybrid algorithm architecture for intelligent mobile handsets.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.365-368
• /
• 2008

This paper presents a new concept of IP-based wireless sensor networks and also introduces a routing protocol that is based on clustering for global healthcare information system. Low-power wireless personal area networks (LoWPANs) conform the standard by IEEE 802.15.4-2003 to IPv6 that makes 6lowpan. It characterized by low bit rate, low power, and low cost as well as protocol for wireless connections. The 6lowpan node with biomedical sensor devices fixed on the patient body area network that should be connected to the gateway in personal area network. Each 6lowpan nodes have IP-addresses that would be directly connected to the internet. With the help of IP-address service provider can recognize or analysis patient biomedical data from anywhere on globe by internet service provider equipments such as cell phone, PDA, note book. The system has been evaluated by technical verification, clinical test, user survey and current status of patient. We used NS-2.33 simulator for our prototype and also simulate the routing protocols. The result shows the performance of biomedical data packets in multi-hope routing as well as represents the topology of the networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.968-988
• /
• 2010

Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key, and it additionally provide the anonymity of identity in ciphertexts. Using the anonymous HIBE schemes, it is possible to construct anonymous communication systems and public key encryption with keyword search. This paper presents an anonymous HIBE scheme with constant size ciphertexts under prime order symmetric bilinear groups, and shows that it is secure under the selective security model. Previous anonymous HIBE schemes were constructed to have linear size ciphertexts, to use composite order bilinear groups, or to use asymmetric bilinear groups that is a special type of bilinear groups. Our construction is the first efficient anonymous HIBE scheme that has constant size ciphertexts and that uses prime order symmetric bilinear groups. Compared to the previous scheme of composite order bilinear groups, ours is ten times faster. To achieve our construction, we first devise a novel cancelable random blinding technique. The random blinding property of our technique provides the anonymity of our construction, and the cancellation property of our technique enables decryption.

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

Content-Centric Networking (CCN) is a new Internet architecture with routing and caching centered on contents. Through its receiver-driven and connectionless communication model, CCN natively supports the seamless mobility of nodes and scalable content acquisition. In-network caching is one of the core technologies in CCN, and the research of efficient caching scheme becomes increasingly attractive. To address the problem of unbalanced cache load distribution in some existing caching strategies, this paper presents a neighbor cooperation based in-network caching scheme. In this scheme, the node with the highest betweenness centrality in the content delivery path is selected as the central caching node and the area of its ego network is selected as the caching area. When the caching node has no sufficient resource, part of its cached contents will be picked out and transferred to the appropriate neighbor by comprehensively considering the factors, such as available node cache, cache replacement rate and link stability between nodes. Simulation results show that our scheme can effectively enhance the utilization of cache resources and improve cache hit rate and average access cost.

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

The purpose of this work is to solve the problem of representing an entire video using Convolutional Neural Network (CNN) features for human action recognition. Recently, due to insufficient GPU memory, it has been difficult to take the whole video as the input of the CNN for end-to-end learning. A typical method is to use sampled video frames as inputs and corresponding labels as supervision. One major issue of this popular approach is that the local samples may not contain the information indicated by the global labels and sufficient motion information. To address this issue, we propose a binary hashing method to enhance the local feature extractors. First, we extract the local features and aggregate them into global features using maximum/minimum pooling. Second, we use the binary hashing method to capture the motion features. Finally, we concatenate the hashing features with global features using different normalization methods to train the classifier. Experimental results on the JHMDB and MPII-Cooking datasets show that, for these new local features, binary hashing mapping on the sparsely sampled features led to significant performance improvements.

• 한국컴퓨터정보학회논문지
• /
• 제13권3호
• /
• pp.91-97
• /
• 2008

기존 CA(Certificate Authority)에서 인증서의 유효기간 및 클라이언트에서 폐지한 CRI (Certificate Revocation Information)를 관리하는데 있어서 많은 문제점이 있었다. 이를 해결하기 위한 여러 연구들이 행하여졌으나, 클라이언트 측면에서 인증서의 상태 정보를 실시간으로 검증할 수 있기에는 미흡하였다. 본 논문은 이러한 한계를 극복하기 위하여 분산 OCSP(On-line Certificate Status Protocol) 환경에서 새로운 CRI 운영 모델을 제안한다. CRL(Certificate Revocation Lists)을 분할하여 여러 OCSP 서버에게 최신의 CRL을 중복시키고, 그 외 CRL은 각 서버들에게 중복하여 분산시킨다. 이로써 기존의 CA의 병목현상을 줄이고, 전송되는 CRL의 크기도 효과적으로 줄임으로써 클라이언트가 인증서 상태를 실시간으로 검증할 수 있다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.848-851
• /
• 2005

인터넷상의 주소 고갈 문제를 해결하기 위해 기존의 IPv4 네트워크를 IPv6 네트워크로 도입하려는 계획이 국내외에서 단계적으로 추진되고 있다. IPv6 네트워크 도입으로 인해 IP 주소 부족 문제는 해결될 수 있으나 기존에 존재하던 네트워크 보안상의 문제점과는 또 다른 형태의 네트워크 공격이 야기될 수 있다는 위험성이 잠재되어 있다. 따라서, 본 논문에서는 IPv6 네트워크 환경에서 발생될 수 있는 네트워크 공격을 차단하기 위한 선행 과정인 IPv6 기반의 트래픽을 효율적으로 분석하는 도구를 제안한다. 구현된 IPv6 트래픽 분석 도구는 IPv6 헤더를 이용하여 트래픽 분석 및 공격을 검출하는 방식으로 공격 검출은 추정 가능한 공격에 대해 제안한 탐지 알고리즘을 이용하고 있다.

• Journal of Power Electronics
• /
• 제19권2호
• /
• pp.353-362
• /
• 2019

To address the problem of circulating current loss in the traditional zero-current switching (ZCS) full-bridge (FB) DC/DC converter, a ZCS FB DC/DC converter topology and modulation strategy is proposed in this paper. The strategy can achieve ZCS turn on and zero-voltage and zero-current switching (ZVZCS) turn off for the primary switches and realize ZVZCS turn on and zero-voltage switching (ZVS) turn off for the auxiliary switches. Moreover, its resonant circuit power is small. Compared with the traditional phase shift full-bridge converter, the new converter decreases circulating current loss and does not increase the current stress of the primary switches and the voltage stress of the rectifier diodes. The diodes turn off naturally when the current decreases to zero. Thus, neither reverse recovery current nor loss on diodes occurs. In this paper, we analyzed the operating principle, steady-state characteristics and soft-switching conditions and range of the converter in detail. A 740 V/1 kW, 100 kHz experimental prototype was established, verifying the effectiveness of the converter through experimental results.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권9호
• /
• pp.514-526
• /
• 2004

최근 마이크로어레이 실험기술의 개발로 인해서 생물학자들은 한꺼번에 수천 혹은 수만 개의 유전자 발현실험이 가능하게 되었다. 마이크로어레이를 이용한 유전자 발현 패턴 분석에 필요한 이미지의 분석 작업은 사용자의 많은 수작업이 필요하며, 올바른 결과를 얻기 위해서 많은 주의가 필요하다. 그러므로 사용자의 수작업을 최소화하고 정확한 발현결과를 얻기 위해서 마이크로어레이 이미지의 자동 분석 방법이 필요하다. 일반적으로 마이크로어레이 데이타는 반점(spot) 위치의 변동이나 모양, 크기가 고르지 않는 것과 같은 다양한 문제로 인하여 자동 분석이 어렵다. 특히 블록과 반점의 주소를 결정하는 것은 마이크로어레이 분석 중 어려운 단계이며, 대부분 상용 프로그램에서는 수작업을 통해서 해결하거나, 수작업이 필요한 반자동시스템을 이용하고 있다. 본 논문에서는 균일 격자(regular grid) 구조 탐색을 이용하여 새로운 블록과 반점의 주소를 결정하는 알고리즘을 소개한다. 본 알고리즘에서는 입력된 반점들의 중심점을 이용하여, 균등 일직선 서열(equally spaced and collinear sequence)을 생성하고 이를 통하여 이미지의 기울기와 단위길이를 계산한다. 계산되어진 기울기와 단위길이를 이용하여 가상점을 허용한 균등 일직선서열을 다시 생성하고, 이를 이용하여 마이크로어레이의 주소를 결정한다. 실험 결과 다양한 실험 데이터에 대하여 매우 안정적이며, 신뢰성이 높은 결과를 얻을 수 있었다. 본 알고리즘에 대한 자세한 정보는 http://jade.cs.pusan.ac.kr/~autogrid에 정리되어 있다.