• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.926-928
• /
• 1998

A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• Journal of Computing Science and Engineering
• /
• v.8 no.4
• /
• pp.187-198
• /
• 2014

In this paper an efficient image encryption scheme based on cyclic rotations and multiple blockwise diffusions with two chaotic maps is proposed. A Sin map is used to generate round keys for the encryption/decryption process. A Pomeau-Manneville map is used to generate chaotic values for permutation, pixel value rotation and diffusion operations. The encryption scheme is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage performs four operations on the image: row shuffling, column shuffling, cyclic rotation of all the rows and cyclic rotation of all the columns. This stage reduces the correlation significantly among neighboring pixels. The second stage performs circular rotation of pixel values twice by scanning the image horizontally and vertically. The amount of rotation is based on $M{\times}N$ chaotic values. The last stage performs the diffusion four times by scanning the image in four different ways: block of $8{\times}8$ pixels, block of $16{\times}16$ pixels, principal diagonally, and secondary diagonally. Each of the above four diffusions performs the diffusion in two directions (forwards and backwards) with two previously diffused pixels and two chaotic values. This stage makes the scheme resistant to differential attacks. The security and performance of the proposed method is analyzed systematically by using the key space, entropy, statistical, differential and performance analysis. The experimental results confirm that the proposed method is computationally efficient with high security.

• Journal of Veterinary Clinics
• /
• v.28 no.4
• /
• pp.422-426
• /
• 2011

For a national survey in which wide geographic region or an entire country is targeted, multi-stage sampling approach is widely used to overcome the problem of simple random sampling, to consider both herd- and animallevel factors associated with disease occurrence, and to adjust clustering effect of disease in the population in the calculation of sample size. The aim of this study was to establish sample size for estimating bovine tuberculosis (TB) in Korea using stratified two-stage sampling design. The sample size was determined by taking into account the possible clustering of TB-infected animals on individual herds to increase the reliability of survey results. In this study, the country was stratified into nine provinces (administrative unit) and herd, the primary sampling unit, was considered as a cluster. For all analyses, design effect of 2, between-cluster prevalence of 50% to yield maximum sample size, and mean herd size of 65 were assumed due to lack of information available. Using a two-stage sampling scheme, the number of cattle sampled per herd was 65 cattle, regardless of confidence level, prevalence, and mean herd size examined. Number of clusters to be sampled at a 95% level of confidence was estimated to be 296, 74, 33, 19, 12, and 9 for desired precision of 0.01, 0.02, 0.03, 0.04, 0.05, and 0.06, respectively. Therefore, the total sample size with a 95% confidence level was 172,872, 43,218, 19,224, 10,818, 6,930, and 4,806 for desired precision ranging from 0.01 to 0.06. The sample size was increased with desired precision and design effect. In a situation where the number of cattle sampled per herd is fixed ranging from 5 to 40 with a 5-head interval, total sample size with a 95% confidence level was estimated to be 6,480, 10,080, 13,770, 17,280, 20.925, 24,570, 28,350, and 31,680, respectively. The percent increase in total sample size resulting from the use of intra-cluster correlation coefficient of 0.3 was 22.2, 32.1, 36.3, 39.6, 41.9, 42.9, 42,2, and 44.3%, respectively in comparison to the use of coefficient of 0.2.

• Journal of The Korean Association For Science Education
• /
• v.17 no.1
• /
• pp.11-19
• /
• 1997

Students' protocols obtained from think-aloud interviews were analyzed in the aspects of the success at first two problem-solving stages (understanding and planning), the time to complete a problem, the time at each problem-solving stage, the number of transition, and the transition rate. These were compared in the aspects of the context of problem, the success in solving problem, students' logical reasoning ability, spatial ability, and learning approach. The results were as follows:1. Students tended to spend more time in everyday contexts than in scientific contexts, especially at the stages of understanding and reviewing. The transition rate during solving a problem in everyday contexts was greater than that in scientific contexts. 2. Unsuccessful students spent more time at the stage of understanding, but successful students spent more time at the stage of planning. 3. Students' logical reasoning ability, as measured with the Group Assessment of Logical Thinking, was significantly correlated with the success in solving problem. Concrete-operational students spent more time in completing a problem, especially understanding the problem. 4. Students' spatial ability, as measured with the Purdue Visualization of Rotations Test and the Find A Shape Puzzle, was significantly correlated with their abilities to understand a problem and to plan for its solution. 5. Students' learning approach, as measured with the Questionnaire on Approaches to Learning and Studying, was not significantly correlated with the success in solving problem. However, the students in deep approach had more transitions and greater transition rates than the students in surface approach.

• Structural Engineering and Mechanics
• /
• v.50 no.4
• /
• pp.563-573
• /
• 2014

