• 제목/요약/키워드: Computer optimization

검색결과 2,426건 처리시간 0.034초

Service ORiented Computing EnviRonment (SORCER) for deterministic global and stochastic aircraft design optimization: part 2

  • Raghunath, Chaitra;Watson, Layne T.;Jrad, Mohamed;Kapania, Rakesh K.;Kolonay, Raymond M.
    • Advances in aircraft and spacecraft science
    • /
    • 제4권3호
    • /
    • pp.317-334
    • /
    • 2017
  • With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

An Optimized Deep Learning Techniques for Analyzing Mammograms

  • Satish Babu Bandaru;Natarajasivan. D;Rama Mohan Babu. G
    • International Journal of Computer Science & Network Security
    • /
    • 제23권7호
    • /
    • pp.39-48
    • /
    • 2023
  • Breast cancer screening makes extensive utilization of mammography. Even so, there has been a lot of debate with regards to this application's starting age as well as screening interval. The deep learning technique of transfer learning is employed for transferring the knowledge learnt from the source tasks to the target tasks. For the resolution of real-world problems, deep neural networks have demonstrated superior performance in comparison with the standard machine learning algorithms. The architecture of the deep neural networks has to be defined by taking into account the problem domain knowledge. Normally, this technique will consume a lot of time as well as computational resources. This work evaluated the efficacy of the deep learning neural network like Visual Geometry Group Network (VGG Net) Residual Network (Res Net), as well as inception network for classifying the mammograms. This work proposed optimization of ResNet with Teaching Learning Based Optimization (TLBO) algorithm's in order to predict breast cancers by means of mammogram images. The proposed TLBO-ResNet, an optimized ResNet with faster convergence ability when compared with other evolutionary methods for mammogram classification.

Couple Particle Swarm Optimization for Multimodal Functions

  • ;;고창섭
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2008년도 춘계학술대회 논문집 전기기기 및 에너지변환시스템부문
    • /
    • pp.44-46
    • /
    • 2008
  • This paper Proposes a new couple particle swarm optimization (CPSO) for multimodal functions. In this method, main particles are generated uniformly using Faure-sequences, and move accordingly to cognition only model. If any main particle detects the movement direction which has local optimum, this particle would create a new particle beside itself and make a couple. After that, all couples move accordingly to conventional particle swarm optimization (PSO) model. If these couples tend toward the same local optimum, only the best couple would be kept and the others would be eliminated. We had applied this method to some analytic multimodal functions and successfully locate all local optima.

  • PDF

Modified GMM Training for Inexact Observation and Its Application to Speaker Identification

  • Kim, Jin-Young;Min, So-Hee;Na, Seung-You;Choi, Hong-Sub;Choi, Seung-Ho
    • 음성과학
    • /
    • 제14권1호
    • /
    • pp.163-174
    • /
    • 2007
  • All observation has uncertainty due to noise or channel characteristics. This uncertainty should be counted in the modeling of observation. In this paper we propose a modified optimization object function of a GMM training considering inexact observation. The object function is modified by introducing the concept of observation confidence as a weighting factor of probabilities. The optimization of the proposed criterion is solved using a common EM algorithm. To verify the proposed method we apply it to the speaker recognition domain. The experimental results of text-independent speaker identification with VidTimit DB show that the error rate is reduced from 14.8% to 11.7% by the modified GMM training.

  • PDF

TraceMonkey 자바스크립트 엔진에서의 트레이스 오버헤드 감소 방안 (Reducing the Trace Overhead for TraceMonkey JavaScript Engine)

  • 유영호;이성원;문수묵
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2010년도 한국컴퓨터종합학술대회논문집 Vol.37 No.2(A)
    • /
    • pp.147-148
    • /
    • 2010
  • 최근 IT 산업 전반에 걸쳐 모바일에 대한 중요도가 높아짐에 따라 인터넷 브라우저의 성능이 중요하게 되었다. 자바스크립트 언어의 수행은 인터넷 브라우저의 사용에 있어 상당히 비중이 높다. 이 논문에서는 자바스크립트 언어를 수행하는 엔진 중 하나인 TraceMonkey엔진이 트레이스를 하는 과정에서 생기는 오버헤드를 줄이는 최적화를 구현, 적용하고 이를 실험하여 평가한다.

  • PDF

