• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.109-110
• /
• 2015

This paper presents a computational method that identifies an exact set of optimal overlap rates between critical activities to meet job site specific needs by using rework cost-slope. The procedures to compute the exact solution are provided in peudocode algorithm. The method is coded into Exact Concurrent Construction Scheduling system that allows practitioners to make more informed decision in accordance with the site-specific condition involved in the overlapping of critical activities. Test cases verify the validity of the computational method and the usability of the system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1080-1086
• /
• 2014

In this paper, we analyze the tradeoff performance of a consensus algorithm when it is applied to the CSMA/CA-based distributed wireless network. The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the transmission delay on the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff relationship between these two performances and so there exists an optimal number of cooperating neighbors that minimizes the consensus time. The result for the optimal number of neighbors according to the number of nodes that participate in the consensus shows that it is optimal for all nodes to cooperate together in the small-scale network but it is optimal to limit the number of neighbors to a fixed value in the large-scale network with nodes greater than a certain value.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.3026-3045
• /
• 2012

In this paper, diversity-multiplexing tradeoff (DMT) of three-user wireless multiple-antenna cooperative systems is investigated in general fading channels when half-duplex and decode-and-forward relay is employed. Three protocols, i.e., adaptive protocol, receive diversity protocol, and dual-hop relaying protocol, are considered. The general fading channels may include transmit and/or receive correlation and nonzero channel means, and are extensions of independent and identically distributed Rayleigh or Rician fading channels. Firstly, simple DMT expressions are derived for general fading channels with zero channel means and no correlation when users employ arbitrary number of antennas. Explicit DMT expressions are also obtained when all users employ the same number of antennas and the channels between any two users are of the same fading statistics. Finally, the impact of nonzero channel means and/or correlation on DMT is evaluated. It is revealed theoretically that the DMTs depend on the number of antennas at each user, channel means (except for Rayleigh and Rician fading statistics), transmit and/or receive correlation, and the polynomial behavior near zero of the channel gain probability density function. Examples are also provided to illustrate the analysis and results.

• Journal of Computing Science and Engineering
• /
• v.9 no.1
• /
• pp.1-8
• /
• 2015

Accessing and searching in a sequence of numbers are fundamental operations in computing that are encountered in a wide range of applications. One of the applications of the problem is cryptanalytic time-memory tradeoff which is aimed at a one-way function. A rainbow table, which is a common method for the time-memory tradeoff, contains elements from an input domain of a hash function that are normally sorted integers. In this paper, we present a practical indexing method for a monotonically increasing static sequence of numbers where the access and search queries can be addressed efficiently in terms of both time and space complexity. For a sequence of n numbers from a universe $U=\{0,{\ldots},m-1\}$, our data structure requires n lg(m/n) + O(n) bits with constant average running time for both access and search queries. We also give an analysis of the time and space complexities of the data structure, supported by experiments with rainbow tables.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6152-6168
• /
• 2017

Recently, the biometric-based authentication systems such as FIDO (Fast Identity Online) are increased in mobile computing environments. The biometric-based authentication systems are performed on the mobile devices with the battery, the improving energy efficiency is important issue. In the case, the size of images (i.e., face, fingerprint, iris, and etc.) affects both recognition accuracy and energy consumption, and hence the tradeoff analysis between the both recognition accuracy and energy consumption is necessary. In this paper, we propose an energy-efficient way to authenticate based on biometric information with tradeoff analysis between the both recognition accuracy and energy consumption in multimedia IoT (Internet of Things) transmission environments. We select the facial information among biometric information, and especially consider the multicore-based mobile devices. Based on our experimental results, we prove that the proposed approach can enhance the energy efficiency of GABOR+LBP+GRAY VALUE, GABOR+LBP, GABOR, and LBP by factors of 6.8, 3.6, 3.6, and 2.4 over the baseline, respectively, while satisfying user's face recognition accuracy.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.3
• /
• pp.85-92
• /
• 2018

