• Title/Summary/Keyword: Genetic network

Search Result 1,144, Processing Time 0.028 seconds

An Effective Frequency Sharing Method using Spectrum Etiquette and Genetic Algorithm for the Coexistence of WRAN and WLAN in TV White Space (TVWS에서 스펙트럼 에티켓 및 GA를 사용한 WRAN과 WLAN의 효율적 주파수 공유기법)

  • Jeong, Won-Sik;Jang, Sung-Jeen;Yong, Seulbaro;Kim, Jae-Moung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2A
    • /
    • pp.83-94
    • /
    • 2012
  • Various wireless communication devices or network such as WRAN and WLAN will coexist in the TVWS(TV White Space). Because of this coexistence, the wireless devices which use the TVWS have to avoid interfering to not only licensed TV receiver and wireless microphone but also homogeneous or heterogeneous TVBD(TV Band Device)s. In this paper, we propose two frequency sharing methods for the coexistence of WLAN and WRAN in terms of interference reduction and throughput enhancement in both homogeneous and heterogeneous networks. One is the WRAN spectrum etiquette to provide more wide bandwidth for WLAN users and the other is the WLAN frequency selection methods to improve the throughput performance. The simulation results have confirmed the throughput improvement of the proposed methods. Moreover, the proposed methods is also applicable to improve the throughput performance and reduce interference of similar systems working in a cognitive manner.

Development of a Bi-objective Cycle-free Signal Timing Model Using Genetic Algorithm (유전자 알고리즘을 이용한 이중목적 주기변동 신호시간 결정 모형 개발)

  • 최완석;이영인
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.5
    • /
    • pp.81-98
    • /
    • 2002
  • This paper documents the development of a bi-objective(minimizing delays and Queue lengths) cycle-free signal timing length model using Genetic Algorithm. The model was embodied using MATLAB. the language of technical computing. A special feature of this model is its ability to concurrently manage delays and queue lengths of turning movement concurrently. The model produces a cycle-free signal timing(cycles and green times) for each intersection on the cycle basis. Appropriate offsets could be also accomplished by applying cycle-free based signal timings for respective intersections. The model was applied to an example network which consists of four intersections. The result shows that the model produces superior signal timings to the existing signal timing model in terms of managing delays and queue lengths of turning movements.

Optimum design and vibration control of a space structure with the hybrid semi-active control devices

  • Zhan, Meng;Wang, Sheliang;Yang, Tao;Liu, Yang;Yu, Binshan
    • Smart Structures and Systems
    • /
    • v.19 no.4
    • /
    • pp.341-350
    • /
    • 2017
  • Based on the super elastic properties of the shape memory alloy (SMA) and the inverse piezoelectric effect of piezoelectric (PZT) ceramics, a kind of hybrid semi-active control device was designed and made, its mechanical properties test was done under different frequency and different voltage. The local search ability of genetic algorithm is poor, which would fall into the defect of prematurity easily. A kind of adaptive immune memory cloning algorithm(AIMCA) was proposed based on the simulation of clone selection and immune memory process. It can adjust the mutation probability and clone scale adaptively through the way of introducing memory cell and antibody incentive degrees. And performance indicator based on the modal controllable degree was taken as antigen-antibody affinity function, the optimization analysis of damper layout in a space truss structure was done. The structural seismic response was analyzed by applying the neural network prediction model and T-S fuzzy logic. Results show that SMA and PZT friction composite damper has a good energy dissipation capacity and stable performance, the bigger voltage, the better energy dissipation ability. Compared with genetic algorithm, the adaptive immune memory clone algorithm overcomes the problem of prematurity effectively. Besides, it has stronger global searching ability, better population diversity and faster convergence speed, makes the damper has a better arrangement position in structural dampers optimization leading to the better damping effect.

PC Cluster based Parallel Adaptive Evolutionary Algorithm for Service Restoration of Distribution Systems

  • Mun, Kyeong-Jun;Lee, Hwa-Seok;Park, June-Ho;Kim, Hyung-Su;Hwang, Gi-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.4
    • /
    • pp.435-447
    • /
    • 2006
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

An Effective Frequency Sharing Method using Cognitive Radio in GSO Satellite Network (인지무선 라디오 기술을 이용한 효율적인 GSO 위성망 주파수 공유방법)

  • Jung, Won-Sik;Jang, Sung-Jeen;Cho, Jae-Bum;Kim, Jae-Moung
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.2
    • /
    • pp.57-63
    • /
    • 2010
  • Many efficient frequency sharing methods are issued in present because of increasing users with various wireless communication terminals. In the satellite communications, the service coverage is generally very wide so frequency sharing with terrestrial system is essentially needed, and the research is progressing dynamically related on this frequency sharing method. But if we adopt the terrestrial system which is commonly used, it can't avoid the interference from terrestrial service to satellite service. Therefore, this paper will introduce methods for reducing the interference from terrestrial station to earth station using cognitive radio system Satellite system is guaranteed with decreasing interference from terrestrial stations using Genetic Algorithm based power control method. Furthermore, terrestrial systems can have increased QoS because the frequency reuse factor in proposed method is higher than existing methods.

