• 제목/요약/키워드: Optimization of Computer Network

검색결과 498건 처리시간 0.03초

Concrete compressive strength prediction using the imperialist competitive algorithm

  • Sadowski, Lukasz;Nikoo, Mehdi;Nikoo, Mohammad
    • Computers and Concrete
    • /
    • 제22권4호
    • /
    • pp.355-363
    • /
    • 2018
  • In the following paper, a socio-political heuristic search approach, named the imperialist competitive algorithm (ICA) has been used to improve the efficiency of the multi-layer perceptron artificial neural network (ANN) for predicting the compressive strength of concrete. 173 concrete samples have been investigated. For this purpose the values of slump flow, the weight of aggregate and cement, the maximum size of aggregate and the water-cement ratio have been used as the inputs. The compressive strength of concrete has been used as the output in the hybrid ICA-ANN model. Results have been compared with the multiple-linear regression model (MLR), the genetic algorithm (GA) and particle swarm optimization (PSO). The results indicate the superiority and high accuracy of the hybrid ICA-ANN model in predicting the compressive strength of concrete when compared to the other methods.

An Efficient Throughput Improvement through Bandwidth Awareness in Cognitive Radio Networks

  • Le, Tung Thanh;Kim, Dong-Seong
    • Journal of Communications and Networks
    • /
    • 제16권2호
    • /
    • pp.146-154
    • /
    • 2014
  • This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

Parallel Genetic Algorithm based on a Multiprocessor System FIN and Its Application to a Classifier Machine

  • 한명묵
    • 한국지능시스템학회논문지
    • /
    • 제8권5호
    • /
    • pp.61-71
    • /
    • 1998
  • Genetic Algorithm(GA) is a method of approaching optimization problems by modeling and simulating the biological evolution. GA needs large time-consuming, so ti had better do on a parallel computer architecture. Our proposed system has a VLSI-oriented interconnection network, which is constructed from a viewpoint of fractal geometry, so that self-similarity is considered in its configuration. The approach to Parallel Genetic Algorithm(PGA) on our proposed system is explained, and then, we construct the classifier system such that the set of samples is classified into weveral classes based on the features of each sample. In the process of designing the classifier system, We have applied PGA to the Traveling Salesman Problem and classified the sample set in the Euclidean space into several categories with a measure of the distance.

  • PDF

유전자 알고리즘을 이용한 예측제어 (Constrained GA-based Predictive Control)

  • Seung C. Shin;Zeungnam Bien
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 추계종합학술대회 논문집
    • /
    • pp.732-735
    • /
    • 1999
  • A GA-based optimization technique is adopted in the paper to obtain optimal future control inputs for predictive control systems. For reliable future predictions of a process, we identify the underlying process with an NNARX model structure and investigate to reduce the volume of neural network based on the Lipschitz index and a criterion. Since most industrial processes are subject to their constraints, we deal with the input-output constraints by modifying some genetic operators and/or using a penalty strategy in the GAPC. Some computer simulations are given to show the effectiveness of the GAPC method compared with the adaptive GPC algorithm.

  • PDF

실시간 통합제어기법을 이용한 차량전자화 설계 (Vetronics Design Using Realtime Integrated Control Techniques)

  • 이석재;민지홍;유준
    • 한국군사과학기술학회지
    • /
    • 제11권3호
    • /
    • pp.89-98
    • /
    • 2008
  • The vetronics is necessarily required for enhancement of the operational capability and optimization of the system architecture. In this paper, we presents the realtime control methods for the vetronics of the fighting vehicles. We proposed the data distribution based on standard bus and computer resource for realtime and integrated control of the system. Embedded computers are designed considering extensibility and reliability of the system. The integrated display improves the operator's capability. We applied the network centric battle management and digital power control with intelligent switching elements to increase cooperated combat efficiency and reliability. To show the feasibility of the presented design schemes, the vetronics has been implemented and applied to a real fighting vehicle.

