• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.68-77
• /
• 2004

In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer&; needs, network operator can differentiate incoming connections and handle those in the buffers and the interfaces in different ways. In this paper, dynamic QoS-aware scheduling algorithm is presented and investigated in the single node case. The purpose of the algorithm is in addition to fair resource sharing to different types of traffic classes with different priorities ?to maximize revenue of the service provider. It is derived from the linear type of revenue target function, and closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly nonstationary environments. In addition, it is nonparametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions. Also, Call Admission Control (CAC) mechanism is used by hypothesis testing.

• Journal of Astronomy and Space Sciences
• /
• v.38 no.4
• /
• pp.217-227
• /
• 2021

In this study, we describe an analytical process for designing a low Earth orbit constellation for discontinuous regional coverage, to be used for a surveillance and reconnaissance space mission. The objective of this study was to configure a satellite constellation that targeted multiple areas near the Korean Peninsula. The constellation design forms part of a discontinuous regional coverage problem with a minimum revisit time. We first introduced an optimal inclination search algorithm to calculate the orbital inclination that maximizes the geometrical coverage of single or multiple ground targets. The common ground track (CGT) constellation pattern with a repeating period of one nodal day was then used to construct the rest of the orbital elements of the constellation. Combining these results, we present an analytical design process that users can directly apply to their own situation. For Seoul, for example, 39.0° was determined as the optimal orbital inclination, and the maximum and average revisit times were 58.1 min and 27.9 min for a 20-satellite constellation, and 42.5 min and 19.7 min for a 30-satellite CGT constellation, respectively. This study also compares the revisit times of the proposed method with those of a traditional Walker-Delta constellation under three inclination conditions: optimal inclination, restricted inclination by launch trajectories from the Korean Peninsula, and inclination for the sun-synchronous orbit. A comparison showed that the CGT constellation had the shortest revisit times with a non-optimal inclination condition. The results of this analysis can serve as a reference for determining the appropriate constellation pattern for a given inclination condition.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.3 no.1
• /
• pp.116-126
• /
• 2000

Turbo codes are the most exciting and potentially important development in coding theory in recent years. They were introduced in 1993 by Berrou, Glavieux and $Thitimajshima,({(1)}$ and claimed to achieve near Shannon-limit error correction performance with relatively simple component codes and large interleavers. A required Eb/N0 of 0.7㏈ was reported for BER of $10^{-5}$ and code rate of $l/2.^{(1)}$ However, to implement the turbo code system, there are various important details that are necessary to reproduce these results such as AGC gain control, optimal wordlength determination, and metric rescaling. Further, the memory required to implement MAP-based turbo decoder is relatively considerable. In this paper, we confirmed the accuracy of these claims by computer simulation considering these points, and presented a optimal wordlength for Turbo code design. First, based on the analysis and simulation of the turbo decoder, we determined an optimal wordlength of Turbo decoder. Second, we suggested the MAP decoding algorithm based on sliding-window method which reduces the system memory significantly. By computer simulation, we could demonstrate that the suggested fixed-point Turbo decoder operates well with negligible performance loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.271-280
• /
• 2007

This paper presents a power control scheme for OFDM based wireless communication systems in a multicell environment with co-channel interference which enables each system to achieve its target level of transmission bit rate. Generally, the optimal or near optimal power control scheme for multicarrier systems is Down to control the power level of each subcarrier in accordance with the associated channel status, which may be found in WF(waterfilling) and WF(iterative waterfilling) schemes. However, this requires the channel state information associated with every subchannel to be fed back from the receiver to its transmitter for successful power control. If the wireless channel exhibits relatively fast fading or the number of subcarriers is large, this may result in a considerable overhead. Here, in order to alleviate this problem, we propose a power control strategy for an OFDM systems maintaining the same power level over all the subcarriers. Also we prove its convergence, compare its complexity with that of the existing IWF algorithm, and examine its convergence characteristic through computer simulations.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.1
• /
• pp.55-65
• /
• 2009

Due to the rapid increase of electricity demand, consideration of environmental constraints in optimal power flow (OPF) problems is increasingly important. In Algeria, up to 90% of electricity is produced by thermal generators (vapor, gas). In order to keep the emission of gaseous pollutants like sulfur dioxide (SO2) and Nitrogen (NO2) under the admissible ecological limits, many conventional and global optimization methods have been proposed to study the trade-off relation between fuel cost and emissions. This paper presents an efficient decomposed Parallel GA to solve the multi-objective environmental/economic dispatch problem. At the decomposed stage the length of the original chromosome is reduced successively and adapted to the topology of the new partition. Two subproblems are proposed: the first subproblem is related to the active power planning to minimize the total fuel cost, and the second subproblem is a reactive power planning design based in practical rules to make fine corrections to the voltage deviation and reactive power violation using a specified number of shunt dynamic compensators named Static Var Compensators (SVC). To validate the robustness of the proposed approach, the algorithm proposed was tested on the Algerian 59-bus network test and compared with conventional methods and with global optimization methods (GA, FGA, and ACO). The results show that the approach proposed can converge to the near solution and obtain a competitive solution at a critical situation and within a reasonable time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.203-210
• /
• 2017

Data clustering is one of the most difficult and challenging problems and can be formally considered as a particular kind of NP-hard grouping problems. The K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, it has high possibility to trap in local optimum and high variation of solutions with different initials for the large data set. Therefore, we need study efficient computational intelligence method to find the global optimal solution in data clustering problem within limited computational time. The objective of this paper is to propose a combined artificial bee colony (CABC) with K-means for initialization and finalization to find optimal solution that is effective on data clustering optimization problem. The artificial bee colony (ABC) is an algorithm motivated by the intelligent behavior exhibited by honeybees when searching for food. The performance of ABC is better than or similar to other population-based algorithms with the added advantage of employing fewer control parameters. Our proposed CABC method is able to provide near optimal solution within reasonable time to balance the converged and diversified searches. In this paper, the experiment and analysis of clustering problems demonstrate that CABC is a competitive approach comparing to previous partitioning approaches in satisfactory results with respect to solution quality. We validate the performance of CABC using Iris, Wine, Glass, Vowel, and Cloud UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KABCK (K-means+ABC+K-means) is better than ABCK (ABC+K-means), KABC (K-means+ABC), ABC, and K-means in our simulations.

• Smart Structures and Systems
• /
• v.20 no.1
• /
• pp.61-74
• /
• 2017

One of the most reliable and simplest tools for structural vibration control in civil engineering is Tuned Mass Damper, TMD. Provided that the frequency and damping parameters of these dampers are tuned appropriately, they can reduce the vibrations of the structure through their generated inertia forces, as they vibrate continuously. To achieve the optimal parameters of TMD, many different methods have been provided so far. In old approaches, some formulas have been offered based on simplifying models and their applied loadings while novel procedures need to model structures completely in order to obtain TMD parameters. In this paper, with regard to the nonlinear decision-making of fuzzy systems and their enough ability to cope with different unreliability, a method is proposed. Furthermore, by taking advantage of both old and new methods a fuzzy system is designed to be operational and reduce uncertainties related to models and applied loads. To design fuzzy system, it is required to gain data on structures and optimum parameters of TMDs corresponding to these structures. This information is obtained through modeling MDOF systems with various numbers of stories subjected to far and near field earthquakes. The design of the fuzzy systems is performed by three methods: look-up table, the data space grid-partitioning, and clustering. After that, rule weights of Mamdani fuzzy system using the look-up table are optimized through genetic algorithm and rule weights of Sugeno fuzzy system designed based on grid-partitioning methods and clustering data are optimized through ANFIS (Adaptive Neuro-Fuzzy Inference System). By comparing these methods, it is observed that the fuzzy system technique based on data clustering has an efficient function to predict the optimal parameters of TMDs. In this method, average of errors in estimating frequency and damping ratio is close to zero. Also, standard deviation of frequency errors and damping ratio errors decrease by 78% and 4.1% respectively in comparison with the look-up table method. While, this reductions compared to the grid partitioning method are 2.2% and 1.8% respectively. In this research, TMD parameters are estimated for a 15-degree of freedom structure based on designed fuzzy system and are compared to parameters obtained from the genetic algorithm and empirical relations. The progress up to 1.9% and 2% under far-field earthquakes and 0.4% and 2.2% under near-field earthquakes is obtained in decreasing respectively roof maximum displacement and its RMS ratio through fuzzy system method compared to those obtained by empirical relations.

• Smart Structures and Systems
• /
• v.25 no.1
• /
• pp.65-80
• /
• 2020

In order to protect a structure over its full life cycle, a novel tuned mass damper (TMD), the so-called semi-active eddy current pendulum tuned mass damper (SAEC-PTMD), which can retune its frequency and damping ratio in real-time, is proposed in this study. The structural instantaneous frequency is identified through a Hilbert-Huang transformation (HHT), and the SAEC-PTMD pendulum is adjusted through an HHT-based control algorithm. The eddy current damping parameters are discussed, and the relationship between effective damping coefficients and air gaps is fitted through a polynomial function. The semi-active eddy current damping can be adjusted in real-time by adjusting the air gap based on the linear-quadratic-Gaussian (LQG)-based control algorithm. To verify the vibration control effect of the SAEC-PTMD, an idealized linear primary structure equipped with an SAEC-PTMD excited by harmonic excitations and near-fault pulse-like earthquake excitations is proposed as one of the two case studies. Under strong earthquakes, structures may go into the nonlinear state, while the Bouc-Wen model has a wild application in simulating the hysteretic characteristic. Therefore, in the other case study, a nonlinear primary structure based on the Bouc-Wen model is proposed. An optimal passive TMD is used for comparison and the detuning effect, which results from the cumulative damage to primary structures, is considered. The maximum and root-mean-square (RMS) values of structural acceleration and displacement time history response, structural acceleration, and displacement response spectra are used as evaluation indices. Power analyses for one earthquake excitation are presented as an example to further study the energy dissipation effect of an SAECPTMD. The results indicate that an SAEC-PTMD performs better than an optimized passive TMD, both before and after damage occurs to the primary structure.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.2
• /
• pp.44-50
• /
• 1999

This paper presents a set of techniques to automatically find rate optimal or near rate optimal implementation of shift-invariant flow graphs on pipelined processor, in which pipeline processor has multiple accumulators and internal datapaths. In such case, the problem to be addressed is the scheduling of multiple instruction streams which control all of the pipeline stages. The goal of an automatic scheduler in this context is to rearrange the order of instructions such that they are executed with minimum iteration period between successive iteration of defining flow graphs. The scheduling algorithm described in this paper also focuses on the problem of removing the hazards due to inter-instruction dependencies.