• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• Computers and Concrete
• /
• v.23 no.6
• /
• pp.433-444
• /
• 2019

As rice husk ash (RHA) is not produced in controlled manufacturing process like cement, its properties vary significantly even within the same lot. In fact, properties of Rice Husk Ash Based Concrete (RHABC) are largely dictated by uncertainty leading to huge deviations from their expected values. This paper proposes a Robust Cost Optimization (RCO) procedure for RHABC, which minimizes such unwanted deviation due to uncertainty and provides guarantee of achieving desired strength and workability with least possible cost. The RCO simultaneously minimizes cost of RHABC production and its deviation considering feasibility of attaining desired strength and workability in presence of uncertainty. RHA related properties have been modeled as uncertain-but-bounded type as associated probability density function is not available. Metamodeling technique is adopted in this work for generating explicit expressions of constraint functions required for formulation of RCO. In doing so, the Moving Least Squares Method is explored in place of conventional Least Square Method (LSM) to ensure accuracy of the RCO. The efficiency by the proposed MLSM based RCO is validated by experimental studies. The error by the LSM and accuracy by the MLSM predictions are clearly envisaged from the test results. The experimental results show good agreement with the proposed MLSM based RCO predicted mix properties. The present RCO procedure yields RHABC mixes which is almost insensitive to uncertainty (i.e., robust solution) with nominal deviation from experimental mean values. At the same time, desired reliability of satisfying the constraints is achieved with marginal increment in cost.

• Journal of the Korea Society for Simulation
• /
• v.21 no.3
• /
• pp.79-88
• /
• 2012

Recently, the study in efficient operation, maintenance, and equipment-design have been growing rapidly in military industry to meet the required missions. Through out these studies, the importance of Concurrent Spare Parts(CSP) are emphasized. The CSP, which is critical to the operation and maintenance to enhance the availability, is offered together when a equipment is delivered. Despite its significance, th responsibility for determining the range and depth of CSP are done from administrative decision rather than engineering analysis. The purpose of the paper is to optimize the number of CSP per item using simulation and multiple regression. First, the result, as the change of operational availability, was gained from changing the number of change in simulation model. Second, mathematical regression was computed from the input and output data, and the number of CSP was optimized by multiple regression and linear programming; the constraint condition is the cost for optimization. The advantage of this study is to respond with the transition of constraint condition quickly. The cost per item is consistently altered in the development state of equipment. The speed of analysis, that simulation method is continuously performed whenever constraint condition is repeatedly altered, would be down. Therefore, this study is suitable for real development environment. In the future, the study based on the above concept improves the accuracy of optimization by the technical progress of multiple regression.

• Journal of Korea Water Resources Association
• /
• v.33 no.5
• /
• pp.647-658
• /
• 2000

The purpose of this study is to estimate the forward impact of water supply bottleneck using a supply-side input-output model. The failure cost analysed in this study can be used to estimate the values of the water supply reliability and can provide the bases of policy decision for the effective reallocation when water supply constraint will occur. So the position of water supply in the national economy is identified, and direct and indirect impacts are estimated by means of the interindustry analysis. Also the failure cost index is suggested to determine the prior order of water supply important in drought. By the way, the occurrence of drought having regional properties, the failure cost of the regional level using a national input-output table may be overestimated or underestimated. For the preceding reason, the failure cost estimated by a national input-output table is compared with and analysed to a regional input-output table for Kyung- Nam.g- Nam.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.40 no.5
• /
• pp.527-534
• /
• 2020

A significant factor in construction work is cost. At early- and advanced-stage design, costs should be calculated to derive realistic cost estimates according to unit price calculation. Based on these estimates, the economic feasibility of construction work is assessed, and whether to proceed is determined. Through the Korea Institute of Civil Engineering and Building Technology, the construction cost index has been calculated by indirect methods after both the producer price index and construction market labor have been reprocessed to easily adjust the price changes of construction costs in Korea, and the Institute has announced it since 2004. As of January 2000, however, the construction cost index was released, and this has a time constraint on the correction and use of past construction cost data to the present moment. Variables were calculated to compute a rough construction cost that utilized past construction costs through surveys of the producer price index and the construction market labor force consisting of the construction cost index. After significant independent variables among the many variables were selected through correlation analysis, the construction cost index from 1970 to 1999 was calculated and presented through multiple regression analysis. This study therefore has prominent significance in terms of proposing a method of calculating rough construction costs that utilize construction costs that pre-date the 2000s.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1183-1194
• /
• 2004

