• Title/Summary/Keyword: linear algorithm

Search Result 4,034, Processing Time 0.029 seconds

Virtual Network Embedding through Security Risk Awareness and Optimization

  • Gong, Shuiqing;Chen, Jing;Huang, Conghui;Zhu, Qingchao;Zhao, Siyi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2892-2913
    • /
    • 2016
  • Network virtualization promises to play a dominant role in shaping the future Internet by overcoming the Internet ossification problem. However, due to the injecting of additional virtualization layers into the network architecture, several new security risks are introduced by the network virtualization. Although traditional protection mechanisms can help in virtualized environment, they are not guaranteed to be successful and may incur high security overheads. By performing the virtual network (VN) embedding in a security-aware way, the risks exposed to both the virtual and substrate networks can be minimized, and the additional techniques adopted to enhance the security of the networks can be reduced. Unfortunately, existing embedding algorithms largely ignore the widespread security risks, making their applicability in a realistic environment rather doubtful. In this paper, we attempt to address the security risks by integrating the security factors into the VN embedding. We first abstract the security requirements and the protection mechanisms as numerical concept of security demands and security levels, and the corresponding security constraints are introduced into the VN embedding. Based on the abstraction, we develop three security-risky modes to model various levels of risky conditions in the virtualized environment, aiming at enabling a more flexible VN embedding. Then, we present a mixed integer linear programming formulation for the VN embedding problem in different security-risky modes. Moreover, we design three heuristic embedding algorithms to solve this problem, which are all based on the same proposed node-ranking approach to quantify the embedding potential of each substrate node and adopt the k-shortest path algorithm to map virtual links. Simulation results demonstrate the effectiveness and efficiency of our algorithms.

Initial Equilibrium State Analysis of Cable Stayed Bridges Considering Axial Deformation (축방향 변형을 고려한 사장교의 초기평형상태 해석)

  • Kim, Je Choon;Chang, Sung Pil
    • Journal of Korean Society of Steel Construction
    • /
    • v.14 no.4
    • /
    • pp.539-547
    • /
    • 2002
  • The study proposed the initial equilibrium state analysis method that considers axial deformation, in order to accurately determine the initial shape of a cable-stayed bridge. Sepecifically, the proposed method adopted the successive iteration method. In order to evaluate appropriate initial cable force introduced in the initial equilibrium state analysis, parametric studies were performed and a useful linear analysis method proposed. The geometrically nonlinear static behaviors of cable-stayed bridges were considered, using three-dimensional frame element and elastic catenary cable element. The usefulness and applicability of the analytic method proposed in this study were demonstrated using numerical examples, including a real cable-stayed bridge. The algorithm, is applicable in cases wherein axial deformation is not adopted in the fabrication camber, or final cable force is adjusted to eliminate construction and fabrication errors occurring during construction.

A Filtering Technique of Terrestrial LiDAR Data on Sloped Terrain (사면지형에서 지상라이다 자료의 필터링 기법)

  • Shin, Yoon Su;Choi, Seung Pil;Kim, Jun Seong;Kim, Uk Nam
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.6_1
    • /
    • pp.529-538
    • /
    • 2012
  • By using an algorithm derived by a multiple linear regression analysis, a technique for filtering was developed; and by using the developed technique, the results of conducting filtering of the raw data collected via scanning with a terrestrial LiDAR the actual sloped terrain was analyzed. As such, when filtering was applied by dividing the observation areas into two areas with the topographical line as a reference in order to improve the filtering accuracy, it was seen that the filtering accuracy improved by about 8.73% as compared to when filtering was applied without dividing the observation area. In addition, considering the fact that the accuracy improved by 5~7% when the sloped sides of a multicurvature topography were divided and a complex filtering applied as compared to when filtering was applied for the entire area or by regions, it can be asserted that the accuracy was higher when a complex filtering was conducted by dividing the sloped areas where the slope is not constant due to the multi-curvature of topography.

Experimental and Theoretical Consideration for Flow Rate, Pressure Drop, and Permeate Flow in a Hollow Fiber Membrane (중공사 막을 따라 흐르는 순수한 물의 유량, 압력손실, 투과수에 대한 실험과 이론적 고찰)

  • Lee, Jung-Muk;Lee, Bomsock
    • Membrane Journal
    • /
    • v.22 no.6
    • /
    • pp.470-480
    • /
    • 2012
  • In this study, for a linear tubular membrane with constant diameter the mass balance considering permeate velocity of the each unit length was established. On this basis, mathematical modelling of flows in a pipe was solved using nonlinear second order differential equations as well as steady-state equation. Since this equation is nonlinear, Gauss-Seidel method or another iteration method were used to solve the differential equations. Simulation algorithm for numerical solutions was presented. Also since the permeate flow is varied as operating condition, the solution of equations at each conditions using numerical integrations such as Simpson's rules was used. In order to analyze and compare simulation results, we have performed experiments using a hollow fiber membrane with almost identical tubular membrane. Comparison of theoretical and experimental results, pressure drop, flow rate, and permeate flow in a hollow fiber membrane, were illustrated.

Spectral Analysis of Heart Rate Variability in ECG and Pulse-wave using autoregressive model (AR모델을 이용한 심전도와 맥파의 심박변동 스펙트럼 해석)

  • Kim NagHwan;Lee EunSil;Min HongKi;Lee EungHyuk;Hong SeungHong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.1
    • /
    • pp.15-22
    • /
    • 2000
  • The analysis of power spectrum based on linear AR model is applied widely to quantize the response of autonomic nerve noninvasively, In this paper, we estimate the power spectrum density for heartrate variability of the electrocadiogram and pulse wave for short term data(less than two minute), The time series of heart rate variability is obtained from the time interval(RRI, PPI) between the feature point of the electrocadiogram and pulse wave for normal person, The generated time series reconstructed into new time series through polynomial interpolation to apply to the AR mode. The power spectrum density for AR model is calculated by Burg algorithm, After applying AR model, the power spectrum density for heart rate variability of the electrocadiogram and the pulse wave is shown smooth spectrum power at the region of low frequence and high frequence, and that the power spectrum density of electrocadiogram and pulse wave has similar form for same subject.

  • PDF

A new design method of m-bit parallel BCH encoder (m-비트 병렬 BCH 인코더의 새로운 설계 방법)

  • Lee, June;Woo, Choong-Chae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.11 no.3
    • /
    • pp.244-249
    • /
    • 2010
  • The design of error correction code with low complexity has a good attraction for next generation multi-level cell flash memory. Sharing sub-expressions is effective method to reduce complexity and chip size. This paper proposes a new design method of m-bit parallel BCH encoder based on serial linear feedback shift register structure with low complexity using sub-expression. In addition, general algorithm for obtaining the sub-expression is introduced. The sub-expression can be expressed by matrix operation between sub-matrix of generator matrix and sum of two different variables. The number of the sub-expression is restricted by. The obtained sub-expressions can be shared for implementation of different m-parallel BCH encoder. This paper is not focused on solving a problem (delay) induced by numerous fan-out, but complexity reduction, expecially the number of gates.

A Study on the Sliding Mode Control of PMLSM using the Slate Observer (상태관측기에 의한 영구자석 선형동기전동기의 슬라이딩모드제어에 관한 연구)

  • 황영민;신동률;최거승;조윤현;우정인
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.16 no.2
    • /
    • pp.71-80
    • /
    • 2002
  • According to the rapid growth of high speed and precise industry, the application of synchronous motor has been increased. In the application fields, these fast dynamic response is of prime importance. In particular, since the PMLSM(Permanent Magnet Linear Synchronous Motor) has characteristics of high speed, high thrust, it has been used in high-performance servo drive. From these reasons, it is recently used for high precise position control, and machine tool. In this paper, a study of the sliding mode with VSS (Variable Structure System) design for a PMLSM is presented. For fast and precise motion control of PMLSM, the compensation of disturbance and parameter variation is necessary. Hence we eliminate the reaching phase use of VSS that is changed to switching function and vector control using the state observer. And we proposed to sliding mode control algorithm so that realize fast response without overshoot, disturbance and parameter variation.

