• Computers and Concrete
• /
• 제2권5호
• /
• pp.345-366
• /
• 2005

This work presents an assessment of the computational performance of a vector-parallel implementation of probabilistic model for concrete cracking in 3D. This paper shows the continuing efforts towards code optimization as reported in earlier works Paz, et al. (2002a,b and 2003). The probabilistic crack approach is based on the direct Monte Carlo method. Cracking is accounted by means of 3D interface elements. This approach considers that all nonlinearities are restricted to interface elements modeling cracks. The heterogeneity governs the overall cracking behavior and related size effects on concrete fracture. Computational kernels in the implementation are the inexact Newton iterative driver to solve the non-linear problem and a preconditioned conjugate gradient (PCG) driver to solve linearized equations, using an element by element (EBE) strategy to compute matrix-vector products. In particular the paper analyzes code behavior using OpenMP directives in parallel vector processors (PVP), such as the CRAY SV1 and CRAY T94. The impact of the memory architecture on code performance, and also some strategies devised to circumvent this issue are addressed by numerical experiment.

• Korean Chemical Engineering Research
• /
• 제56권2호
• /
• pp.176-185
• /
• 2018

지구 온난화가 가속화됨에 따라 온실가스 감축이 보다 중요해졌다. 이산화탄소 건식 개질은 온실가스인 $CO_2$와 $CH_4$를 활용하여 부가가치가 높은 물질인 CO와 $H_2$를 얻을 수 있는 유망한 온실가스 감축 기술이다. 그러나 이 반응이 일어나는 반응기의 운전 중에 심각한 코킹 문제가 발생할 수 있다. 이산화탄소 개질반응은 매우 강한 흡열반응이기 때문에 반응기 입구 근처에서 반응 온도가 많이 떨어지면서 코크 생성을 야기시킨다. 이러한 문제를 해결하기 위해서는 코크 생성이 잘 일어나지 않는 온도영역에서 반응이 일어나도록 하는 것이 중요하다. 본 연구에서는 새로운 촉매 배열 방법을 이용하여 반응기 전 구간이 코크 생성이 잘 일어나지 않는 온도 영역 내에서 유지되도록 하는 설계 방법을 제안하였다. 이 설계 방법은 연료 유량, 촉매 밀도, 구간 별 출구 온도를 최적화 변수로 하여 주어진 전환율에 대하여 반응기 길이를 최소화 할 수 있는 최적화 문제를 풀도록 하여 반응기를 최적화한다.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.230-245
• /
• 2002

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

• Smart Structures and Systems
• /
• 제16권2호
• /
• pp.243-262
• /
• 2015

Optimal sensor placement (OSP) is a critical issue in construction and implementation of a sophisticated structural health monitoring (SHM) system. The uncertainties in the identified structural parameters based on the measured data may dramatically reduce the reliability of the condition evaluation results. In this paper, the information entropy, which provides an uncertainty metric for the identified structural parameters, is adopted as the performance measure for a sensor configuration, and the OSP problem is formulated as the multi-objective optimization problem of extracting the Pareto optimal sensor configurations that simultaneously minimize the appropriately defined information entropy indices. The nondirective movement glowworm swarm optimization (NMGSO) algorithm (based on the basic glowworm swarm optimization (GSO) algorithm) is proposed for identifying the effective Pareto optimal sensor configurations. The one-dimensional binary coding system is introduced to code the glowworms instead of the real vector coding method. The Hamming distance is employed to describe the divergence of different glowworms. The luciferin level of the glowworm is defined as a function of the rank value (RV) and the crowding distance (CD), which are deduced by non-dominated sorting. In addition, nondirective movement is developed to relocate the glowworms. A numerical simulation of a long-span suspension bridge is performed to demonstrate the effectiveness of the NMGSO algorithm. The results indicate that the NMGSO algorithm is capable of capturing the Pareto optimal sensor configurations with high accuracy and efficiency.

• Journal of Electrical Engineering and Technology
• /
• 제2권4호
• /
• pp.478-484
• /
• 2007

This paper deals with the high efficient vector control for the reduction of copper losses of the doubly fed motor. Firstly, the feedback linearization control based on Lyapunov approach is employed to design the underlying controller achieving the double fluxes orientation. The fluxes# controllers are designed independently of the speed. The speed controller is designed using the Lyapunov method especially employed to the unknown load torques. The global asymptotic stability of the overall system is theoretically proven. Secondly, a new Torque Copper Losses Factor is proposed to deal with the problem of the machine copper losses. Its main function is to optimize the torque in keeping the machine saturation at an acceptable level. This leads to a reduction in machine currents and therefore their accompanied copper losses guaranteeing improved machine efficiency. The simulation and experimental results in comparative presentation confirm largely the effectiveness of the proposed DFIM control with a very interesting energy saving contribution.

