• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.35-43
• /
• 2011

To develop a software, there is a relationship between development organization's productivity, effort, development schedule, and software size. It is software equation that motive these relations. Basically, relationship between size-effort and size-schedule is applied. If this relationship is not proper, there would be no effect of the cost-schedule tradeoff equation that is derived from software equation, and the manpower profile analysis, etc. To solve these unwanted problems, we presented a modified software equation and a cost-schedule tradeoff model based on the modified software equation. To improve software development success rate, applying proposed model will help in contract negotiation or bid.

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

This paper presents a Stochastic Time-Cost Tradeoff analysis system (STCT) that identifies optimal construction methods for activities, hence reducing the project completion time and cost simultaneously. It makes use of schedule information obtained from critical path method (CPM), applies alternative construction methods data obtained from estimators to respective activities, computes an optimal set of genetic algorithm (GA) parameters, executes simulation based GA experiments, and identifies near optimal solution(s). A test case verifies the usability of STCT.

• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.99-106
• /
• 2013

Generally, software development schedule compression is decided within 75% of nominal schedule. However, there are some difficulties when we judge the possibility of development schedule compression because a nominal schedule has not been definitely. Therefore, this paper investigates various nominal schedule estimation models and decides the optimum range. Basing on the performance of ISBSG Release 8,614 projects are extracted from the actual 1,595 projects. We presented development effort estimation model from those data. Also, we derived the development schedule model from the development effort. When you apply the proposed model, you will be able to estimate development effort and schedule required for the development more actually.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.365-378
• /
• 2023

ARIA is a block cipher proposed by Kwon et al. at ICISC 2003 that is widely used as the national standard block cipher in the Republic of Korea. Herein, we identify some flaws in the quantum rebound attack on seven-round ARIA-DM proposed by Dou et al. and reveal that the limit of this attack is up to five rounds. Our revised attack applies to not only ARIA-DM but also ARIA-MMO and ARIA-MP among the PGV models, and it is valid for all ARIA key lengths. Furthermore, we present dedicated quantum rebound attacks on seven-round ARIA-Hirose and ARIA-MJH for the first time. These attacks are only valid for the 256-bit key length of ARIA because they are constructed using the degrees of freedom in the key schedule. All our attacks are faster than the generic quantum attack in the cost metric of the time-space tradeoff.