• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.187-200
• /
• 1998

This paper presents an original approach for solving short-term power scheduling in extended power system with two fuels in a unit and a limited fuel using Lagrangian relaxations. The underlying model incorporates the full set of costs and constraints including setup, production, ramping, and operational status, and takes the form of a mixed integer nonlinear control problem. Moreover, the mathematical model developed includes two fuels in a unit and a limited fuel, regulation reserve requirements of prespecified group of units. Lagrangian relaxation is used to disaggregate the model by generator into separate subproblems which are then solved with a nested dynamic program including empirical knowledges. The strength of the methodology lies partially in its ability to construct good feasible solutions from information provided by the dual. Thus, the need for branch-and-bound is eliminated. In addition, the inclusion of two fuels in a unit and a limited fuel provides new insight into the limitations of current techniques. Computational experience with the proposed algorithm indicates that Problems containing up to 23 units including 8 unit used two fuels and 24 time periods can be readily solved in reasonable times. Duality gaps of less than 4％ were achieved.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.160-162
• /
• 2001

Cyclic-Reservation Multiple-Access(CRMA) is an access scheme for high-speed local and metropolitan area networks based on folded-bus or dual-bus configurations. CRMA provides high throughput and fairness independent of the network speed or distance. This paper describes a simulation-based quantitative analysis of the performance gains obtained by introducing slot reuse in CRMA. Generally, a longer cycle length means a longer access delay and a lower throughput. There-fore, it is desirable to develop a scheme such that the cycle length is the shortest. In this paper, we will study the problem of reducing the total number of empty slots generated within every cycle. However, it has been shown that the problem is NP-complete under the constraint that all empty slots used by a station in a cycle are required to be consecutive. We present the algorithm that improves previous novel approach by using previous node information. We compare our slots reuse scheme with several slot reuse algorithms such as region scheme (FMR), address schemes, novel approach in terms of the following two important performance criteria: average cycle length and average slot utilization ratio. As compared with the one proposed in novel algorithm, the new scheme makes the cycle length much shorter. Besides, the resulting slot utilization and the access delay are better than those of the other two schemes.

• Journal of Biomedical Engineering Research
• /
• v.39 no.2
• /
• pp.80-86
• /
• 2018

The aim of this study were to establish the clinical references and guidelines for the maximum standardized uptake ($SUV_{max}$) value of pancreatic cancer, pancreatitis, and normal pancreas in $^{18}F-FDG$ PET-CT examinations for pancreatic disease. For this purpose, we performed the statistical analysis on the descriptive statistics, percentiles and inter quartiles range (IQR), normal distribution, and using the probability density function for pancreatic cancer, pancreatitis, and normal pancreas. As a result, the clinical reference of $SUV_{max}$ for the pancreatic cancer, pancreatitis, and normal pancreas was more than 3.45, 1.91 to 2.62, and less than 1.91, respectively. Also, optimal cut-off value for applying the dual time point PET-CT examination was determined to be 2.62. The results of this study are summarized as follows: first, we suggests the clinical reference and guideline for the pancreatic cancer, pancreatitis, and normal pancreas, and second, suggests a scientific approach to improve diagnostic accuracy of pancreatic disease by deviating from an approximate experience approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.670-683
• /
• 2016

Network coding, as a new technique to improve the throughput, is studied combined with multi-relay model in this paper to address the challenges of long distance and power limit in deep space communication. First, an amplify-and-forward relaying approach based on analog network coding (AFNC) is proposed in multi-relay network to improve the capacity for deep space communication system, where multiple relays are introduced to overcome the long distance link loss. The design of amplification coefficients is mathematically formulated as the optimization problem of maximizing SNR under sum-power constraint over relays. Then for a dual-hop relay network with a single source, the optimal amplification coefficients are derived when the multiple relays introduce non-coherent noise. Through theoretic analysis and simulation, it is shown that our approach can achieve the maximum transmission rate and perform better over single link transmission for deep space communication.

• Nuclear Engineering and Technology
• /
• v.41 no.7
• /
• pp.929-944
• /
• 2009

The present study is concerned with the extension of the Effective Convectivity Model (ECM) to the phase-change problem to simulate the dynamics of the melt pool formation in a Light Water Reactor (LWR) lower plenum during hypothetical severe accident progression. The ECM uses heat transfer characteristic velocities to describe turbulent natural convection of a melt pool. The simple approach of the ECM method allows implementing different models of the characteristic velocity in a mushy zone for non-eutectic mixtures. The Phase-change ECM (PECM) was examined using three models of the characteristic velocities in a mushy zone and its performance was compared. The PECM was validated using a dual-tier approach, namely validations against existing experimental data (the SIMECO experiment) and validations against results obtained from Computational Fluid Dynamics (CFD) simulations. The results predicted by the PECM implementing the linear dependency of mushy-zone characteristic velocity on fluid fraction are well agreed with the experimental correlation and CFD simulation results. The PECM was applied to simulation of melt pool formation heat transfer in a Pressurized Water Reactor (PWR) and Boiling Water Reactor (BWR) lower plenum. The study suggests that the PECM is an adequate and effective tool to compute the dynamics of core melt pool formation.