In hydroforming, the general technique employed to overcome the problem of die corner filling consist in increasing the maximum fluid pressure during the forming process. This technique, in other hand, leads to other difficulties such as thinning and rupturing of the final work piece. In this paper, a new technique has been suggested in order to produce a part with complete filled corners. In this approach, two moveable bushes have been used. So, the workpiece moves driven by both bushes simultaneously. In the first stage, system pressure increases until a maximum of 15 MPa, providing aninitial tube bulge. The results showed that the pressure in this stage have to be limited to 17 MPa to avoid fracture. In a second stage, bushes are moved keeping the constant initial pressure. The punches act simultaneously at the die extremities. Results show that the friction between part and die decreases during the forming process significantly. Also, by using this technique it is possible to produce a part with reasonable uniform thickness distribution. Other outcomes of applying this method are the lower pressures required to manufacture a workpiece with complete filled corners with no wrinkling.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.3
• /
• pp.119-127
• /
• 2020

The detection and recognition of abnormal driving becomes crucial for achieving safety in Intelligent Transportation Systems (ITS). This paper presents a feature extraction method based on spectral data to train a neural network model for driving behavior recognition. The proposed method uses a two stage signal processing approach to derive time-saving and efficient feature vectors. For the first stage, the feature vector set is obtained by calculating variances from each frequency bin containing the power spectrum data. The feature set is further reduced in the second stage where an intersection method is used to select more significant features that are finally applied for training a neural network model. A stream of live signals are fed to the trained model which recognizes the abnormal driving behaviors. The driving behaviors considered in this study are weaving, sudden braking and normal driving. The effectiveness of the proposed method is demonstrated by comparing with existing methods, which are Particle Swarm Optimization (PSO) and Convolution Neural Network (CNN). The experiments show that the proposed approach achieves satisfactory results with less computational complexity.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.288-295
• /
• 1998

This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity theshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grounded into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approxi ation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. We apply the proposed classification method to the handwritten numeral character classification. problem and compare its classification performance and learning time with those of the feed forward neural network's back propagation algorithm.

• Structural Engineering and Mechanics
• /
• v.83 no.5
• /
• pp.593-607
• /
• 2022

To solve the problem of detecting structural damage, a two-stage method using the Kalman filter and Particle Swarm Optimization (PSO) is proposed. In this method, the first PSO population is enhanced using the Kalman filter method based on dynamic responses. Due to noise in the sensor responses and errors in the damage detection process, the accuracy of the damage detection process is reduced. This method proposes a novel approach for solve this problem by integrating the Kalman filter and sensitivity analysis. In the Kalman filter, an approximate damage equation is considered as the equation of state and the damage detection equation based on sensitivity analysis is considered as the observation equation. The first population of PSO are the random damage scenarios. These damage scenarios are estimated using a step of the Kalman filter. The results of this stage are then used to detect the exact location of the damage and its severity with the PSO algorithm. The efficiency of the proposed method is investigated using three numerical examples: a 31-element planer truss, a 52-element space dome, and a 56-element space truss. In these examples, damage is detected for several scenarios in two states: using the no noise responses and using the noisy responses. The results show that the precision and efficiency of the proposed method are appropriate in structural damage detection.

• Industrial Engineering and Management Systems
• /
• v.16 no.1
• /
• pp.64-79
• /
• 2017

Identifying disease genes from human genome is a critical task in biomedical research. Important biological features to distinguish the disease genes from the non-disease genes have been mainly selected based on traditional feature selection approaches. However, the traditional feature selection approaches unnecessarily consider many unimportant biological features. As a result, although some of the existing classification techniques have been applied to disease gene identification, the prediction performance was not satisfactory. A small set of the most important biological features can enhance the accuracy of disease gene identification, as well as provide potentially useful knowledge for biologists or clinicians, who can further investigate the selected biological features as well as the potential disease genes. In this paper, we propose a new stepwise random forests (SRF) approach for biological feature selection and disease gene identification. The SRF approach consists of two stages. In the first stage, only important biological features are iteratively selected in a forward selection manner based on one-dimensional random forest regression, where the updated residual vector is considered as the current response vector. We can then determine a small set of important biological features. In the second stage, random forests classification with regard to the selected biological features is applied to identify disease genes. Our extensive experiments show that the proposed SRF approach outperforms the existing feature selection and classification techniques in terms of biological feature selection and disease gene identification.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.648-650
• /
• 1998

This paper proposes a constructive algorithm for generating the Takagi-Sugeno type fuzzy model through the sequential learning from training data set. The proposed algorithm has a two-stage learning scheme that performs both structure and parameter learning simultaneously. The structure learning constructs fuzzy model using two growth criteria to assign new fuzzy rules for given observation data. The parameter learning adjusts the parameters of existing fuzzy rules using the LMS rule. To evaluate the performance of the proposed fuzzy modeling approach, well-known benchmark is used in simulation and compares it with other modeling approaches.