• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.553-559
• /
• 1998

Simple Genetic Algorithm(SGA) proposed by J. H. Holland is a population-based optimization method based on the principle of the Darwinian natural selection. The theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. Although GA goes well in many applications as an optimization method, still it does not guarantee the convergence to a global optimum in some problems. In designing intelligent systems, specially, since there is no deterministic solution, a heuristic trial-and error procedure is usually used to determine the systems' parameters. As an alternative scheme, therefore, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve. In this paper we review the existing co-evolutionary algorithms and propose co-evolutionary schemes designing intelligent systems according to the relation between the system's components.

• Journal of Korean Society of Steel Construction
• /
• v.16 no.6 s.73
• /
• pp.819-832
• /
• 2004

This study describes an efficient and facile method for configuration optimum design of structures. One of the ways to achieve numerical shape representation and the selection of design variables is using the design element concept. Using this technique, the number of design variables could be drastically reduced. Isoparametric mapping was utilized to automatically generate the finite element mesh during the optimization process, and this made it possible to easily calculate the derivatives of the coordinates of generated finite element nodes w.r.t. the design variables. For the structural analysis, finite element analysis was adopted in the optimization procedure, and two different techniques(the deterministic method, a modified method of feasible direction; and the stochastic method, a genetic algorithms) were applied to obtain the minimum volumes and section areas for an efficient configuration optimization procedure. Futhermore, spline interpolation was introduced to present a realistic optimum configuration that meet the manufacturing requirements. According to the results of several numerical examples(steel structures), the two techniques suggested in this study simplified the process of configuration optimum design of structures, and yielded improved objective function values with a robust convergence rate. This study's applicability and capability have therefore been demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2037-2051
• /
• 2012

Cognitive radio (CR) is envisioned as a promising paradigm of exploiting intelligence for enhancing efficiency of underutilized spectrum bands. In CR, the main concern is to reliably sense the presence of primary users (PUs) to attain protection against harmful interference caused by potential spectrum access of secondary users (SUs). In this paper, evolutionary algorithms, namely, particle swarm optimization (PSO) and genetic algorithm (GA) are proposed to minimize the total sensing decision error at the common soft data fusion (SDF) centre of a structurally-centralized cognitive radio network (CRN). Using these techniques, evolutionary operations are invoked to optimize the weighting coefficients applied on the sensing measurement components received from multiple cooperative SUs. The proposed methods are compared with each other as well as with other conventional deterministic algorithms such as maximal ratio combining (MRC) and equal gain combining (EGC). Computer simulations confirm the superiority of the PSO-based scheme over the GA-based and other conventional MRC and EGC schemes in terms of detection performance. In addition, the PSO-based scheme also shows promising convergence performance as compared to the GA-based scheme. This makes PSO an adequate solution to meet real-time requirements.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.6
• /
• pp.28-38
• /
• 2001

In this paper, we propose and analyze a more efficient and flexible dynamic data traffic system for a circuit switched satellite network. Our proposed system is more efficient than existing circuit switched satellite networks and allows for dynamic capacity in each connection without rebuilding or resetting the connection software or algorithms. We also discuss an algorithm for bandwidth allocation that provides deterministic quality of service guarantees. The traffic sources are regulated using standard dual leaky buckets; the system performance is analytically evaluated; and the algorithm is verified through simulation. Our analysis scheme and results should prove useful for the design and implementation of protocols in future circuit-switched satellite networks.

• Korean Journal of Construction Engineering and Management
• /
• v.2 no.2 s.6
• /
• pp.90-97
• /
• 2001

The paper considers non-deterministic methods of analysing the risk exposure in a cost estimate. The method(referred to as the 'Monte Carlo simulation' method) interprets cost data indirectly, to generate a probability distribution for total costs from the deficient elemental experience cost distribution. The Monte Carlo method is popular method for incorporating uncertainty relative to parameter values in risk assessment modelling. Non-deterministic methods, they are here presented as possibly effective foundation on which to risk management in cost estimating. The objectives of this research is to develop a computerized algorithms to forecast the probabilistic total construction cost and the elemental work cost at the planning stage.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.3
• /
• pp.277-288
• /
• 2014

This article reviews various state estimation methods for nonlinear systems, particularly with a perspective of a process control engineer. Nonlinear state estimation methods can be classified into the following two categories: stochastic approaches and deterministic approaches. The current review compares the Bayesian approach, which is mainly a stochastic approach, and the MHE (Moving Horizon Estimation) approach, which is mainly a deterministic approach. Though both methods are reviewed, emphasis is given to the latter as it is particularly well-suited to highly nonlinear systems with slow sampling rates, which are common in chemical process applications. Recent developments in underlying theories and supporting numerical algorithms for MHE are reviewed. Thanks to these developments, applications to large-scale and complex chemical processes are beginning to show up but they are still limited at this point owing to the high numerical complexity of the method.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.715-718
• /
• 2000

Although shared memory parallel programs are designed to be deterministic both in their final results and intermediate states, the races that occur when different processes access a common memory location in an order not guaranteed by synchronization could result in unintended non-deterministic executions of the program. So, Detecting races, particularly first data races, is important for debugging explicit shared memory parallel programs. It is possible that all data races reported by other on-the-fly algorithms would disappear once the first races were removed. To detect races parallel programs with nested loops and inter-thread coordination, it must guarantee the order of synchronization operations in an execution instance. In this paper, we propose an improved restructuring method that guarantee ordering execution instance and preserve the semantics of original program. This method requires O(np) time and (s + up) space, where n is the number of total operations, s is the number of synchronization operations and p is the number of parallelism in the execution. Also, this method makes on-the-fly detection of parallel program with nested loops and inter-thread coordination more easily in space and time complexity.

• Journal of Korean Association for Spatial Structures
• /
• v.21 no.2
• /
• pp.41-48
• /
• 2021

A smart tuned mass damper (TMD) is widely studied for seismic response reduction of various structures. Control algorithm is the most important factor for control performance of a smart TMD. This study used a Deep Deterministic Policy Gradient (DDPG) among reinforcement learning techniques to develop a control algorithm for a smart TMD. A magnetorheological (MR) damper was used to make the smart TMD. A single mass model with the smart TMD was employed to make a reinforcement learning environment. Time history analysis simulations of the example structure subject to artificial seismic load were performed in the reinforcement learning process. Critic of policy network and actor of value network for DDPG agent were constructed. The action of DDPG agent was selected as the command voltage sent to the MR damper. Reward for the DDPG action was calculated by using displacement and velocity responses of the main mass. Groundhook control algorithm was used as a comparative control algorithm. After 10,000 episode training of the DDPG agent model with proper hyper-parameters, the semi-active control algorithm for control of seismic responses of the example structure with the smart TMD was developed. The simulation results presented that the developed DDPG model can provide effective control algorithms for smart TMD for reduction of seismic responses.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.507-514
• /
• 2005

This paper presents a partially decentralized passive replication algorithm for deterministic servers in message-passing distributed systems. The algorithm allows any backup server, not necessarily the primary server, to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery sequence number of the request from the primary. Thanks to thus desirable feature, the algorithm with conventional load balancing techniques can efficiently avoid extreme load conditions on the primary. Therefore, it can provide better scalability of deterministic and replicated sewer systems than traditional passive replication algorithms. Simulation results indicate that the proposed algorithm can reduce $16.5\%{\~}52.3\%$ of the average response time of a client request compared with the traditional ones.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.49-60
• /
• 2023

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution.