• Title/Summary/Keyword: linear approximation

Search Result 750, Processing Time 0.024 seconds

Design and Implementation of Concentration Calculation Algorithm for the Infrared Combustible Gas Detector (적외선 가연성 가스검지기의 농도 산출 알고리즘의 설계 및 구현)

  • Han, Seungho;Lyu, Geunjun;Lee, Yeonjae;Kim, Hiesik;Park, Gyoutae
    • Journal of Energy Engineering
    • /
    • v.25 no.1
    • /
    • pp.145-152
    • /
    • 2016
  • Recently, we can find news about toxic and combustible gas accident. So, we have to develop gas detector that can measure gas at dangerous area for preventing gas accidents. In this paper, we calculate a approximation function from sensor's output using the linear regressiong. And we develop software algorithm using Neville's algorithm for measuring gas concentration. Finally, we compare our algorithm with combustible gas detectors that are already developed, by using standard gas samples manufactured Korea Gas Safety. As a result of this experiment, we confirm that performance of our algorithm is more improved than performance of already developed combustible gas detectors. In the future, we'll research how to improve reliability from using count, temperature and humidity. And we'll design hardware applied explosion proof for safety.

Multicriteria shape design of a sheet contour in stamping

  • Oujebbour, Fatima-Zahra;Habbal, Abderrahmane;Ellaia, Rachid;Zhao, Ziheng
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.3
    • /
    • pp.187-193
    • /
    • 2014
  • One of the hottest challenges in automotive industry is related to weight reduction in sheet metal forming processes, in order to produce a high quality metal part with minimal material cost. Stamping is the most widely used sheet metal forming process; but its implementation comes with several fabrication flaws such as springback and failure. A global and simple approach to circumvent these unwanted process drawbacks consists in optimizing the initial blank shape with innovative methods. The aim of this paper is to introduce an efficient methodology to deal with complex, computationally expensive multicriteria optimization problems. Our approach is based on the combination of methods to capture the Pareto Front, approximate criteria (to save computational costs) and global optimizers. To illustrate the efficiency, we consider the stamping of an industrial workpiece as test-case. Our approach is applied to the springback and failure criteria. To optimize these two criteria, a global optimization algorithm was chosen. It is the Simulated Annealing algorithm hybridized with the Simultaneous Perturbation Stochastic Approximation in order to gain in time and in precision. The multicriteria problems amounts to the capture of the Pareto Front associated to the two criteria. Normal Boundary Intersection and Normalized Normal Constraint Method are considered for generating a set of Pareto-optimal solutions with the characteristic of uniform distribution of front points. The computational results are compared to those obtained with the well-known Non-dominated Sorting Genetic Algorithm II. The results show that our proposed approach is efficient to deal with the multicriteria shape optimization of highly non-linear mechanical systems.

High quality volume visualization using B-spline interpolation (B 스플라인 보간을 이용한 고화질 볼륨 가시화)

  • Shin, Yongha;Kye, Heewon
    • Journal of the Korea Computer Graphics Society
    • /
    • v.22 no.3
    • /
    • pp.1-9
    • /
    • 2016
  • Linear interpolation is a basic sampling method for volume visualization. This method generates good images but sometimes it is inferior to our high expectation because it is encouraged to produce high quality images in the medical applications. In this paper, B spline based tri-cubic interpolation is used for the re-sampling step. The conventional B spline is an approximation method which does not cross control points so that we moved the control points and the curve crosses the original control points. In the rendering step, the empty space leaping is applicable to increase rendering speed. We have to calculate the maximum and minimum values for each block to detect empty space. The convex hull property of B spline enables the values of control points to be used as the maximum and minimum values. As a result, tri-cubic interpolated volume rendering is possible in interactive speed.

