• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.48-51
• /
• 2017

빅데이터는 저장되지 않았거나 저장되더라도 분석되지 못하고 버리게 되는 방대한 양의 데이터를 말한다. 실제로도 빅데이터는 페이스북, 트위터등의 소셜 네트워크에서 많이 발생하고 있는데, 이러한 방대한 데이터들을 어떻게 효율적으로 저장하고 분석하는지에 대한 관심이 많아지고 있다. 따라서 본 논문에서는 빅데이터의 개념, 빅데이터의 향후 동향과 이슈들에 대해 살펴보고, 빅데이터 시스템이 데이터를 수집하고 저장하는 것에 대한 고려할만한 사항들과 효율적인 해결방안에 대해 제시하였다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.274-280
• /
• 2011

Due to their rapid growth and new paradigm applications, wireless sensor networks(WSNs) are morphing into low power personal area networks(LoWPANs), which are envisioned to grow radically. The fragmentation and reassembly of IP data packet is one of the most important function in the 6LoWPAN based communication between Internet and wireless sensor network. However, since the 6LoWPAN data unit size is 102 byte for IPv6 MTU size is 1200 byte, it increases the number of fragmentation and reassembly. In order to reduce the number of fragmentation and reassembly, this paper presents a new scheme that can be applicable to 6LoWPAN. When a fragmented packet header is constructed, we can have more space for data. This is because we use 8-bits routing table ill instead of 16-bits or 54-bits MAC address to decide the destination node. Analysis shows that our design has roughly 7% or 22% less transmission number of fragmented packets, depending on MAC address size(16-bits or 54-bits), compared with the previously proposed scheme in RFC4944. The reduced fragmented packet transmission means a low power consumption since the packet transmission is the very high power function in wireless sensor networks. Therefore the presented fragmented transmission scheme is well suited for low-power wireless sensor networks.

• Journal of the Korean Society for Railway
• /
• v.17 no.2
• /
• pp.140-147
• /
• 2014

Line planning is an important step to determine the optimal frequencies of trains given the forecasted demand for each train type. The main input data for line planning is the leg traffic demand which can be derived using suitable traffic assignment models. However most assignment models require a line plan, in other words, train frequencies or headways, so that inconsistent results just by the procedural approach to find an optimal line plan after determining leg traffic can be avoided. This paper suggests a unified model that can consider the traffic assignment and line planning, simultaneously. We further provide an elaborated approximation algorithm and, finally, provide experimental results determined for the Korean railway network.

• Journal of the Economic Geographical Society of Korea
• /
• v.2 no.1_2
• /
• pp.83-102
• /
• 1999

The aim of this paper is to explore the trend and structural features of unemployment in Germany and to review the local and regional labour market policy against the unemployment. Unemployment has been one of the major issues in Germany since the oil shocks oi 1973-74 and 1978-80. The unemployment rate in western Germany was low at the time of reunification in 1990 and the next consecutive two years. Since then, the unemployment rate has sharply risen due to the restructuring of industries. In an effort to reduce the unemployment and to search (or new employment policies, the specific roles and advantages of communal units have been appreciated. The local and/or regional labour market policies are characterized as fellows: the corporative networking of all the agents including local administration, education institutes, regional labour bureau, firms and interest groups; the systematic integration of the various instruments which have been separately installed by different sectors; and the target-oriented adjustment of labour market approaches in the local circumstances.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.63-72
• /
• 2013

Business Process Intelligence (BPI) is one of the emerging technologies in the knowledge discovery and analysis area. BPI deals with a series of techniques from discovering knowledge to analyzing the discovered knowledge in BPM-supported organizations. By means of the BPI technology, we are able to provide the full functionality of control, monitoring, prediction, and optimization of process-supported organizational knowledge. Particularly, we focus on the focal organizational knowledge, which is so-called the BPM activity-performer affiliation networking knowledge that represents the affiliated relationships between performers and activities in enacting a specific business process model. That is, in this paper we devise a statistical analysis method to be applied to the BPM activity-performer affiliation networking knowledge, and dubbed it the activity-performer correspondence analysis method. The devised method consists of a series of pipelined phases from the generation of a bipartite matrix to the visualization of the analysis result, and through the method we are eventually able to analyze the degree of correspondences between a group of performers and a group of activities involved in a business process model or a package of business process models. Conclusively, we strongly expect the effectiveness and efficiency of the human resources allotments, and the improvement of the correlational degree between business activities and performers, in planning and designing business process models and packages for the BPM-supported organization, through the activity-performer correspondence analysis method.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.482-489
• /
• 2004

Paging extensions for Mobile IP was proposed to avoid unnecessary registration signaling overhead of Mobile IP. In order to support the paging function in Mobile IP, the slates of a mobile node arc divided into active on, active off, idle. The active on state means when any incoming or outgoing data session arrives to a mobile node. After data session is completed, the state of the motile node is changed into active off from active on. At this moment, the active timer starts to be operated. If the active timer expires, the mobile node moves to idle state. If a mobile node has very frequently data sessions at the same cell, the mobile node is better to move slowly into idle state. The other way, if the mobile node very frequently moves into new cell area and receives or sends little data, the mobile node is better to move earlier into idle state. In this raper, the active timer is adaptively set by the mobile nodes traffic and mobility characteristics and the paging scheme using this active timer is proposed to reduce the location registration cost.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1320-1331
• /
• 2004

A video adaptation system translates the source video stream into appropriate video stream while satisfying the network and client constraints and maximizing the video quality as much as possible. This paper proposes a semi-dynamic video adaptation scheme, in which several intermediate video streams and the information for the measuring of video quality are generated statically. The intermediate video streams are generated by reducing the resolution of the video stream by a power of two several times, and they are stored as the intermediate video streams on the video server. The statically generated information for the input video stream consists of the degrees of smoothness for each frame rate and the degree of frame definition for each pixel bit rate. It helps to dynamically generate the target video stream according to the client's QoS at run-time as quickly as possible. Experimental result shows that the proposed adaptation scheme can generate the target video stream about thirty times faster while keeping the quality degradation as less than 2% comparing to the target video stream that is totally dynamically generated, although the extra storages for the intermediate video streams are required.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.322-332
• /
• 2017

Wireless Body Area Networks is an environment that provides an appropriate service remotely by collecting user's biometric information. With the growing importance of sensor, WBAN also attracts extensive attention. Since WBAN is representatively used in the medical field, it can be directly related to the patient's life. Hence security is very important in WBAN. Mutual authentication between the client and the application provider is essential. And efficiency is also important because a used device is limited to computation cost. In this reason, ID-based anonymous authentication scheme in WBAN has been intensively studied. We show that the recent research result of Wu et al. which is about the ID-based anonymous authentication scheme is vulnerable to impersonation attack. And we propose a new ID-based anonymous authentication scheme that is secure against the attacks discovered in the existing schemes. Compared to the existing schemes, the computation cost of our scheme is improved by 30.6% and 7.3%.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.11
• /
• pp.377-386
• /
• 2020

Mobile cloud computing involves mobile or embedded devices as clients, and features small devices with constrained resource and low availability. Due to the fast expansion of smart phones and smart peripheral devices, researches on mobile cloud computing attract academia's interest more than ever. Computation offloading, or code offloading, enhances the performance of computation by migrating a part of computation of a mobile system to nearby cloud servers with more computational resources through wired or wireless networks. Code offloading is considered as one of the best approaches overcoming the limited resources of mobile systems. In this paper, we analyze the factors and the performance of code offloading, especially focusing on static program partitioning and data protection. We survey state-of-the-art researches on analyzed topics. We also describe directions for future research.