Computer Vision Based Measurement, Error Analysis and Calibration (컴퓨터 시각(視覺)에 의거한 측정기술(測定技術) 및 측정오차(測定誤差)의 분석(分析)과 보정(補正))

  • Hwang, H.;Lee, C.H.
    • Journal of Biosystems Engineering
    • /
    • v.17 no.1
    • /
    • pp.65-78
    • /
    • 1992
  • When using a computer vision system for a measurement, the geometrically distorted input image usually restricts the site and size of the measuring window. A geometrically distorted image caused by the image sensing and processing hardware degrades the accuracy of the visual measurement and prohibits the arbitrary selection of the measuring scope. Therefore, an image calibration is inevitable to improve the measuring accuracy. A calibration process is usually done via four steps such as measurement, modeling, parameter estimation, and compensation. In this paper, the efficient error calibration technique of a geometrically distorted input image was developed using a neural network. After calibrating a unit pixel, the distorted image was compensated by training CMLAN(Cerebellar Model Linear Associator Network) without modeling the behavior of any system element. The input/output training pairs for the network was obtained by processing the image of the devised sampled pattern. The generalization property of the network successfully compensates the distortion errors of the untrained arbitrary pixel points on the image space. The error convergence of the trained network with respect to the network control parameters were also presented. The compensated image through the network was then post processed using a simple DDA(Digital Differential Analyzer) to avoid the pixel disconnectivity. The compensation effect was verified using known sized geometric primitives. A way to extract directly a real scaled geometric quantity of the object from the 8-directional chain coding was also devised and coded. Since the developed calibration algorithm does not require any knowledge of modeling system elements and estimating parameters, it can be applied simply to any image processing system. Furthermore, it efficiently enhances the measurement accuracy and allows the arbitrary sizing and locating of the measuring window. The applied and developed algorithms were coded as a menu driven way using MS-C language Ver. 6.0, PC VISION PLUS library functions, and VGA graphic functions.

  • PDF

Recognition of Fruit in Apple Tree using Color and Morphological Filters (색 변환 및 형태학적 필터를 이용한 사과인식에 관한 연구)

  • Hong, Jae-Seong;Park, Jeong-Gwan;Choi, In-Myung;Lee, Soo-Hee;Kim, Jung-Bae;Yun, Cheon-Jong
    • Horticultural Science & Technology
    • /
    • v.17 no.2
    • /
    • pp.127-130
    • /
    • 1999
  • This study was attempted to develop the algorithm for recognizing fruits acquired from apple tree images with digital camera in sunlight. As the result of L*a*b* color transformation for reducing the effect of sunlight, a* and b* color index were effective to extract apple pixels in tree images and linear discrimination functions with color index a* b* were developed. To recognize fruits from apple pixels, those were classified into 4 patterns according to clustering condition and morphologically filtered. Test results showed that apple fruits unoccluded were exactly recognized, whereas apple fruits occluded with leaves and trunk were miscounted 2 apples on average.

  • PDF

Iris Image Enhancement for the Recognition of Non-ideal Iris Images

  • Sajjad, Mazhar;Ahn, Chang-Won;Jung, Jin-Woo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1904-1926
    • /
    • 2016
  • Iris recognition for biometric personnel identification has gained much interest owing to the increasing concern with security today. The image quality plays a major role in the performance of iris recognition systems. When capturing an iris image under uncontrolled conditions and dealing with non-cooperative people, the chance of getting non-ideal images is very high owing to poor focus, off-angle, noise, motion blur, occlusion of eyelashes and eyelids, and wearing glasses. In order to improve the accuracy of iris recognition while dealing with non-ideal iris images, we propose a novel algorithm that improves the quality of degraded iris images. First, the iris image is localized properly to obtain accurate iris boundary detection, and then the iris image is normalized to obtain a fixed size. Second, the valid region (iris region) is extracted from the segmented iris image to obtain only the iris region. Third, to get a well-distributed texture image, bilinear interpolation is used on the segmented valid iris gray image. Using contrast-limited adaptive histogram equalization (CLAHE) enhances the low contrast of the resulting interpolated image. The results of CLAHE are further improved by stretching the maximum and minimum values to 0-255 by using histogram-stretching technique. The gray texture information is extracted by 1D Gabor filters while the Hamming distance technique is chosen as a metric for recognition. The NICE-II training dataset taken from UBRIS.v2 was used for the experiment. Results of the proposed method outperformed other methods in terms of equal error rate (EER).