• Title/Summary/Keyword: Computer optimization

Search Result 2,443, Processing Time 0.034 seconds

3D Optimal Design of Transformer Tank Shields using Design Sensitivity Analysis

  • Yingying Yao;Ryu, Jae-Seop;Koh, Chang-Seop;Dexin Xie
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • v.3B no.1
    • /
    • pp.23-31
    • /
    • 2003
  • A novel 3D shape optimization algorithm is presented for electromagnetic devices carry-ing eddy current. The algorithm integrates the 3D finite element performance analysis and the steepest descent method with design sensitivity and mesh relocation method. For the design sensitivity formula, the adjoint variable vector is defined in complex form based on the 3D finite element method for eddy current problems. A new 3D mesh relocation method is also proposed using the deformation theory of the elastic body under stress to renew the mesh as the shape changes. The design sensitivity f3r the sur-face nodal points is also systematically converted into that for the design variables for the parameterized optimization application. The proposed algorithm is applied to the optimum design of the tank shield model of the transformer and the effectiveness is proved.

Studies on Optimization of Vehicle Composition for Percutaneous Absorption (연고기제 조성의 최적화에 관한 연구)

  • Lee, Jae-Bong;Lee, Chi-Ho;Rho, Yung-Jae
    • Journal of Pharmaceutical Investigation
    • /
    • v.18 no.1
    • /
    • pp.31-41
    • /
    • 1988
  • Computer optimization technique was applied to obtain the optimum formula of o/w type ointment vehicle containing sodium lauryl sulfate and 1-methyl-2-pyrrolidinone (MP). In order to determine the feasibility of optimizing a vehicle composition with the aid of computer, the amounts of sodium lauryl sulfate $(X_1)$, salicylic acid $(X_2)$, and MP $(X_3)$ were selected as the independent variables for the solubility and the absorption rates of salicylic acid (dependent variables). The experimental values of absorption rates agreed well with the calculation values obtained from the polynomial regression analysis, and the contour charts drawn by computer were useful in optimization process.

  • PDF

Optimization of a Gate Valve using Design of Experiments and the Kriging Based Approximation Model (실험계획법과 크리깅 근사모델에 의한 게이트밸브 최적화)

  • Kang, Jung-Ho;Kang, Jin;Park, Young-Chul
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.14 no.6
    • /
    • pp.125-131
    • /
    • 2005
  • The purpose of this study is an optimization of gate valve made by forging method instead of welding method. In this study, we propose an optimal shape design to improve the mechanical efficiency of gate valve. In order to optimize more efficiently and reliably, the meta-modeling technique has been developed to solve such a complex problems combined with the DACE (Design and Analysis of Computer Experiments). The DACE modeling, known as the one of Kriging interpolation, is introduced to obtain the surrogate approximation model of the function. Also, we prove reliability of the DACE model's application to gate valve by computer simulations using FEM(Finite Element Method).

Optimization of Computer Network with a Cost Constraint (비용 제약을 갖는 컴퓨터 네트워크의 최적화)

  • Lee, Han-Jin;Yum, Chang-Sun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.1
    • /
    • pp.82-88
    • /
    • 2007
  • This paper considers a topological optimization of a computer network design with a cost constraint. The objective is to find the topological layout of links, at maximal reliability, under the constraint that the network cost is less or equal than a given level of budget. This problem is known to be NP-hard. To efficiently solve the problem, a genetic approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a simulated annealing method.

Likelihood-based Directional Optimization for Development of Random Pattern Authentication System (랜덤 패턴 인증 방식의 개발을 위한 우도 기반 방향입력 최적화)

  • Choi, Yeonjae;Lee, Hyun-Gyu;Lee, Sang-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.1
    • /
    • pp.71-80
    • /
    • 2015
  • Many researches have been studied to overcome the weak points in authentication schemes of mobile devices such as pattern-authentication that is vulnerable for smudge-attack. Since random-pattern-lock authenticates users by drawing figure of predefined-shape, it can be a method for robust security. However, the authentication performance of random-pattern-lock is influenced by input noise and individual characteristics sign pattern. We introduce an optimization method of user input direction to increase the authentication accuracy of random-pattern-lock. The method uses the likelihood of each direction given an data which is angles of line drawing by user. We adjusted recognition range for each direction and achieved the authentication rate of 95.60%.

Using Machine Learning to Improve Evolutionary Multi-Objective Optimization

  • Alotaibi, Rakan
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.203-211
    • /
    • 2022
  • Multi-objective optimization problems (MOPs) arise in many real-world applications. MOPs involve two or more objectives with the aim to be optimized. With these problems improvement of one objective may led to deterioration of another. The primary goal of most multi-objective evolutionary algorithms (MOEA) is to generate a set of solutions for approximating the whole or part of the Pareto optimal front, which could provide decision makers a good insight to the problem. Over the last decades or so, several different and remarkable multi-objective evolutionary algorithms, have been developed with successful applications. However, MOEAs are still in their infancy. The objective of this research is to study how to use and apply machine learning (ML) to improve evolutionary multi-objective optimization (EMO). The EMO method is the multi-objective evolutionary algorithm based on decomposition (MOEA/D). The MOEA/D has become one of the most widely used algorithmic frameworks in the area of multi-objective evolutionary computation and won has won an international algorithm contest.