Network partitioning problem is to partition a network into multiple blocks such that the size of cutset is minimized while keeping the block sizes balanced. Among these, iterative algorithms are regarded as simple and efficient which are based on cell move of Fiduccia and Mattheyses algorithm, Sanchis algorithm, or Kernighan and Lin algorithm. All these algorithms stipulate balanced block size as a constraint that should be satisfied, which makes a cell movement be inefficient. Park and Park introduced a balancing coefficient R by which the block size balance is considered as a part of partitioning cost, not as a constraint. However, Park and Park's algorithm has a square time complexity with respect to the number of cells. In this paper, we proposed Bucket algorithm that has a linear time complexity with respect to the number of cells, while taking advantage of the balancing coefficient. Reducing time complexity is made possible by a simple observation that balancing cost does not vary so much when a cell moves. Bucket data structure is used to maintain partitioning cost efficiently. Experimental results for MCNC test sets show that cutset size of proposed algorithm is 63.33% 92.38% of that of Sanchis algorithm while our algorithm satisfies predefined balancing constraints and acceptable execution time.

• Journal of Energy Engineering
• /
• v.5 no.1
• /
• pp.87-92
• /
• 1996

This paper formulates dynamic optimization model for Time-Of-Use Rates when a electric power system consists of three generators and a rating period is divided into three sub-periods. We use Pontryagin's Maximum Principle to derive optimal price and investment policy. Particularly the cross-price elasticities of demand are considered in the objective function. We get the following results. First, the price is equal to short-run marginal cost when the capacity is sufficient. However, if the capacity constraint is active, the capacity cost is included in the price. Therefore it is equal to the long-run marginal cost. Second, The length of rating period affects allocation of capacity cost for each price. Third, the capacity investment in dynamic optimization is proportional to the demand growth rate of electricity. However the scale of investment is affected by not only its own demand growth rate but also that of other rating period.

• Advances in environmental research
• /
• v.8 no.1
• /
• pp.71-84
• /
• 2019

Effective waterproofing of structures was a compulsory constraint to avoid leaks and dampness or humidity in walls, ceilings, roofs underground tank and underground room. Traditionally used methods of roof waterproofing were bitumen with tinny seared clay tiles are very troublesome, overwhelming time and involving high labor cost. These waterproofing methods are not allocation the purpose due to their intrinsic disadvantages. Prepackaged polymer modified slurries (PPPMS) are now attainment the vogue and easy to use, easily available in the market, cheaper in cost and more workable than the traditional methods of waterproofing. An experimental study has shown that prepackaged polymer modified slurries (PPPMS) are superior in cost and performance to as a roof water proof coatings. Bituminous coatings were mixed with water and different combination of prepackaged polymer modified slurries and primer respectively, to find optimum coverage underneath worst atmospheric conditions. Every specimen of different proportioned was applied on plane roofs and through the passage of time, their performance was checked, assessed and associated with each other. The roof of approximately 40000 ft² area of prepackaged polymer modified slurries was used will give us hundred percent result (no water seepage or no water absorption) therefore no complaints as compare to roofs area of approximately 24000 ft² bituminous coating was used for waterproofing they have shown the result of 30 to 40 percent water seepage. This result shows that prepackaged polymer modified slurries were two times cheaper than bituminous coating. Comparing an equal number of surfaces coated with a polymer modified prepackaged mortar and bitumen the prepackaged polymer modified slurries (PPPMS) showed excellent performance, ease of application and low bitumen coating cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1390-1406
• /
• 1994

This study deals with the DMCLP(Delay constrained Minimum Cost Loop Problem)-one of problems arising in the design of local access computer networks. The problem consists of finding a set of rings to satisfy the traffic requirements of end user terminals. In the problem, the objective is to minimize the total link cost. This paper presents heuristic algorithm which consists of two phases for this problem, under the constraints that the number of nodes served by a single ring is limited and network mean delay is dropped within the desired time. The algorithm is derived using the clusters obtained by the existing MCLP(Minimum Cost Loop Problem) algorithm and a trade-off criterion explained in the paper. Actually, simulation results in that the proposed algorithm in this paper produces better solution than the existing MCLP algorithm modified. In addition, the algorithm has the relatively short running time.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.