Stem and Stand Taper Model Using Spline Function and Linear Equation (Spline 함수(函數)와 선형방정식(線型方程式)을 이용한 수간(樹幹) 및 임분간곡선(林分幹曲線)모델)

  • Lee, Woo Kyun
    • Journal of Korean Society of Forest Science
    • /
    • v.83 no.1
    • /
    • pp.63-74
    • /
    • 1994
  • One of the essential factors to estimate the stem and stand growth is to correctly portray a stem form (profile). It is also required to numerically approximate a stem form in order to dynamically grasp and represent a stand growth. A whole stem form seems to be a conical form but a stem outline at various positions tapers off differently. Accordingly it is difficult to model a whole stand form with single taper equation. A stem taper equation with different coefficients on each subinterval can be useful tools to accurately portray a stem form. This article presents the derivation method of individual stem taper curve using spline function. It is also in this paper aimed to study how a stand taper curve car, be derived from the population of single stem taper curve in a stand. These taper equations numerically formulated enable to dynamically represent and prognosticate the development process of a stand and prepare the foundation of variety on growth model study and rational forest planning model.

  • PDF

Discrete-time approximation and modeling of a broadband underwater propagation channel based on eigenray analysis (고유 음선 분석에 기반한 광대역 수중음향 전달 채널의 이산시간 근사 및 모의 방법 연구)

  • Shin, Donghoon;Cho, Hyeon-Deok;Kwon, Taekik;Ahn, Jae-Kyun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.3
    • /
    • pp.216-225
    • /
    • 2020
  • In this paper, broadband underwater propagation channel modeling based on eigenray analysis is discussed. Underwater channels are often formulated in frequency domain time-harmonic signals, which are impractical for simulating broadband signals in time domain. In this regard, time domain modeling of the underwater propagation channel is required for the simulation of broadband signals, for which the eigenray analysis based on ray tracing, resulting in multipath propagation delays in time-domain, is used in this paper. For discrete time system application, the phase, frequency-dependent loss and non-integer sample delays for each eigenray, are approximated by the finite impulse response of the broadband propagation channel.

A Physical-layer Security Scheme Based on Cross-layer Cooperation in Dense Heterogeneous Networks

  • Zhang, Bo;Huang, Kai-zhi;Chen, Ya-jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2595-2618
    • /
    • 2018
  • In this paper, we investigate secure communication with the presence of multiple eavesdroppers (Eves) in a two-tier downlink dense heterogeneous network, wherein there is a macrocell base station (MBS) and multiple femtocell base stations (FBSs). Each base station (BS) has multiple users. And Eves attempt to wiretap a macrocell user (MU). To keep Eves ignorant of the confidential message, we propose a physical-layer security scheme based on cross-layer cooperation to exploit interference in the considered network. Under the constraints on the quality of service (QoS) of other legitimate users and transmit power, the secrecy rate of system can be maximized through jointly optimizing the beamforming vectors of MBS and cooperative FBSs. We explore the problem of maximizing secrecy rate in both non-colluding and colluding Eves scenarios, respectively. Firstly, in non-colluding Eves scenario, we approximate the original non-convex problem into a few semi-definite programs (SDPs) by employing the semi-definite relaxation (SDR) technique and conservative convex approximation under perfect channel state information (CSI) case. Furthermore, we extend the frame to imperfect CSI case and use the Lagrangian dual theory to cope with uncertain constraints on CSI. Secondly, in colluding Eves scenario, we transform the original problem into a two-tier optimization problem equivalently. Among them, the outer layer problem is a single variable optimization problem and can be solved by one-dimensional linear search. While the inner-layer optimization problem is transformed into a convex SDP problem with SDR technique and Charnes-Cooper transformation. In the perfect CSI case of both non-colluding and colluding Eves scenarios, we prove that the relaxation of SDR is tight and analyze the complexity of proposed algorithms. Finally, simulation results validate the effectiveness and robustness of proposed scheme.

