• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.518-526
• /
• 2013

The notion of computational thinking is currently gaining much attention from a variety of disciplines. Accordingly, computer education community needs to address this issue for formal education. In the paper, the translation issue on the terminology - 'computational thinking' - is discussed. As a brief introduction to computational thinking the characteristics and necessities as well as its importance are presented. The types of learning computational thinking are presented, which are learning with computing tools on one hand and without them on the other hand. Furthermore, learning objectives of computational thinking as well as the contents are also investigated for the application of computational thinking in elementary education. A survey was conducted for thirty three elementary school teachers on behalf of investigating directions of teaching computational thinking in elementary education. It shows that almost all respondents agree to teaching computational thinking in formal education and it also shows other interesting results as stated in the paper.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.27-34
• /
• 2010

Web crawlers are fundamental programs which iteratively download web pages by following links of web pages starting from a small set of initial URLs. Previously several web crawling orderings have been proposed to crawl popular web pages in preference to other pages, but some graph search techniques whose characteristics and efficient implementations had been studied in graph theory community have not been applied yet for web crawling orderings. In this paper we consider various graph search techniques including lexicographic breadth-first search, lexicographic depth-first search and maximum cardinality search as well as well-known breadth-first search and depth-first search, and then choose effective web crawling orderings which have linear time complexity and crawl popular pages early. Especially, for maximum cardinality search and lexicographic breadth-first search whose implementations are non-trivial, we propose linear-time web crawling orderings by applying the partition refinement method. Experimental results show that maximum cardinality search has desirable properties in both time complexity and the quality of crawled pages.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.411-418
• /
• 2003

After the general and multi-function PC age is gone, A new type of computing devices is developing. The need of consumer increases a new device with very necessary function instead of all-mighty functional PC. The operating system of this works is linux because of open source licensing and a strong developer community. The Post PC industry represents and environment that will foster dramatic growth and new development. The adoption of embedded linux in this market will not be driven by simple replacement of expensive proprietary operating systems. In this paper we describe the practical design and implementation project of Post-PC Platform. We illustrate "the development of digital consumer Post-PC platform technology," focus the fourth project, and describe the development works of this project.s project.

• Journal of Internet Computing and Services
• /
• v.21 no.1
• /
• pp.71-78
• /
• 2020

Recently, as the issue of gentrification emerges, it becomes important to understand the dynamics of local commercial district, which plays the important role for facilitating the local economy and building the community in a city. This paper attempts to provide the framework for systemically analyzing and understanding the local commercial district. Then, this paper empirically analyzes the patterns of sales and flow of floating population by focusing on two representative local commercial districts in Seoul. In addition, the floating population data from telecommunication bases is further modeled with Markov chain for systemically understanding the local commercial districts. Finally, the transition patterns and consumption amounts of floating population are comprehensively analyzed for providing the implications on the evolutions of local commercial districts in a city. We expect that findings of our study could contribute to the economic growth of local commercial district, which could lead to the continuous development of city economy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.1-7
• /
• 2013

Big data management is becoming increasingly important in both industry and academia of information science community. One of the important categories of big data generated from software systems is log data. Log data is generally used for better services in various service providers and can also be used as information for qualification. This paper presents a big data management architecture specialized for log data. Specifically, it provides the aggregation of log messages sent from multiple clients and provides intelligent functionalities such as analyzing log data. The proposed architecture supports an asynchronous process in client-server architectures to prevent the potential bottleneck of accessing data. Accordingly, it does not affect the client performance although using remote data store. We implement the proposed architecture and show that it works well for processing big log data. All components are implemented based on open source software and the developed prototypes are now publicly available.

• Journal of the Korea Convergence Society
• /
• v.9 no.9
• /
• pp.61-67
• /
• 2018

Emulab software was developed by the team of University of Utah and it has been replicated at dozens of other sites in the world. Although KREONET Emulab, which established by the Korea Institute of Science and Technology Information, has only a modest number of compute nodes it has been provided an ideal playground to conduct various research for network protocols, cyber security and convergence research. A testbed is a critical enabler of experimental research and researchers only carry out the experiments that are supported by the testbed. This paper outlines the Utah Emulab's status and use types among the last 10 years of operation results and compares them with the ones with the KREONET Emulab. In addition, Testbed-as-a-Service(TaaS) is discussed to upgrade the testbed for the convergence research community services.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.109-114
• /
• 2015

This paper presents a computational model on the transfer of airborne fine particles to analyze the similarities and influences among the 25 districts in Seoul by quantifying a time series data collected from each district. The properties of each district are driven with the model of a time series of the fine particle concentrations, and the calculation of edge-based weights are carried out with the transfer entropies between all pairs of the districts. We applied a modularity-based graph clustering technique to detect the communities among the 25 districts. The result indicates the discovered clusters correspond to a high transfer-entropy group among the communities with geographical adjacency or high in-between traffic volumes. We believe that this approach can be further extended to the discovery of significant flows of other indicators causing environmental pollution.

• Korean Journal of Environmental Biology
• /
• v.30 no.2
• /
• pp.77-89
• /
• 2012

With the advent of the genomics era powered by DNA sequencing technologies, life science is being transformed significantly and biological research and development have been accelerated. Environmental biology concerns the relationships among living organisms and their natural environment, which constitute the global biogeochemical cycle. As sustainability of the ecosystems depends on biodiversity, examining the structure and dynamics of the biotic constituents and fully grasping their genetic and metabolic capabilities are pivotal. The high-speed high-throughput next-generation sequencing can be applied to barcoding organisms either thriving or endangered and to decoding the whole genome information. Furthermore, diversity and the full gene complement of a microbial community can be elucidated and monitored through metagenomic approaches. With regard to human welfare, microbiomes of various human habitats such as gut, skin, mouth, stomach, and vagina, have been and are being scrutinized. To keep pace with the rapid increase of the sequencing capacity, various bioinformatic algorithms and software tools that even utilize supercomputers and cloud computing are being developed for processing and storage of massive data sets. Environmental genomics will be the major force in understanding the structure and function of ecosystems in nature as well as preserving, remediating, and bioprospecting them.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.1-11
• /
• 2009

Recently there has arisen concern in both the database community and the graphics society about data retrieval from large motion databases because the high dimensionality of motion data implies high costs. In this circumstance, finding an effective distance measure and an efficient query processing method for such data is a challenging problem. This paper presents an elaborate motion query processing system, SMoFinder (Similar Motion Finder), which incorporates a novel kinematic distance measure and an efficient indexing strategy via adaptive frame segmentation. To this end, we regard human motions as multi-linkage kinematics and propose the weighted Minkowski distance metric. For efficient indexing, we devise a new adaptive segmentation method that chooses representative frames among similar frames and stores chosen frames instead of all frames. For efficient search, we propose a new search method that processes k-nearest neighbors queries over only representative frames. Our experimental results show that the size of motion databases is reduced greatly (${\times}1/25$) but the search capability of SMoFinder is equal to or superior to that of other systems.