• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.46
• /
• pp.33-49
• /
• 1998

In order to improve the performance of relational databases, one has to reduce the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to reduce the number of disk I/O accesses by vertically partitioning relation into fragments and allowing attribute replication to fragments if necessary. When zero-one integer programming model is solved by the branch-and-bound method, it requires much computing time to solve a large sized problem. Therefore, heuristic solutions using genetic algorithm(GA) are presented. GA in this paper adapts a few ideas which are different from traditional genetic algorithms, for examples, a rank-based sharing fitness function, elitism and so on. In order to improve performance of GA, a set of optimal parameter levels is determined by the experiment and makes use of it. As relations are vertically partitioned allowing attribute replications and saved in disk, an attribute replicating vertical partition method by GA can attain less access cost than non-attribute-replication one and require less computing time than the branch-and-bound method in large-sized problems. Also, it can acquire a good solution similar to the optimum solution in small-sized problem.

• KIEE International Transactions on Power Engineering
• /
• v.4A no.4
• /
• pp.254-261
• /
• 2004

Traditionally, electrical power systems had formed the vertically integrated industry structures based on the economics of scale. However, power systems have been recently reformed to increase their energy efficiency. According to these trends, the Korean power industry underwent partial reorganization and competition in the generation market was initiated in 2001. In competitive electric markets, accurate load data is one of the most important issues to maintaining flexibility in the electric markets as well as reliability in the power systems. In practice, the measuring load data can be uncertain because of mechanical trouble, communication jamming, and other issues. To obtain reliable load data, an efficient evaluation technique to adjust the missing load data is required. This paper analyzes the load pattern of historical real data and then the tuned ARIMA (Autoregressive Integrated Moving Average), PCHIP (Piecewise Cubic Interpolation) and Branch & Bound method are applied to seek the missing parameters. The proposed method is tested under a variety of conditions and also tested against historical measured data from the Korea Energy Management Corporation (KEMCO).

• KIEE International Transactions on Power Engineering
• /
• v.5A no.1
• /
• pp.46-55
• /
• 2005

This paper proposes a new method for choice of the best transmission system expansion plan on the side of highest satisfaction level of decision maker using fuzzy integer programming. The proposed method considers the permissibility and ambiguity of the investment budget (economics) for constructing the new transmission lines and the delivery marginal rate (reliability criteria) of the system by modeling the transmission expansion problem as a fuzzy integer programming one. It solves the optimal strategy (reasonable as well as flexible) using a fuzzy set theory-based on branch and bound method that utilizes a network flow approach and the maximum flow-minimum cut set theorem. Under no or only a very small database for the evaluation of reliability indices, the proposed technique provides the decision maker with a valuable and practical tool to solve the transmission expansion problem considering problem uncertainties. Test results on the 63-bus test system show that the proposed method is practical and efficiently applicable to transmission expansion planning.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1681-1693
• /
• 1997

In a distributed system, the simple file allocation problem determines the placement of copies of a file, so as to minimize the operating costs. The simple file allocation problem assumes the cost parameters to be fixed. In practice, these parameters change over time. In this research, dynamic file allocation problem for both single and multiple files are considered, which account for these changing parameters. A model for dynamic file allocation problem is formulated as a mixed integer program for which Lagrangian relaxation based branch-and-bound algorithm is developed. This algorithms is implemented and its efficiency is tested on medium to large test problems.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.70-79
• /
• 2010

Makespan and cost minimization are two important factors in project investment. This paper considers a multi-mode resource-constrained project scheduling problem with the objective of minimizing costs, subject to a deadline constraint. A number of studies have focused on minimizing makespan or resource availability cost with a specified deadline. This problem assumes a fixed cost for the availability of each renewable resource per period, and the project cost to be minimized is the sum of the variable cost associated with the execution mode of each activity. The presented memetic algorithm (MA) consists of three features: (1) a truncated branch and bound heuristic that serves as effective preprocessing in forming the initial population; (2) a strategy that maintains two populations, which respectively store deadline-feasible and infeasible solutions, enabling the MA to explore quality solutions in a broader resource-feasible space; (3) a repair-and-improvement local search scheme that refines each offspring and updates the two populations. The MA is tested via ProGen generated instances with problem sizes of 18, 20, and 30. The experimental results indicate that the MA performs exceptionally well in both effectiveness and efficiency using the optimal solutions or the current best solutions for the comparison standard.

• Annual Conference of KIPS
• /
• 2015.04a
• /
• pp.741-744
• /
• 2015