Structure Learning in Bayesian Networks Using Asexual Reproduction Optimization

  • Khanteymoori, Ali Reza;Menhaj, Mohammad Bagher;Homayounpour, Mohammad Mehdi
    • ETRI Journal
    • /
    • 제33권1호
    • /
    • pp.39-49
    • /
    • 2011
  • A new structure learning approach for Bayesian networks based on asexual reproduction optimization (ARO) is proposed in this paper. ARO can be considered an evolutionary-based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter, the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem: This leads to the fitter individual. The convergence measure of ARO is analyzed. The proposed method is applied to real-world and benchmark applications, while its effectiveness is demonstrated through computer simulations. Results of simulations show that ARO outperforms genetic algorithm (GA) because ARO results in a good structure and fast convergence rate in comparison with GA.

DP Formulation of Microgrid Operation with Heat and Electricity Constraints

  • Nguyen, Minh Y;Choi, Nack-Hyun;Yoon, Yong-Tae
    • Journal of Power Electronics
    • /
    • 제9권6호
    • /
    • pp.919-928
    • /
    • 2009
  • Microgrids (MGs) are typically comprised of distributed generators (DGs) including renewable energy sources (RESs), storage devices and controllable loads, which can operate in either interconnected or isolated mode from the main distribution grid. This paper introduces a novel dynamic programming (DP) approach to MG optimization which takes into consideration the coordination of energy supply in terms of heat and electricity. The DP method has been applied successfully to several cases in power system operations. In this paper, a special emphasis is placed on the uncontrollability of RESs, the constraints of DGs, and the application of demand response (DR) programs such as directed load control (DLC), interruptible/curtaillable (I/C) service, and/or demand-side bidding (DSB) in the deregulated market. Finally, in order to illustrate the optimization results, this approach is applied to a couple of examples of MGs in a certain configuration. The results also show the maximum profit that can be achieved.

비선형계량법(非線型計量法)을 이용한 신뢰성(信賴性)의 최적화(最適化) (Reliability Optimization By using a Nonlinear Programming)

  • 이창호
    • 품질경영학회지
    • /
    • 제9권2호
    • /
    • pp.31-36
    • /
    • 1981
  • 점증되고 있는 고신뢰성 제품의 설계에 있어 주어진 선형제약조건 내(內)에서 체계의 신뢰성을 최대화하는 방법을 소개하고 이를 해결하는 비선형계획법을 반복단계로 하여 Computer Programming을 하였다. 단, 본 논문에서 다루는 체계는 병렬중복구조를 갖는 직렬다단계 구조이다. 타당성 검토를 위한 예제를 해결하였으며 Computer Programming은 지면관계로 생략하였다.

  • PDF

Design of GBSB Neural Network Using Solution Space Parameterization and Optimization Approach

  • Cho, Hy-uk;Im, Young-hee;Park, Joo-young;Moon, Jong-sup;Park, Dai-hee
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제1권1호
    • /
    • pp.35-43
    • /
    • 2001
  • In this paper, we propose a design method for GBSB (generalized brain-state-in-a-box) based associative memories. Based on the theoretical investigation about the properties of GBSB, we parameterize the solution space utilizing the limited number of parameters sufficient to represent the solution space and appropriate to be searched. Next we formulate the problem of finding a GBSB that can store the given pattern as stable states in the form of constrained optimization problems. Finally, we transform the constrained optimization problem into a SDP(semidefinite program), which can be solved by recently developed interior point methods. The applicability of the proposed method is illustrated via design examples.

  • PDF