Extraction of Effective Carrier Velocity and Observation of Velocity Overshoot in Sub-40 nm MOSFETs

  • Kim, Jun-Soo;Lee, Jae-Hong;Yun, Yeo-Nam;Park, Byung-Gook;Lee, Jong-Duk;Shin, Hyung-Cheol
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.8 no.2
    • /
    • pp.115-120
    • /
    • 2008
  • Carrier velocity in the MOSFET channel is the main driving force for improved transistor performance with scaling. We report measurements of the drift velocity of electrons and holes in silicon inversion layers. A technique for extracting effective carrier velocity which is a more accurate extraction method based on the actual inversion charge measurement is used. This method gives more accurate result over the whole range of $V_{ds}$, because it does not assume a linear approximation to obtain the inversion charge and it does not limit the range of applicable $V_{ds}$. For a very short channel length device, the electron velocity overshoot is observed at room temperature in 37 nm MOSFETs while no hole velocity overshoot is observed down to 36 nm. The electron velocity of short channel device was found to be strongly dependent on the longitudinal field.

Genetically Optimized Self-Organizing Polynomial Neural Networks (진화론적 최적 자기구성 다항식 뉴럴 네트워크)

  • 박호성;박병준;장성환;오성권
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.1
    • /
    • pp.40-49
    • /
    • 2004
  • In this paper, we propose a new architecture of Genetic Algorithms(GAs)-based Self-Organizing Polynomial Neural Networks(SOPNN), discuss a comprehensive design methodology and carry out a series of numeric experiments. The conventional SOPNN is based on the extended Group Method of Data Handling(GMDH) method and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons (or nodes) located in each layer through a growth process of the network. Moreover it does not guarantee that the SOPNN generated through learning has the optimal network architecture. But the proposed GA-based SOPNN enable the architecture to be a structurally more optimized network, and to be much more flexible and preferable neural network than the conventional SOPNN. In order to generate the structurally optimized SOPNN, GA-based design procedure at each stage (layer) of SOPNN leads to the selection of preferred nodes (or PNs) with optimal parameters- such as the number of input variables, input variables, and the order of the polynomial-available within SOPNN. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization (predictive) abilities of the model. A detailed design procedure is discussed in detail. To evaluate the performance of the GA-based SOPNN, the model is experimented with using two time series data (gas furnace and NOx emission process data of gas turbine power plant). A comparative analysis shows that the proposed GA-based SOPNN is model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

Mega Irises: Per-Pixel Projection Illumination Compensation for the moving participant in projector-based visual system (Mega Irises: 프로젝터 기반의 영상 시스템상에서 이동하는 체험자를 위한 화소 단위의 스크린 투사 밝기 보정)

  • Jin, Jong-Wook;Wohn, Kwang-Yun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.4
    • /
    • pp.31-40
    • /
    • 2011
  • Projector-based visual systems are widely used for VR and experience display applications. But the illumination irregularity on the screen surface due to the screen material and its light reflection properties sometimes deteriorates the user experience. This phenomenon is particularly troublesome when the participants of the head tracking VR system such as CAVE or the motion generation experience system continually move around the system. One of reason to illumination irregularity is projector-screen specular reflection component to participant's eye's position and it's analysis needs high computation complexity. Similar to calculate specular lighting term using GPU's programmable shader, Our research adjusts every pixel's brightness in runtime with given 3D screen space model to reduce illumination irregularity. For doing that, Angle-based brightness compensate function are considered for specific screen installation and modified it for GPU-friendly compute and access. Two aspects are implemented, One is function access transformation from angular form to product and the other is piecewise linear interpolate approximation.

Network Design with Non-Linear Optimization Method (비선형(非線型) 최적화기법(最適化技法)에 의한 가로망설계(街路網設計))

  • Jang, Hyun Bong;Park, Chang Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.8 no.1
    • /
    • pp.165-172
    • /
    • 1988
  • An optimal network design method using continuous form of design variables is considered. Modified Hooke-and-Jeeves algorithm has been implemented in order to solve nonlinear progamming problem which is approximately equivalent to the real network design problem (NDP) with system. efficiency criteria(i. e. travel time and costs) and construction cost as objective function. Various forms of construction cost function, locations of initial solution, and dimension of initial step size of link improvement are taken into account to show the validity of this approach. The results obtained are quite promising in terms of the numbers of evaluations in solving NDP, and the speed of convergence. Finally, some techniques in choosing efficient intial solution, initial step size and approximation are given.

  • PDF