최근 소셜 미디어를 이용한 대량의 데이터로부터 사용자의 의사결정을 지원하기위한 맞춤형 데이터 추천 서비스가 관심을 받고 있으며 사용자의 선호도에 근접한 데이터 추천기법으로 스카이라인 질의가 연구되어왔다. 그러나 기존의 스카이라인 질의는 데이터의 정적속성(위도, 경도, 가격 등)만을 기준으로 모든 사용자에게 동일한 데이터를 반환하기 때문에 맞춤형 데이터를 추천하기 어렵다. 본 논문에서는 사용자의 기호에 대한 정밀도를 높이기 위해 정적속성에서 동적속성(계산속성)을 유도하는 분기한정 동적 스카이라인 질의 기법(Branch and Bound Dynamic Skyline, BBDS)을 구현하였다. 시뮬레이션에서는 대규모 데이터 및 다양한 분포에 따른 실험을 수행한 결과 BBDS가 기존 기법에 비해 데이터 탐색과 추천에 있어서 향상된 성능을 나타내는 것으로 평가되었다.

• Journal of Korean Port Research
• /
• v.10 no.2
• /
• pp.7-15
• /
• 1996

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. A berth can be assigned to incoming vessels and operated in tow different ways: as a common user berth, as a preference berth. A common user berth is a berth that any ship calling at a port may be permitted to use according to her time of arrival and to priorities as determined by the port authority. In this paper, we concerned with various types of mathematical programming models for a berth assignment problem to achive an efficient berth operation. In this paper, we focus on a reasonable berth assignment programming in a public container terminal in consideration of trade-off between server and user. We propose a branch and bound algorithm & heuristic algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) with which the trade-off between servers and users can be considered. The berth assignment problem is formulated by min-max and 0-1 integer programming and developed heuristic algorithm to solve the problem more easily instead of branch and bound method. Finally, we gave the numerrical solutions of the illustrative examples.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.277-286
• /
• 2010

In this paper amplitude and phase distortion of the received signal through a fading channel results in a severe performance degradation of the communication system, Therefore we consider the variance of the maximum a posteriori phase estimate of sinusoidal signal by the Cramer-Rao bound in wireless fading channel. To find the Cramer-Rao lower bound for the variance of the phase, We use the derived probability density function(pdf) of the phase in Nakagami fading channel. We analyze the error performance of modulation signals using order statistics on generalized combining reception and find adequate diversity branch number.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.635-656
• /
• 2019

In this paper, we investigate the degrees of freedom (DoF) of a multi-cell multi-user multiple-input multiple-output (MIMO) interference broadcast channel (IBC) with non-cooperation distributed base stations (BS), where each BS serves users of its corresponding cell. When all BSs simultaneously transmit their own signals over the same frequency band in the MIMO IBC, the edge users in each cell will suffer the inter-cell interference (ICI) and inter-user interference (IUI) signals. In order to eliminate the ICI and IUI signals, a distributed space time interference alignment (DSTIA) approach is proposed where each BS has only limited access to distributed moderately-delay channel state information at the transmitter (CSIT). It is shown that the DSTIA scheme can obtain the appreciate DoF gains. In addition, the DoF upper bound is asymptotically achievable as the number of antenna at each BS increases. It is shown that the DSTIA method can get DoF gains over other interference alignment schemes with delayed CSIT in literature. Moreover, the DSTIA method can attain higher DoFs than the IA schemes with global CSIT for certain antenna configurations.

• Journal of Society of Preventive Korean Medicine
• /
• v.10 no.2
• /
• pp.63-80
• /
• 2006

Public health oriental medical doctor has played a great role in providing oriental medical treatment and oriental medical health program with public health medical services, the basic infrastructure, however, is not sufficient. In this study, the researcher surveyed the treatment working or service condition of public health oriental medical doctor. 1. The payment, allowance of doctors are fixed upon the law and guideline according to the financial status of local government. The branch of public health center has more support like an official residence with expenses. 2. The public health center mainly has assitants and ratio of full-timer is more than the branch public health center without any assistants if any, they are temporary employee 3. The public health center has 5.22 beds while the branch has 3.14 beds. The daily average number of patient for public health center is 15.01 while the branch has 8.7 More than half of outpatients are over sixties with musculoskeletal disease. 4. Regarding the traveling clinic, the public health center put into more operation than the branch. The 3rd year serving public doctor gives negative about the traveling clinic much more than 1st and 2nd year serving public doctor. The treatment service condition of public doctor of the public health center is better than the branch doctor, but we are on the point of role-changing as health promotion and preventive treatment to bring up motivation, education and competence strengthening for execution the local-bound health program.