• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2018년도 춘계학술대회
• /
• pp.709-711
• /
• 2018

최근 실버세대의 스마트폰 보급이 증가하고 있으나, 낮은 학습 및 경험 수준, 이해도로 인해 스마트폰 사용 시 어려움이 존재한다. 본 논문에서는 실버세대의 스마트폰 사용 지원을 위한 원격제어 UI 어플리케이션을 제안한다. 제안하는 어플리케이션의 경우 홈 화면에 피쳐 폰의 주요 기능들을 $3{\times}2$ 배열형태로 아이콘을 배열하여 빠른 인지가 가능하도록 하고 Node.js 서버와 Socket 통신을 통한 원격제어를 제공하여 부수적인 기능사용에 어려움을 겪을 시, 원격 제어를 통한 사용 지원이 가능하여 스마트폰을 사용하는 실버세대의 사용성과 이해도를 증대 시킬 수 있을 것으로 기대된다.

• 대한의용생체공학회:의공학회지
• /
• 제27권3호
• /
• pp.110-116
• /
• 2006

Finite element method (FEM) provides several advantages over other numerical methods such as boundary element method, since it allows truly volumetric analysis and incorporation of realistic electrical conductivity values. Finite element mesh generation is the first requirement in such in FEM to represent the volumetric domain of interest with numerous finite elements accurately. However, conventional mesh generators and approaches offered by commercial packages do not generate meshes that are content-adaptive to the contents of given images. In this paper, we present software that has been implemented to generate content-adaptive finite element meshes (cMESHes) based on the contents of MR images. The software offers various computational tools for cMESH generation from multi-slice MR images. The software named as the Content-adaptive FE Mesh Generation Toolbox runs under the commercially available technical computation software called Matlab. The major routines in the toolbox include anisotropic filtering of MR images, feature map generation, content-adaptive node generation, Delaunay tessellation, and MRI segmentation for the head conductivity modeling. The presented tools should be useful to researchers who wish to generate efficient mesh models from a set of MR images. The toolbox is available upon request made to the Functional and Metabolic Imaging Center or Bio-imaging Laboratory at Kyung Hee University in Korea.

• 정보기술과데이타베이스저널
• /
• 제7권2호
• /
• pp.17-32
• /
• 2000

As XML emerging as the Internet electronic document language standard of the next generation, the number of XML documents which contain vast amount of Information is increasing substantially through the transformation of existing documents to XML documents or the appearance of new XML documents. Consequently, XML document retrieval system becomes extremely essential for searching through a large quantity of XML documents that are storied in and managed by DBMS. In this paper we describe the design and implementation of BADA-IV/XML query processor that supports content-based, structure-based and attribute-based retrieval. We design XML query language based upon XQL (XML Query Language) of W3C and tightly-coupled with OQL (a query language for object-oriented database). XML document is stored and maintained in BADA-IV, which is an object-oriented database management system developed by ETRI (Electronics and Telecommunications Research Institute) The storage data model is based on DOM (Document Object Model), therefore the retrieval of XML documents is executed basically using DOM tree traversal. We improve the search performance using Node ID which represents node's hierarchy information in an XML document. Assuming that DOW tree is a complete k-ary tree, we show that Node ID technique is superior to DOM tree traversal from the viewpoint of node fetch counts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권5호
• /
• pp.265-277
• /
• 2008

In spite of previous common assumptions about the incompatibility of public key cryptography (PKC) schemes with wireless sensor networks (WSNs), recent works have shown that they can be utilized for such networks in some manner. The major challenge of employing a PKC-based scheme in a wireless sensor network is posed by the resource limitations of the tiny sensors. Considering this sensor feature, in this paper we propose an efficient PKC-based security architecture with relatively lower resource requirements than those of previously proposed PKC schemes for WSN. In addition, our scheme aims to provide robust security in the network. Our security architecture comprises two basic components; a key handshaking scheme based on simple, linear operations and the derivation of a decryption key by a receiver node. Our architecture enables node-to-base-station and node-to-node secure communications. Analysis and simulation results show that our proposed architecture ensures a good level of security for network communications, and can be effectively implemented with the limited computational, memory, and energy budgets of current-generation sensor nodes.

• 한국군사과학기술학회지
• /
• 제16권1호
• /
• pp.56-64
• /
• 2013

TICN, a next-generation tactical communication network based on a wireless network, acts as the backbone of the whole network. TICN requires the routing which takes both survivability of passage, reliability, and safety of wireless link into consideration. A tactical network like TICN may maintain the passage for just a short period of time due to topology's frequent changes; In this process all nodes, dependent on batteries for their necessary energy, are restricted by batteries' durability in due course. To overcome this shortcoming, the up-to-date protocols consider only either of diminishing or balancing out energy consumptions. Thus there was a limitation to enhancing both throughput and energy efficiency. The thesis proposes a protocol which regards both throughput and energy efficiency, and enhances node survivability by means of minimizing and balancing energy consumption of the whole network. The protocol brings out an improvement in throughput and makes each node's energy usage more effective.

• 대한교통학회지
• /
• 제22권2호
• /
• pp.121-130
• /
• 2004

통행자들에게 과거, 실시간 혹은 예측 노선 정보 제공을 위한 정보 생성과 교통정보에 의한 교통영향 분석이 가능한 시뮬레이션 프로그램 개발에 관한 연구가 ITS 분야의 활발한 연구와 함께 과거 10여년에 걸쳐 진행되어 왔다. 또한 링크기반(link-based)이 아닌 경로기반(Path-based)인 동적 확률적 노선배정 기법이 ITS 정책의 교통체계 상의 영향을 분석하는데 적합성이 높고, 또한 현실적 현상에 대한 설명력이 높다고 고려되어 이 분야에 대한 연구가 역시 활발해지고 있다. 이와 같은 현실적 노선정보의 생성, 교통체계분석을 위한 시뮬레이션 프로그램 개발 및 확률적 노선배정 기법 개발을 위한 핵심적 알고리즘 중의 하나가 합리적인 다경로 탐색 알고리즘인 것이다. 다경로 탐색 알고리즘에 대한 필요성과 요구가 커짐에 따라 현재까지 K-shortest path 알고리즘에 관하여 여러 학자들이 연구하여 왔다. 기존 연구 대부분의 알고리즘이 링크 제거 방법, 링크 저항가중 방법 및 시뮬레이션 방법에 의한 것이거나, 노선선택의 기준을 다양하게 변화시키는 방법 등을 적용하여 다경로를 탐색하는 방법을 제안하였다. 하지만 아직도 이 중에 어떠한 방법도 학자들 간에 공론화되어, 실무적으로 보편화되어 적용하는 방법은 없다고 고려된다. 본 연구에서는 기존의 K-shortest 탐색 알고리즘보다는 좀 더 행태적 접근방법을 접목시키는 다른 접근방법을 제안하였다. 즉 링크를 제거하는 등과 같이 교통 네트워크를 변경하지 않으며, 링크의 속성을 임의적으로 변경하지도 않으면서, 노선 선택의 동일한 기준을 일관되게 적용하면서도 다경로를 탐색하는 알고리즘을 제안하였다. 제안된 알고리즘의 핵심은 각 노드에 도달하는 각 방향별 경로에 대해 "이성적 한계범위(rational upper boundary)"라는 통행자들의 행태적 개념을 도입하여, 합리적인 대안 경로의 집합을 선정하는 방법인 것이다. 기존에 개발된 수정형 덩굴망 최단경로 탐색 알고리즘을 기반으로 한 다경로 생성 알고리즘을 제안하였다. 또한 본 논문에서는 다경로 생성 알고리즘의 개념의 이해를 돕기 위해 단순 네트워크를 예제로 합리적 대안경로 집합을 역추적 생성하는 과정을 단계별로 추가 설명하였다.

• Industrial Engineering and Management Systems
• /
• 제3권2호
• /
• pp.92-99
• /
• 2004

We consider the ATM switching node location problem (ANLP). In this problem, there are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities. We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub via installed remote facilities with minimum cost, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we present a preprocessing procedure to tighten the formulation and develop a branch-and-price algorithm. In the algorithm, we consider the integer knapsack problem as the column generation problem. Computational experiments show that the algorithm gives optimal solutions in a reasonable time.

• Management Science and Financial Engineering
• /
• 제18권1호
• /
• pp.27-37
• /
• 2012

This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3414-3434
• /
• 2016

Classical key generation is complicated to update and key distribution generally requires fixed infrastructures. In order to eliminate these restrictions researchers have focused much attention on physical-layer (PHY-layer) based key generation methods. In this paper, we present a PHY-layer fingerprints based fuzzy key generation scheme, which works to prevent primary user emulation (PUE) attacks and spectrum sensing data falsification (SSDF) attacks, with multi-node collaborative defense strategies. We also propose two algorithms, the EA algorithm and the TA algorithm, to defend against eavesdropping attacks and tampering attacks in mobile cognitive radio networks (CRNs). We give security analyses of these algorithms in both the spatial and temporal domains, and prove the upper bound of the entropy loss in theory. We present a simulation result based on a MIMO-OFDM communication system which shows that the channel response characteristics received by legitimates tend to be consistent and phase characteristics are much more robust for key generation in mobile CRNs. In addition, NIST statistical tests show that the generated key in our proposed approach is secure and reliable.

• 한국태양에너지학회 논문집
• /
• 제26권1호
• /
• pp.41-47
• /
• 2006

Moisture in a building is one of the most important variables influencing building performance, human health, and comfort of indoor environment. However, there are still lacks in the knowledge of understanding the moisture problem well and controlling moisture. Accordingly, in order to provide the fundamental data to control moisture contents in the indoor air, this study was to predict moisture contents transferred through building envelopes and indoor moisture generation rate. Moisture transfer model was made by physical relations in each node, and the indoor moisture generation rate was gained by comparing the model with experimental analyses. From the study, we found out that moisture generation rate was critical and day-periodic, so that we predicted the indoor moisture content by substituting the constant value gained from the average in a day for the moisture generation rate.