• International Journal of Aeronautical and Space Sciences
• /
• 제14권3호
• /
• pp.282-295
• /
• 2013

In order to communicate with a ground station, the tracking profile design problem for a directional antenna system is considered. Because the motions of the gimbal angles in the antenna system affect the image quality, the main object is to minimize the motion of the gimbal angles during the satellite's imaging phase. For this goal, parameter optimization problems in the imaging and maneuver phases are formulated separately in the body-frame, and solved sequentially. Also, several mechanical constraints, such as the limitation of the gimbal angle and rate, are considered in the problems. The tracking profiles of the gimbal angles in the maneuver phases are designed with N-th order polynomials, to continuously connect the tracking profiles between two imaging phases. The results confirm that if the vector trace of the desired antenna-pointing vector is within the antenna's beam-width angle, motions of the gimbal angles are not required in the corresponding imaging phase. Also, through numerical examples, it is shown that motion of the gimbal angles in the imaging phase can be minimized by the proposed design process.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(1)
• /
• pp.353-356
• /
• 2000

Multi-bias parameter extraction technique for HEMT small signa] equivalent circuits is presented in this paper. The technique in this paper uses S-parameters measured at various bias points in the active region to construct one optimization problem, of which the vector of unknowns contains only a set of bias-independent elements. Tests are peformed on measured S-parameters of a pHEMT at 30 bias points. Results indicate that the calculated S-parameters is similar to the measured data.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제7권1호
• /
• pp.1-6
• /
• 2007

The SVDD (support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. Recently, with the objective of generalizing the SVDD which treats all training data with equal importance, the so-called D-SVDD (density-induced support vector data description) was proposed incorporating the idea that the data in a higher density region are more significant than those in a lower density region. In this paper, we consider the problem of further improving the D-SVDD toward the use of a partial reference set for testing, and propose an LMI (linear matrix inequality)-based optimization approach to solve the improved version of the D-SVDD problems. Our approach utilizes a new class of density-induced distance measures based on the RSDE (reduced set density estimator) along with the LMI-based mathematical formulation in the form of the SDP (semi-definite programming) problems, which can be efficiently solved by interior point methods. The validity of the proposed approach is illustrated via numerical experiments using real data sets.

• International Journal of Computer Science & Network Security
• /
• 제23권11호
• /
• pp.21-31
• /
• 2023

In this paper, we focused on the problem of evaluating multi-class classification accuracy and simulation of multiple classifier performance metrics. Multi-class classifiers for sentiment analysis involved many challenges, whereas previous research narrowed to the binary classification model since it provides higher accuracy when dealing with text data. Thus, we take inspiration from the non-linear Support Vector Machine to modify the algorithm by embedding dynamic hyperplanes representing multiple class labels. Then we analyzed the performance of multi-class classifiers using macro-accuracy, micro-accuracy and several other metrics to justify the significance of our algorithm enhancement. Furthermore, we hybridized Enhanced Convolution Neural Network (ECNN) with Dynamic Support Vector Machine (DSVM) to demonstrate the effectiveness and efficiency of the classifier towards multi-class text data. We performed experiments on three hybrid classifiers, which are ECNN with Binary SVM (ECNN-BSVM), and ECNN with linear Multi-Class SVM (ECNN-MCSVM) and our proposed algorithm (ECNNDSVM). Comparative experiments of hybrid algorithms yielded 85.12 % for single metric accuracy; 86.95 % for multiple metrics on average. As for our modified algorithm of the ECNN-DSVM classifier, we reached 98.29 % micro-accuracy results with an f-score value of 98 % at most. For the future direction of this research, we are aiming for hyperplane optimization analysis.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권4호
• /
• pp.180-187
• /
• 2001

This paper proposes an efficient evolutionary programming algorithm for solving a generation expansion planning(GEP) problem known as a highly-nonlinear dynamic problem. Evolutionary programming(EP) is an optimization algorithm based on the simulated evolution (mutation, competition and selection). In this paper, new algorithm is presented to enhance the efficiency of the EP algorithm for solving the GEP problem. By a domain mapping procedure, yearly cumulative capacity vectors are transformed into one dummy vector, whose change can yield a kind of trend in the cost value. To validate the proposed approach, this algorithm is tested on two cases of expansion planning problems. Simulation results show that the proposed algorithm can provide successful results within a resonable computational time compared with conventional EP and dynamic programming.