• Title/Summary/Keyword: inline algorithm

Search Result 9, Processing Time 0.112 seconds

CFD prediction of vortex induced vibrations and fatigue assessment for deepwater marine risers

  • Kamble, Chetna;Chen, Hamn-Ching
    • Ocean Systems Engineering
    • /
    • v.6 no.4
    • /
    • pp.325-344
    • /
    • 2016
  • Using 3D computational fluid dynamics techniques in recent years have shed significant light on the Vortex Induced Vibrations (VIV) encountered by deep-water marine risers. The fatigue damage accumulated due to these vibrations has posed a great concern to the offshore industry. This paper aims to present an algorithm to predict the crossflow and inline fatigue damage for very long (L/D > $10^3$) marine risers using a Finite-Analytical Navier-Stokes (FANS) technique coupled with a tensioned beam motion solver and rainflow counting fatigue module. Large Eddy Simulation (LES) method has been used to simulate the turbulence in the flow. An overset grid system is employed to mesh the riser geometry and the wake field around the riser. Risers from NDP (2003) and Miami (2006) experiments are used for simulation with uniform, linearly sheared and non-uniform (non-linearly sheared) current profiles. The simulation results including inline and crossflow motion, modal decomposition, spectral densities and fatigue damage rate are compared to the experimental data and useful conclusions are drawn.

Inline Binding For XNL DataInline Binding For XML Data (XML 데이터의 인라인 바인딩 방법)

  • Lee Eun-Jung;Yoo Ga-Yeon
    • The KIPS Transactions:PartA
    • /
    • v.13A no.1 s.98
    • /
    • pp.71-78
    • /
    • 2006
  • For using XML data in programming languages, there is a data binding method, which generates classes from XML type definitions. However, since existing binding frameworks for this method generate all classes for element definitions, the number of generated classes becomes large and the complexity of the overall application system gets high. In this research, we propose an inline binding method for selecting necessary classes from element definitions. In the proposed method, classes are created only for elements with repetitions and recursions, and they include fields for values of terminal elements. We introduce a generation algorithm for binding classes and the marshaling methods for recovering the omitted paths. We develop IBinder system to validate the proposed method and compare the generated codes with the ones of existing systems. As a result, we carl show that the number of generated classes decrease substantially compared to other systems.

A Technique to Apply Inlining for Code Obfuscation based on Genetic Algorithm (유전 알고리즘에 기반한 코드 난독화를 위한 인라인 적용 기법)

  • Kim, Jung-Il;Lee, Eun-Joo
    • Journal of Information Technology Services
    • /
    • v.10 no.3
    • /
    • pp.167-177
    • /
    • 2011
  • Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

Development of Regenerative Braking Control Algorithm for In-wheel Motor Type Fuel Cell Electric Vehicles Considering Vehicle Stability (차량 안정성을 고려한 인휠모터 방식 연료전지 전기자동차용 회생제동 알고리즘 개발)

  • Yang, D.H.;Park, J.H.;Hwang, S.H.
    • Transactions of The Korea Fluid Power Systems Society
    • /
    • v.7 no.2
    • /
    • pp.7-12
    • /
    • 2010
  • In these days, the researches about hybrid and fuel cell electric vehicles are actively performed due to the environmental contamination and resource exhaust. Specially, the technology of regenerative braking, converting heat energy to electric energy, is one of the most effective technologies to improve fuel economy. This paper developed a regenerative braking control algorithm that is considered vehicle stability. The vehicle has a inline motor at front drive shaft and has a EHB(Electo-hydraulic Brake) system. The control logic and regenerative braking control algorithm are analyzed by MATLAB/Simulink. The vehicle model is carried out by CarSim and the driving simulation is performed by using co-simulation of CarSim and MATLAB/Simulink. From the simulation results, a regenerative braking control algorithm is verified to improve the vehicle stability as well as fuel economy.

  • PDF

Development of the Calibration Algorithm of 3 Axis Vector Sensor Using Ellipsoid (타원체를 이용한 3축 센서의 실시간 보정 알고리듬 개발)

  • Hwang, Jung Moon;Kim, Jung Han
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.32 no.7
    • /
    • pp.643-651
    • /
    • 2015
  • Multi-axis magnetic and accelerometer sensor are widely used in consumer product such as smart phones. The vector output of multi-axis sensors have errors on each axis such as offset error, scale error, non-orthogonality. These errors cause many problems on the performance of the applications. In this paper, we designed the effective inline compensation algorithm for calibrating of 3 axis sensors using ellipsoid for mass production of multi-axis sensors. The outputs with those kinds of errors can be modeled by ellipsoid, and the proposed algorithm makes sequential mappings of the virtual ellipsoid to perfect sphere which is calibrated function of the sensor on three-dimensional space. The proposed calibrating process composed of four main stages and is very straightforward and effective. In addition, another imperfection of the sensor such as the drift from temperature can be easily inserted in each mapping stage. Numerical simulation and experimental results shows great performance of the proposed compensation algorithm.

