• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.303-310
• /
• 2018

Bitcoin (BTC) is a cryptocurrency proposed by Satoshi Nakamoto in 2009. Bitcoin makes its transactions with no central authorities. This decentralization is accomplished with its mining, which is an operation that makes people compete to solve math puzzles to include new transactions into block, and eventually block chains (ledger) of bitcoin. Because miners need to solve a complex puzzles, they need a lot of computing resources. In return for miners' resources, bitcoin network gives newly minted bitcoins as a reward to miners when they succeed in mining. To prevent inflation, the reward is halved every 4 years. For example, in 2009 block reward was 50 BTC, but today, the block reward is 12.5 BTC. On the other hands, exchange rate for bitcoin and Korean Won (KRW) changed drastically from 924,000 KRW/BTC (January 12th, 2017) to 16,103,306 KRW/BTC (December 10th, 2017), which made mining more attractive. However, there are no rigorous researches on the profitability of bitcoin mining. In this paper, we evaluate the profitability of bitcoin mining.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1401-1406
• /
• 2006

Mobile Ad-hoc networks have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of Ad-hoc in routing, we consider, in this paper, how to efficiently support applications such as variable Goocasting basd on Ad-hoc networks. The goal of a geocasting uotocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast nice in mobilie computing based on Ad-hoc have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the nobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance of Connection & Network Overhead than previous research.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.8
• /
• pp.375-387
• /
• 2005

This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.359-366
• /
• 2003

Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selective deletion of objects, cache compaction and object structuring step in the clients. The conversion is a time- intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, in order to control the map efficiently in the vector map service based mobile phones, it is necessary to study the methods which reuse cached objects for reducing wireless network bandwidth and overwhelming the limited resources of mobile phones as well. This paper proposes the methods of reusing pre-received spatial objects for map control in the mobile vector map service system based on client-server architecture. The experiments conducted on the Web GIS systems with real data show that the proposed method is appropriate to map services for mobile phone. We also analyze the advantages and drawbacks between the reuse of cached data and transmission of raw data respectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.381-392
• /
• 2003

Component-based Development(CBD) based on the software reuse has been more attractive from software companies that want to enhance software productivity. However, since component identification process is mainly dependent on domain expert´s intuition and experience, it was very difficult to develop tools for supporting the component identification process. In this paper, we propose a systematic procedure of identifying reusable component by using object dependencies and object usages and provide a design and implementation of its supporting tool. In object-oriented domain models. there exists several diagrams which are described in different viewpoints. From these diagrams, object dependency and object usages are extracted and merged into an object dependency network, which is a basis for performing a comfonent identification algorithm. Finally, through a case study of internet banking system, we evaluate the applicability of the proposed identification process and tool.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.447-454
• /
• 2003

The forwarding enging, which handles the incoming frames and forwards them to the appropriate outgoing interface, is the crucial factor of the router´s performance. As the MPLS label edge router provides the facility that it is capable of interworking with various kinds of networks, the forwarding engine should have the flexibility processing the corresponding types of frames from such network interfaces. In order to support the flexibility, we implement the forwarding engine for the MPLS LER with ATM interfaces based on the programmable Ethernet packet processor. By exploiting instinct loop-back functionality of Ethernet packet processor, our forwarding engine handles and forwards the frames from/to ATM interfaces. The performance of our forwarding engine is evaluated by experiments on the effect of looping frames back and the number of Ethernet packet processor´s instructions.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.3
• /
• pp.356-363
• /
• 2000

Java programming language is designed to run effectively on internet and distributed network environments. However, because it has a deficit to be executed by the interpreter method on each platform, to execute Java programs efficiently the code generation system which transforms Bytecode into SPARC code as target machine code must be developed. In this paper, we implement a code generation system which translates Bytecode into SPARC code using the retargetable code generating techniques. For the sake of code expander, we wrote a Bytecode table describing a rule of SPARC code generation from Bytecode, and implemented the information extractor transforming Bytecode to suitable form during expanding of source code from class file. The information extractor determines constant pool entry of each Bytecode instruction operand and then the code expander translates the Bytecode into SPARC code accoring to the Bytecode table. Also, the retargetable code generation system can be systematically reconfigured to generate code for a variety of distinct target computers.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.576-586
• /
• 2005

This paper presents a new estimation and representation of a disparity map for stereo-based video communication systems. Several pixel-based and block-based algorithms have been proposed to estimate the disparity map. While the pixel-based algorithms can achieve high accuracy in computing the disparity map, they require a lost of bits to represent the disparity information. The bit rate can be reduced by the block-based algorithm, sacrificing the representation accuracy. In this paper, the block enclosing a distinct edge is divided into two regions and the disparity of each region is set to that of a neighboring block. The proposed algorithm employs accumulated histograms and a neural network to classify a type of a block. In this paper, we proved that the proposed algorithm is more effective than the conventional algorithms in estimating and representing disparity maps through several experiments.

• Archives of design research
• /
• v.19 no.3 s.65
• /
• pp.93-104
• /
• 2006

When the design profession started, design targets were mainly static hardware centered products. Due to the development of network and digital technologies, new products with dynamic and software-hardware hybrid interactive characteristics have become one of the main design targets. To accomplish the new projects, designers are required to learn new methods, tools and theories in addition to the traditional design expertise of visual language. One of the most important tools for the change is effective and rapid prototyping. There have been few researches on educational framework for interactive product or system prototyping to date. This paper presents a new model of educational contents and methods for interactive digital product prototyping, and it's application in a design curricula. The new course contents, integrated with related topics such as physical computing and tangible user interface, include microprocessor programming, digital analogue input and output, multimedia authoring and programming language, sensors, communication with other external devices, computer vision, and movement control using motors. The final project of the course was accomplished by integrating all the exercises. Our educational experience showed that design students with little engineering background could learn various interactive digital technologies and its' implementation method in one semester course. At the end of the course, most of the students were able to construct prototypes that illustrate interactive digital product concepts. It was found that training for logical and analytical thinking is necessary in design education. The paper highlights the emerging contents in design education to cope with the new design paradigm. It also suggests an alterative to reflect the new requirements focused on interactive product or system design projects. The tools and methods suggested can also be beneficial to students, educators, and designers working in digital industries.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2087-2102
• /
• 2011

The purpose of this study is to develop and present a strategic framework for mobile Internet marketing in the $Web^2$ environment. The $Web^2$ mobile Internet marketing is characterized by services, such as augmented reality and social network services. Considering the changes in the effects and types of advertisements in the mobile Internet, few studies of mobile advertisements have been conducted thus far in the $Web^2$ environment, including the cloud computing environment. Accordingly, this research aims to identify the relationships between importance and satisfaction and to uncover the characteristics of mobile advertisements through smart phones using the IPA (Importance-performance Analysis) methodology in the $Web^2$ environment. To induce the minimum required characteristics of a mobile advertisement in terms of the importance and satisfaction of IPA, Kano's model is applied to this analysis. The study also probes the relationships between the overall satisfaction and factors of each dimension of IPA through a regression analysis. As a result, this study presents four types of $Web^2$ mobile Internet marketing strategies. It was also confirmed that the maintenance reinforcement factors of the IPA dimension affect the degree of overall satisfaction. This study has implications for businesses and researchers preparing $Web^2$ mobile services and marketing.