Self-Organizing Polynomial Neural Networks Based on Genetically Optimized Multi-Layer Perceptron Architecture

  • Park, Ho-Sung;Park, Byoung-Jun;Kim, Hyun-Ki;Oh, Sung-Kwun
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.4
    • /
    • pp.423-434
    • /
    • 2004
  • In this paper, we introduce a new topology of Self-Organizing Polynomial Neural Networks (SOPNN) based on genetically optimized Multi-Layer Perceptron (MLP) and discuss its comprehensive design methodology involving mechanisms of genetic optimization. Let us recall that the design of the 'conventional' SOPNN uses the extended Group Method of Data Handling (GMDH) technique to exploit polynomials as well as to consider a fixed number of input nodes at polynomial neurons (or nodes) located in each layer. However, this design process does not guarantee that the conventional SOPNN generated through learning results in optimal network architecture. The design procedure applied in the construction of each layer of the SOPNN deals with its structural optimization involving the selection of preferred nodes (or PNs) with specific local characteristics (such as the number of input variables, the order of the polynomials, and input variables) and addresses specific aspects of parametric optimization. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between the approximation and generalization (predictive) abilities of the model. To evaluate the performance of the GA-based SOPNN, the model is experimented using pH neutralization process data as well as sewage treatment process data. A comparative analysis indicates that the proposed SOPNN is the model having higher accuracy as well as more superb predictive capability than other intelligent models presented previously.reviously.

A study on the fault diagnosis of rotating machine by machine learning (기계학습을 적용한 회전체 고장진단에 관한 연구)

  • Jeon, Hang-Kyu;Kim, Ji-Sun;Kim, Bong-Ju;Kim, Won-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.4
    • /
    • pp.263-269
    • /
    • 2020
  • In this study, a rotating machine that can reproduce normal condition and 8 fault conditions were produced, and vibration data was acquired. Feature is calculated from the acquired data, and accuracy is analyzed through fault diagnosis using artificial neural networks and genetic algorithms. In order to achieve optimal timing and higher accuracy, features by three domains were applied to the fault diagnosis. The learning number was selected as a setting variable. As a result of the rotating machine fault diagnosis, high precision was found in the frequency domain than in others, and precise fault diagnoses were accomplished through all of 10 operations, at the learning number of 5000 and 8000. Given the efficiency of time, it was estimated to be the most efficient when the number of learning was 5000.

Adaptive Intrusion Detection Algorithm based on Learning Algorithm (학습 알고리즘 기반의 적응형 침입 탐지 알고리즘)

  • Sim, Kwee-Bo;Yang, Jae-Won;Lee, Dong-Wook;Seo, Dong-Il;Choi, Yang-Seo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.1
    • /
    • pp.75-81
    • /
    • 2004
  • Signature based intrusion detection system (IDS), having stored rules for detecting intrusions at the library, judges whether new inputs are intrusion or not by matching them with the new inputs. However their policy has two restrictions generally. First, when they couldn`t make rules against new intrusions, false negative (FN) errors may are taken place. Second, when they made a lot of rules for maintaining diversification, the amount of resources grows larger proportional to their amount. In this paper, we propose the learning algorithm which can evolve the competent of anomaly detectors having the ability to detect anomalous attacks by genetic algorithm. The anomaly detectors are the population be composed of by following the negative selection procedure of the biological immune system. To show the effectiveness of proposed system, we apply the learning algorithm to the artificial network environment, which is a computer security system.

Multicast Routing On High Speed networks using Evolutionary Algorithms (진화 알고리즘을 이용한 초고속 통신망에서의 멀티캐스트 경로배정 방법에 관한 연구)

  • Lee, Chang-Hoon;Zhang, Byoung-Tak;Ahn, Sang-Hyun;Kwak, Ju-Hyun;Kim, Jae-Hoon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.3
    • /
    • pp.671-680
    • /
    • 1998
  • Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.

  • PDF

(Visualization Tool of searching process of Particle Swarm Optimization) (PSO(Particle Swarm Optinization)탐색과정의 가시화 툴)

  • 유명련;김현철
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.4
    • /
    • pp.35-41
    • /
    • 2002
  • To solve the large scale optimization problem approximately, various approaches have been introduced. They are mainly based on recent research advancement of simulations for evolutions, flocking, annealing, and interactions among organisms on artificial environments. The typical ones are simulated annealing(SA), artificial neural network(ANN), genetic algorithms(GA), tabu search(TS), etc. Recently the particle swarm optimization(PSO) has been introduced. The PSO simulates the process of birds flocking or fish schooling for food, as with the information of each agent Is share by other agents. The PSO technique has been applied to various optimization problems of which variables are continuous. However, there are seldom trials for visualization of searching process. This paper proposes a new visualization tool for searching process particle swarm optimization(PSO) algorithm. The proposed tool is effective for understanding the searching process of PSO method and educational for students.

  • PDF