We consider a project scheduling problem in which the jobs can be compressed by using additional resource to meet the corresponding due dates, referred to as a time-cost tradeoff problem. The project consists of two independent subprojects of which precedence graph is a chain. The due dates of jobs constituting the project can be interpreted as the multiple assessments in the life of project. The penalty cost occurs from the tardiness of the job, while it may be avoided through the compression of some jobs which requires an additional cost. The objective is to find the amount of compression that minimizes the total tardy penalty and compression costs. Firstly, we show that the problem can be decomposed into several subproblems whose number is bounded by the polynomial function in n, where n is the total number of jobs. Then, we prove that the problem can be solved in polynomial time by developing the efficient approach to obtain an optimal schedule for each subproblem.

• Management Science and Financial Engineering
• /
• v.22 no.1
• /
• pp.5-12
• /
• 2016

We consider a time-cost tradeoff problem with multiple milestones under a chain precedence graph. In the problem, some penalty occurs unless a milestone is completed before its appointed date. This can be avoided through compressing the processing time of the jobs with additional costs. We describe the compression cost as the convex or the concave function. The objective is to minimize the sum of the total penalty cost and the total compression cost. It has been known that the problems with the concave and the convex cost functions for the compression are NP-hard and polynomially solvable, respectively. Thus, we consider the special cases such that the cost functions or maximal compression amounts of each job are identical. When the cost functions are convex, we show that the problem with the identical costs functions can be solved in strongly polynomial time. When the cost functions are concave, we show that the problem remains NP-hard even if the cost functions are identical, and develop the strongly polynomial approach for the case with the identical maximal compression amounts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2173-2183
• /
• 1998

We consider a frequency-hopped multiple-access communication system that employs reed-solomon code over GF(Q) and M-ary FSK signaling ($M{\leq}Q$) in rayleigh fading channel. We investigate the tradeoff among the modulation symbol size (M), the number of frequency slots, and the code rate in maximizing the average number of successfully transmitted information bits per unit time and unit bandwidth (called normalized throughput). We find that it is desirabel to use a large M in noise-limited environment. In interference-limited environment, it is more improtant to prevent errors (hits) by increasing the number of frequency slots than to correct them with formward error correction techniques or to reduce the error rate by increasing M.

• Journal of Power Electronics
• /
• v.15 no.2
• /
• pp.338-345
• /
• 2015

The time-optimal control for boost converters can achieve the minimum recovery time. However, their output voltage deviation is quite large. Since the minimum output voltage deviation and minimum recovery time cannot be obtained at the same time, a novel energy control is proposed to achieve a superior tradeoff between them in this paper. The peak value of the inductor current can be decreased as well. Its control parameter is easy to choose. When compared with the conventional control methods, the proposed control shows a better dynamic performance. Experimental results, which are in agreement with the theoretical analysis, are provided to verify the proposed control method.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.1114-1121
• /
• 2022

Construction laborers and crews play a critical role in achieving a safe and productive construction site. Many past research studies used top-down approaches/perspectives for studying the impact of laborers' performance on overall construction site outputs with limited flexibility in accounting for laborers' various characteristics. However, the recent reap in computational advances allowed applications of bottom-up architectures, which can potentially incorporate heterogeneous characteristics of laborers' individual behavioral and decision-making features effectively. Accordingly, agent-based modeling (ABM), as a tool to leverage a bottom-up methodological approach, has been widely adopted by recent research. Existing literature investigated the influence of changes in laborers' behaviors and interactions on either construction sites' safety performance or productivity performance individually, leaving the tradeoff between safety and productivity in this context relatively unexplored. Accordingly, this study aims to develop an agent-based framework to study the tradeoff between project safety and productivity performances resulting from changes in laborers' behaviors after attending safety trainings. Our findings via simulations indicate that proper safety trainings can improve safety performance without negatively impacting productivity performance.