• Industrial Engineering and Management Systems
• /
• v.9 no.1
• /
• pp.10-19
• /
• 2010

This paper presents an extended computing procedure for the global optimization of the triple response system (TRS) where the response functions are nonconvex (nonconcave) quadratics and the input factors satisfy a radial region of interest. The TRS arising from response surface modeling can be approximated using a nonlinear mathematical program involving one primary (objective) function and two secondary (constraints) functions. An optimization algorithm named triple response surface algorithm (TRSALG) is proposed to determine the global optimum for the nondegenerate TRS. In TRSALG, the Lagrange multipliers of target (secondary) functions are computed by using the Hooke-Jeeves search method, and the Lagrange multiplier of the radial constraint is located by using the trust region (TR) method at the same time. To ensure global optimality that can be attained by TRSALG, included is the means for detecting the degenerate case. In the field of numerical optimization, as the family of TR approach always exhibits excellent mathematical properties during optimization steps, thus the proposed algorithm can guarantee the global optimal solution where the optimality conditions are satisfied for the nondegenerate TRS. The computing procedure is illustrated in terms of examples found in the quality literature where the comparison results with a gradient-based method are used to calibrate TRSALG.

• International Journal of Highway Engineering
• /
• v.15 no.6
• /
• pp.125-133
• /
• 2013

PURPOSES : The purpose of this study is to propose delay-minimizing operation methodology of a signalized intersection based upon optimization of lane-uses on approaching lanes for an intersection. METHODS : For the optimization model of lane-uses, a set of constraints are set up to ensure feasibility and safety of the lane-uses, traffic flow, and signal settings. Minimization of demand to saturation flow ratio of a dual-ring signal control system is introduced to the objective function for delay minimization and effective signal operation. Using the optimized lane-uses, signal timings are optimized by delay-based model of TRANSYT-7F. RESULTS : It was found that the proposed objective function is great relation with delay time for an intersection. From the experimental results, the method was approved to be effective in reducing delay time. Especially, cases for two left-turn lanes reduced greater delays than those for a left turn lane. It is noticed that the cases for different traffic volume by approach reduced greater delays than those for the same traffic volume by approach. CONCLUSIONS : It was concluded that the objective function is proper for lane-uses optimizing model and the operation method is effective in reducing delay time for signalized intersections.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.891-899
• /
• 2021

We propose a stray inductance extraction method on power modules of the few-kilovolts/several-hundred-amperes class using only low voltages and low currents. The method incorporates a double-pulse generator, a level shifter, a switching device, and a load inductor. The conventional approach generally requires a high voltage of more than half the power module's rated voltage and a high current of around half the rated current. In contrast, the proposed method requires a low voltage and low current environment regardless of the power module's rated voltage because the module is measured in a turn-off state. Both theoretical and experimental results are provided. A physical circuit board was fabricated, and the method was applied to three commercial power modules with EconoDUAL3 cases. The obtained stray inductance values differed from the manufacturer-provided values by less than 1.65 nH, thus demonstrating the method's accuracy. The greatest advantage of the proposed approach is that high voltages or high currents are not required.

• Journal of Powder Materials
• /
• v.30 no.3
• /
• pp.255-261
• /
• 2023

Aluminum alloys are widely utilized in diverse industries, such as automobiles, aerospace, and architecture, owing to their high specific strength and resistance to oxidation. However, to meet the increasing demands of the industry, it is necessary to design new aluminum alloys with excellent properties. Thus, a new method is required to efficiently test additively manufactured aluminum alloys with various compositions within a short period during the alloy design process. In this study, a combinatory approach using a direct energy deposition system for metal 3D printing process with a dual feeder was employed. Two types of aluminum alloy powders, namely Al6061 and Al-12Cu, were utilized for the combinatory test conducted through 3D printing. Twelve types of Al-Si-Cu-Mg alloys were manufactured during this combinatory test, and the relationship between their microstructures and properties was investigated.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.121-144
• /
• 2005

In this paper, we propose unconstrained and constrained posynomial Geometric Programming (GP) problem with negative or positive integral degree of difficulty. Conventional GP approach has been modified to solve some special type of GP problems. In specific case, when the degree of difficulty is negative, the normality and the orthogonality conditions of the dual program give a system of linear equations. No general solution vector exists for this system of linear equations. But an approximate solution can be determined by the least square and also max-min method. Here, modified form of geometric programming method has been demonstrated and for that purpose necessary theorems have been derived. Finally, these are illustrated by numerical examples and applications.