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

Digital document file such as Adobe Acrobat or MS-Office is encrypted by its own ciphering algorithm with a user password. When this password is not known to a user or a forensic inspector, it is necessary to recover the password to open the encrypted file. Password cracking by brute-force search is a perfect approach to discover the password but a time consuming process. This paper presents a new method of speeding up password recovery on Graphic Processing Unit (GPU) using a Compute Unified Device Architecture (CUDA). PDF files are chosen as a password cracking target, and the Abode Acrobat password recovery algorithm is examined. Experimental results show that the proposed method gives high performance at low cost, with a cluster of GPU nodes significantly speeding up the password recovery by exploiting a number of computing nodes. Password cracking performance is increased linearly in proportion to the number of computing nodes and GPUs.

• Journal of KIBIM
• /
• v.9 no.2
• /
• pp.1-10
• /
• 2019

In this research, schedule optimization is defined as balancing the number of workers while keeping the demand and needs of the project resources, creating the perfect schedule for each activity. Therefore, when one optimizes a schedule, multiple potentials of schedule changes are assessed to get an instant view of changes that avoid any over and under staffing while maximizing productivity levels for the available labor cost. Optimizing the number of workers in the scheduling process is not a simple task since it usually involves many different factors to be considered such as the development of quantity take-offs, cost estimating, scheduling, direct/indirect costs, and borrowing costs in cash flow while each factor affecting the others simultaneously. That is why the optimization process usually requires complex computational simulations/modeling. This research attempts to find an optimal selection of daily maximum workers in a project while considering the impacts of other factors at the same time through OPEN BIM based multiple computer simulations in resource leveling. This paper integrates several different processes such as quantity take-offs, cost estimating, and scheduling processes through computer aided simulations and prediction in generating/comparing different outcomes of each process. To achieve interoperability among different simulation processes, this research utilized data exchanges supported by building SMART-IFC effort in automating the data extraction and retrieval. Numerous computer simulations were run, which included necessary aspects of construction scheduling, to produce sufficient alternatives for a given project.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.12
• /
• pp.597-602
• /
• 2002

The restructuring of power industry is still going on all over the world for last several decades. Many kinds of restructuring model have been studied, proposed, and applied. Among those models, power pool is more popular than other. This paper assumes the power pool market structure having competitive generation sector, and a new method is presented to build a bidding strategy in that market. The utilities participating in the market have the perfect information of their cost and price functions, but they don't know which strategy to be chosen by others. To define one's strategy as a vector, we make utility's cost/price functions into discrete step functions. An utility knows only his own strategy, so he estimates the other's cost/price functions into discrete step functions. An utility knows only his own strategy, so he estimates the other's strategy using Nash equilibrium or stochastic methods. And he also has to forecast the system demand. According to this forecasting result, his payoffs can be changed. Considering these all conditions, we formulate a bidding game problem and apply noncooperative game theory to that problem for the optimal strategy or solution. Some restrictive assumption are added for simplification of solving process. A numerical example is given in Case Study to show essential features and concrete results of this approach.

• Journal of Information Technology Services
• /
• v.15 no.3
• /
• pp.247-263
• /
• 2016

The purpose of the study is to derive success factors of B2C reverse auction business model, a business model contributes to the recent innovative practices in e-commerce and service sector. Electronic reverse auction has been traditionally used to ensure the procurement convenience and purchasing efficiency in B2B or B2G settings, however, e-RA is now expanding its basis toward B2C commerce industry along the huge success of an online e-RA travel service provider Priceline.com. Recently, B2C e-RA business model is getting the spotlight in the Korean venture industry with a variety of startups in diverse areas. However, e-RA does not work perfect in all kinds of trade settings. Therefore, we conducted a multiple case study to find out the success factors of B2C business model as follows : First, large supplier basis is an important factor that constructs a quasi-perfect competition environment. Second, the high online and mobile accessibility or e-readiness of Korean consumers was also a critical aspect of the success of e-RA. Lastly, e-RA performs best when the supplier switching cost is low and the trading occurs infrequently.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.762-772
• /
• 2016

This paper studies the problem of precoding and post-coding design for multicell multiuser downlink transmissions in the absence of perfect channel state information (CSI). Using statistical information of imperfect CSI, an iterative multiuser multicell transceiver design is formulated by minimizing the mean squared error (MSE) cost function of signal and leakage interference under per-base station power constraint (PBPC). The convergence of the iterative precoding and postcoding algorithm is verified by analytical and empirical results. The proposed precoding and postcoding algorithm offers a low computational complexity and robustness against CSI imperfection.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2014.05a
• /
• pp.308-309
• /
• 2014

A lot of very complex free-form buildings such as Seoul City Office and DDP(Dongdaemun Design Plaza) have been recently built nowadays in domestic. However, as construction methods and cost data are decided without enough discussion and collaboration with specialized subcontractors during design stage, construction quality problems and cost overrun of the free-form buildings are thus occurred during construction stage. Therefore design system and process or contract and ordering system should be developed participating the specialized subcontractors during design stage in order to perfect the free-form design and construction. Especially US has thus an effort to apply IPD(Integrated Project Delivery) system which can solve the problems of construction quality, productivity decrease and cost overrun by constructing the buildings based on exact drawings and collaboration as well as activating BIM(Building Information Modeling). Therefore this study reviews cases of the free-form buildings in domestic and then presents necessity review of IPD in domestic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4157-4175
• /
• 2020

Moving target defense, as a 'game-changing' security technique for network warfare, realizes proactive defense by increasing network dynamics, uncertainty and redundancy. How to select the best countermeasure from the candidate countermeasures to maximize defense payoff becomes one of the core issues. In order to improve the dynamic analysis for existing decision-making, a novel approach of selecting the optimal countermeasure using game theory is proposed. Based on the signal game theory, a multi-stage adversary model for dynamic defense is established. Afterwards, the payoffs of candidate attack-defense strategies are quantified from the viewpoint of attack surface transfer. Then the perfect Bayesian equilibrium is calculated. The inference of attacker type is presented through signal reception and recognition. Finally the countermeasure for selecting optimal defense strategy is designed on the tradeoff between defense cost and benefit for dynamic network. A case study of attack-defense confrontation in small-scale LAN shows that the proposed approach is correct and efficient.

• Management & Information Systems Review
• /
• v.13
• /
• pp.99-125
• /
• 2003

The purpose of this study is to improve local government accounting system for value creation. In order to achieve this object: First, improvement of public finance policy can be obtained through connection of policy and estimate, and evaluation of soundness and rationality of tax system. Second, innovation of appropriation is achieved through effective division of cost, efficient division of budgetary resources and perfect accrual accounting. Third, a performance report must include accurate performance measures and performance indicators, for its effect is linked to public finance policy. Fourth, general principles of local government accounting must include significance, reliability, consistency with user concepts, relevance, understandability and comparability for financial reports.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.127-133
• /
• 2005

This paper presents a password-based key exchange protocol to guarantee secure communications for two users registered in a sever. In this protocol, the server is only responsible for the legality of the users but does not how the session key agreed between them. The protocol can resist the various attacks including server compromise attack and provide the perfect forward secrecy. The proposed protocol is efficient in terms of computation cost because of not employing the sewer's public key.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5264-5281
• /
• 2017

Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.