Effective Technique for Inlining Function Calls in Code Obfuscation Using Genetic Algorithm (유전 알고리즘을 이용한 코드 난독화에서의 효율적 함수 호출 인라인 기법)

  • Kim, Jung-Il;Lee, Eun-Joo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06b
    • /
    • pp.53-58
    • /
    • 2010
  • 코드 난독화 기법 중의 하나인 인라인(Inline)은 코드의 복사를 통하여 함수의 호출 구조를 파괴하여서 코드의 복원과 이해를 어렵게 만든다. 하지만 적절한 전략 없이 인라인 기법을 적용하게 되면, 프로그램 성능이 저하되며 난독화의 결과도 기대 이하일 가능성이 존재한다. 따라서 지나친 성능의 저하를 막으면서 결과적으로 코드의 복원과 이해를 최대한 어렵게 하기 위한 인라인 수행 전략이 필요하다. 이를 위하여 본 논문에서는 정적 함수 호출 그래프를 기반으로 인라인의 적용 여부를 유전 알고리즘을 사용하여 결정하도록 한다. 그리고 인라인 전후의 효용을 보여주기 위하여 정보이론 및 제어 흐름의 복잡도에 기반하여 전체 프로그램의 복잡도를 정의하였다. 마지막으로 해당 기법의 효용을 실험을 통해 보였다.

  • PDF

Defect Detection of Flat Panel Display Using Wavelet Transform (웨이블릿 변환을 이용한 FPD 결함 검출)

  • Kim, Sang-Ji;Lee, Youn-Ju;Yoon, Jeong-Ho;You, Hun;Lee, Byung-Gook;Lee, Joon-Jae
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.10 no.1
    • /
    • pp.47-60
    • /
    • 2006
  • Due to the uneven illumination of FPD panel surface, it is difficult to detect the defects. The paper proposes a method to find the uneven illumination compensation using wavelets, which are done based on multi-resolution structure. The first step is to decompose the image into multi-resolution levels. Second, elimination of lowest smooth sub-image with highest frequency band removes the high frequency noise and low varying illumination. In particular, the main algorithm was implemented by lifting scheme for realtime inline process.

  • PDF

Nanofluid flow and heat transfer from heated square cylinder in the presence of upstream rectangular cylinder under Couette-Poiseuille flow

  • Sharma, Swati;Maiti, Dilip K.;Alam, Md. Mahbub;Sharma, Bhupendra K.
    • Wind and Structures
    • /
    • v.29 no.1
    • /
    • pp.65-75
    • /
    • 2019
  • A heated square cylinder (with height $A^*$) is kept parallel to the cold wall at a fixed gap height $0.5A^*$ from the wall. Another adiabatic rectangular cylinder (of same height $A^*$ and width $0.5A^*$) is placed upstream in an inline tandem arrangement. The spacing between the two cylinders is fixed at $3.0A^*$. The inlet flow is taken as Couette-Poiseuille flow based non-linear velocity profile. The conventional fluid (also known as base fluid) is chosen as water (W) whereas the nanoparticle material is selected as $Al_2O_3$. Numerical simulations are performed by using SIMPLE algorithm based Finite Volume approach with staggered grid arrangement. The dependencies of hydrodynamic and heat transfer characteristics of the cylinder on non-dimensional parameters governing the nanofluids and the fluid flow are explored here. A critical discussion is made on the mechanism of improvement/reduction (due to the presence of the upstream cylinder) of heat transfer and drag coefficient, in comparison to those of an isolated cylinder. It is observed that the heat transfer increases with the increase in the non-linearity in the incident velocity profile at the inlet. For the present range studied, particle concentration has a negligible effect on heat transfer.

The Design and Implementation of High Performance Intrusion Prevention Algorithm based on Signature Hashing (시그너처 해싱 기반 고성능 침입방지 알고리즘 설계 및 구현)

  • Wang, Jeong-Seok;Jung, Yun-Jae;Kwon, H-Uing;Chung, Kyu-Sik;Kwak, Hu-Keun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.3 s.113
    • /
    • pp.209-220
    • /
    • 2007
  • IPS(Intrusion Prevention Systems), which is installed in inline mode in a network, protects network from outside attacks by inspecting the incoming/outgoing packets and sessions, and dropping the packet or closing the sessions if an attack is detected in the packet. In the signature based filtering, the payload of a packet passing through IPS is matched with some attack patterns called signatures and dropped if matched. As the number of signatures increases, the time required for the pattern matching for a packet increases accordingly so that it becomes difficult to develop a high performance US working without packet delay. In this paper, we propose a high performance IPS based on signature hashing to make the pattern matching time independent of the number of signatures. We implemented the proposed scheme in a Linux kernel module in a PC and tested it using worm generator, packet generator and network performance measure instrument called smart bit. Experimental results show that the performance of existing method is degraded as the number of signatures increases whereas the performance of the proposed scheme is not degraded.