DIntrusion Detection in WSN with an Improved NSA Based on the DE-CMOP

  • Guo, Weipeng;Chen, Yonghong;Cai, Yiqiao;Wang, Tian;Tian, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5574-5591
    • /
    • 2017
  • Inspired by the idea of Artificial Immune System, many researches of wireless sensor network (WSN) intrusion detection is based on the artificial intelligent system (AIS). However, a large number of generated detectors, black hole, overlap problem of NSA have impeded further used in WSN. In order to improve the anomaly detection performance for WSN, detector generation mechanism need to be improved. Therefore, in this paper, a Differential Evolution Constraint Multi-objective Optimization Problem based Negative Selection Algorithm (DE-CMOP based NSA) is proposed to optimize the distribution and effectiveness of the detector. By combining the constraint handling and multi-objective optimization technique, the algorithm is able to generate the detector set with maximized coverage of non-self space and minimized overlap among detectors. By employing differential evolution, the algorithm can reduce the black hole effectively. The experiment results show that our proposed scheme provides improved NSA algorithm in-terms, the detectors generated by the DE-CMOP based NSA more uniform with less overlap and minimum black hole, thus effectively improves the intrusion detection performance. At the same time, the new algorithm reduces the number of detectors which reduces the complexity of detection phase. Thus, this makes it suitable for intrusion detection in WSN.

Resource Allocation based on Quantized Feedback for TDMA Wireless Mesh Networks

  • Xu, Lei;Tang, Zhen-Min;Li, Ya-Ping;Yang, Yu-Wang;Lan, Shao-Hua;Lv, Tong-Ming
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.3
    • /
    • pp.160-167
    • /
    • 2013
  • Resource allocation based on quantized feedback plays a critical role in wireless mesh networks with a time division multiple access (TDMA) physical layer. In this study, a resource allocation problem was formulated based on quantized feedback for TDMA wireless mesh networks that minimize the total transmission power. Three steps were taken to solve the optimization problem. In the first step, the codebook of the power, rate and equivalent channel quantization threshold was designed. In the second step, the timeslot allocation criterion was deduced using the primal-dual method. In the third step, a resource allocation scheme was developed based on quantized feedback using the stochastic optimization tool. The simulation results show that the proposed scheme not only reduces the total transmission power, but also has the advantage of quantized feedback.

  • PDF

Cloud Task Scheduling Based on Proximal Policy Optimization Algorithm for Lowering Energy Consumption of Data Center

  • Yang, Yongquan;He, Cuihua;Yin, Bo;Wei, Zhiqiang;Hong, Bowei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.6
    • /
    • pp.1877-1891
    • /
    • 2022
  • As a part of cloud computing technology, algorithms for cloud task scheduling place an important influence on the area of cloud computing in data centers. In our earlier work, we proposed DeepEnergyJS, which was designed based on the original version of the policy gradient and reinforcement learning algorithm. We verified its effectiveness through simulation experiments. In this study, we used the Proximal Policy Optimization (PPO) algorithm to update DeepEnergyJS to DeepEnergyJSV2.0. First, we verify the convergence of the PPO algorithm on the dataset of Alibaba Cluster Data V2018. Then we contrast it with reinforcement learning algorithm in terms of convergence rate, converged value, and stability. The results indicate that PPO performed better in training and test data sets compared with reinforcement learning algorithm, as well as other general heuristic algorithms, such as First Fit, Random, and Tetris. DeepEnergyJSV2.0 achieves better energy efficiency than DeepEnergyJS by about 7.814%.

New Techniques for Optimal Treatment Planning for LINAC-based Stereotactic Radiosurgery (LINAC 뇌정의적 방사선 수술시 새로운 최적 선량분포계획 시스템의 개발)

  • Suh Tae-suk
    • Radiation Oncology Journal
    • /
    • v.10 no.1
    • /
    • pp.95-100
    • /
    • 1992
  • Since LINAC-based stereotactic radiosurgery uses multiple noncoplanar arcs, three-dimensional dose evaluation and many beam parameters, a lengthy computation time is required to optimize even the simplest case by a trial and error. The basic approach presented in this paper is to show promising methods using an experimental optimization and an analytic optimization The purpose of this paper is not to describe the detailed methods, but introduce briefly, proceeding research done currently or in near future. A more detailed description will be shown in ongoing published papers. Experimental optimization is based on two approaches. One is shaping the target volumes through the use of multiple isocenters determined from dose experience and testing. The other method is conformal therapy using a beam's eye view technique and field shaping. The analytic approach is to adapt computer-aided design optimization in finding optimum irradiation parameters automatically.

  • PDF