Distributed Database Design using Evolutionary Algorithms

  • Tosun, Umut
    • Journal of Communications and Networks
    • /
    • 제16권4호
    • /
    • pp.430-435
    • /
    • 2014
  • The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

Artificial Intelligence for the Fourth Industrial Revolution

  • Jeong, Young-Sik;Park, Jong Hyuk
    • Journal of Information Processing Systems
    • /
    • 제14권6호
    • /
    • pp.1301-1306
    • /
    • 2018
  • Artificial intelligence is one of the key technologies of the Fourth Industrial Revolution. This paper introduces the diverse kinds of approaches to subjects that tackle diverse kinds of research fields such as model-based MS approach, deep neural network model, image edge detection approach, cross-layer optimization model, LSSVM approach, screen design approach, CPU-GPU hybrid approach and so on. The research on Superintelligence and superconnection for IoT and big data is also described such as 'superintelligence-based systems and infrastructures', 'superconnection-based IoT and big data systems', 'analysis of IoT-based data and big data', 'infrastructure design for IoT and big data', 'artificial intelligence applications', and 'superconnection-based IoT devices'.

유전 알고리즘 기반의 함수 최적화를 위한 자바 패키지 개발에 관한 연구 (A Study on the Development Java Package for Function Optimization based on Genetic Algorithms)

  • 강환수;강환일;송영기
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
    • /
    • pp.27-30
    • /
    • 2000
  • Many human inventions were inspired by nature. The artificial neural network is one example. Another example is Genetic Algorithms(GA). GAs search by simulating evolution, starting from an initial set of solutions or hypotheses, and generating successive "generations" of solutions. This particular branch of AI was inspired by the way living things evolved into more successful organisms in nature. To simulate the process of GA in a computer, we must simulate many times according to varying many GA parameters. This paper describes the implementation of Java Package for efficient applications on Genetic Algorithms, called "JavaGA". The JavaGA used as a application program as well as applet provides graphical user interface of assigning major GA parameters.

  • PDF

ANALYSIS OF LOOPED WATER DISTRIBUTION NETWORK

  • Ioan Sarbu
    • Water Engineering Research
    • /
    • 제2권3호
    • /
    • pp.171-178
    • /
    • 2001
  • There are three methods for analyzing flow and pressure distribution in looped water distribution networks (the loop method, the node method, the element method) taking into consideration hydraulic parameters chosen as unknown. For all these methods the non-linear system of equations can be solved by iterative procedures. The paper presents a different approach to this problem by using the method of variational formulations for hydraulic analysis of water distribution networks. This method has the advantage that it uses a specialized optimization algorithm which minimizes directly an objective multivariable function without constraints, implemented in a computer program. The paper compares developed method to the classic Hardy-Cross method. This shows the good performance of the new method.

  • PDF

OOPL을 이용한 정보 검색 최적화 시스템에 관한 연구 (A Study on Information Search Optimization System Using OOPL)

  • 김용호;오근탁;이윤배
    • 한국정보통신학회논문지
    • /
    • 제8권5호
    • /
    • pp.1028-1034
    • /
    • 2004
  • 최근 멀티미디어 기반의 WWW(World Wide Web) 서비스를 중심으로 하는 인터넷의 사용이 일반화되면서 전 세계의 컴퓨터망에 존재하는 수많은 정보들을 취득할 수 있게 되었다. 인터넷의 사용이 일반화되고 있는 현대의 사회에서는 정확한 정보를 신속하게 취득하는 것이 중요한 문제로 대두되고 있다. 본 논문에서는 OOPL(Object-Oriented Programming Language)인 JAVA를 이용하여 검색엔진을 설계하고 최적화된 URL을 추출하여 이용자에게 제공함으로써 더욱 정확한 정보를 획득할 수 있음을 보였다. 또한 기존의 국내 제작 검색엔진들과 비교하여 제안한 시스템에서는 배드 링크율이 개선됨을 보였다.