• Title/Summary/Keyword: Paths Model

Search Result 870, Processing Time 0.032 seconds

Effect of Flow Direction on Temperature Uniformity in Solid Oxide Fuel Cell (고체산화물 연료전지의 유동방향에 따른 온도 균일성 영향)

  • Jeon, Dong Hyup;Shin, Dong-Ryul;Ryu, Kwang-Hyun;Song, Rak-Hyun
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.41 no.10
    • /
    • pp.667-673
    • /
    • 2017
  • We investigated the temperature uniformity in an anode-supported solid oxide fuel cell, using the open source computational fluid dynamics (CFD) toolbox, OpenFOAM. Numerical simulation was performed in three different flow paths, i.e., co-flow, counter-flow, and cross-flow paths. Gas flow in a porous electrode was calculated using effective diffusivity while considering the effect of interconnect rib. A lumped internal resistance model derived from a semi-empirical correlation was implemented for the calculation of electrochemical reaction. The result showed that the counter-flow path displayed the most uniform temperature distribution.

A Comparative Study of Parking Path Following Methods for Autonomous Parking System (자율 주차 시스템을 위한 주차 경로 추종 방법의 비교 연구)

  • Kim, Minsung;Im, Gyubeom;Park, Jaeheung
    • The Journal of Korea Robotics Society
    • /
    • v.15 no.2
    • /
    • pp.147-159
    • /
    • 2020
  • Over the last years, a number of different path following methods for the autonomous parking system have been proposed for tracking planned paths. However, it is difficult to find a study comparing path following methods for a short path length with large curvature such as a parking path. In this paper, we conduct a comparative study of the path following methods for perpendicular parking. By using Monte-Carlo simulation, we determine the optimal parameters of each controller and analyze the performance of the path following. In addition, we consider the path following error occurred at the switching point where forward and reverse paths are switched. To address this error, we conduct the comparative study of the path following methods with the one thousand switching points generated by the Monte-Carlo method. The performance of each controller is analyzed using the V-rep simulator. With the simulation results, this paper provides a deep discussion about the effectiveness and limitations of each algorithm.

Vulnerable Path Attack and its Detection

  • She, Chuyu;Wen, Wushao;Ye, Quanqi;Zheng, Kesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2149-2170
    • /
    • 2017
  • Application-layer Distributed Denial-of-Service (DDoS) attack is one of the leading security problems in the Internet. In recent years, the attack strategies of application-layer DDoS have rapidly developed. This paper introduces a new attack strategy named Path Vulnerabilities-Based (PVB) attack. In this attack strategy, an attacker first analyzes the contents of web pages and subsequently measures the actual response time of each webpage to build a web-resource-weighted-directed graph. The attacker uses a Top M Longest Path algorithm to find M DDoS vulnerable paths that consume considerable resources when sequentially accessing the pages following any of those paths. A detection mechanism for such attack is also proposed and discussed. A finite-state machine is used to model the dynamical processes for the state of the user's session and monitor the PVB attacks. Numerical results based on real-traffic simulations reveal the efficiency of the attack strategy and the detection mechanism.

Clock period optimaization by gate sizing and path sensitization (게미트 사이징과 감작 경로를 이용한 클럭 주기 최적화 기법)

  • 김주호
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.1
    • /
    • pp.1-9
    • /
    • 1998
  • In the circuit model that outputs are latched and input vectors are successively applied at inputs, the gate resizing approach to reduce the delay of the critical pathe may not improve the performance. Since the clock period is etermined by delays of both long and short paths in combinational circuits, the performance (clock period) can be optimized by decreasing the delay of the longest path, or increasing the delay of the shortest path. In order to achieve the desired clock period of a circuit, gates lying in sensitizable long and short paths can be selected for resizing. However, the gate selection in path sensitization approach is a difficult problem due to the fact that resizing a gate in shortest path may change the longest sensitizable path and viceversa. For feasible settings of the clock period, new algorithms and corresponding gate selection methods for resizing are proposed in this paper. Our new gate selection methods prevent the delay of the longest path from increasing while resizing a gate in the shortest path and prevent the delay of the shortest path from decreasing while resizing a gate in the longest sensitizable path. As a result, each resizing step is guaranteed not to increase the clock period. Our algorithmsare teted on ISCAS85 benchmark circuits and experimental results show that the clock period can beoptimized efficiently with out gate selection methods.

  • PDF

Solving the Team Orienteering Problem with Particle Swarm Optimization

  • Ai, The Jin;Pribadi, Jeffry Setyawan;Ariyono, Vincensius
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.3
    • /
    • pp.198-206
    • /
    • 2013
  • The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by $T_{max}$ that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score $S_i$. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time $t_{ij}$ needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.

Structural intensity analysis of a large container carrier under harmonic excitations of propulsion system

  • Cho, Dae-Seung;Kim, Kyung-Soo;Kim, Byung-Hwa
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.2 no.2
    • /
    • pp.87-95
    • /
    • 2010
  • The structural intensity analysis, which calculates the magnitude and direction of vibrational energy flow from vibratory velocity and internal force at any point of a structure, can give information on dominant transmission paths, positions of sources and sinks of vibration energy. This paper presents a numerical simulation system for structural intensity analysis and visualization to apply for ship structures based on the finite element method. The system consists of a general purpose finite element analysis program MSC/Nastran, its pre- and post-processors and an in-house program module to calculate structural intensity using the model data and its forced vibration analysis results. Using the system, the structural intensity analysis for a 4,100 TEU container carrier is carried out to visualize structural intensity fields on the global ship structure and to investigate dominant energy flow paths from harmonic excitation sources to superstructure at resonant hull girder and superstructure modes.

Effects of load height application and pre-buckling deflections on lateral buckling of thin-walled beams

  • Mohri, F.;Potier-Ferry, M.
    • Steel and Composite Structures
    • /
    • v.6 no.5
    • /
    • pp.401-415
    • /
    • 2006
  • Based on a non-linear model taking into account flexural-torsional couplings, analytical solutions are derived for lateral buckling of simply supported I beams under some representative load cases. A closed form is established for lateral buckling moments. It accounts for bending distribution, load height application and pre-buckling deflections. Coefficients $C_1$ and $C_2$ affected to these parameters are then derived. Regard to well known linear stability solutions, these coefficients are not constant but depend on another coefficient $k_1$ that represents the pre-buckling deflection effects. In numerical simulations, shell elements are used in mesh process. The buckling loads are achieved from solutions of eigenvalue problem and by bifurcations observed on non linear equilibrium paths. It is proved that both the buckling loads derived from linear stability and eigenvalue problem lead to poor results, especially for I sections with large flanges for which the behaviour is predominated by pre-buckling deflection and the coefficient $k_1$ is large. The proposed solutions are in good agreement with numerical bifurcations observed on non linear equilibrium paths.

Transport Paths of Nearshore Surface Sediment on Coast of East Sea, Korea (동해 연안 표층퇴적물의 이동경로)

  • 유규철;오재경
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.11 no.1
    • /
    • pp.50-55
    • /
    • 1999
  • Gao and Collins method (two-dimensional sediment transport trend-vector model) using grain-size parameters (mean grain size, sorting coefficient, and skewness) calculated by the statistical moment method is introduced to understand semi-quantitatively the sandy and surficial sediment transport trends on a coast of the East Sea. The result is the sediment transport vectors which indicate transport paths of surficial sediment by wave-induced currents. The corresponding morphological feature is a spit developed at the mouth of the Nam¬dae stream, which is a resultant sediment transported by longshore current and is blocking the circulation of ocean. After this, it is thought that seasonal research and hydrodynamic measurements are needed for verification of the results.

  • PDF

Development of an RF Signal Level Prediction Simulator for Radiowave Propagation in Natural Environments (비행체의 원격신호측정을 위한 전파환경을 고려한 RF 수신신호 예측 시뮬레이터 개발)

  • Hyun, Jong-Chul;Kim, Sang-Keun;Oh, Yi-Sok;Seo, Dong-Soo;Kim, Heung-Bum
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.5
    • /
    • pp.725-733
    • /
    • 2010
  • A simulator is proposed in this paper for predicting the RF signal level after propagating over sea and land surfaces. Various sea and land types and transmit/receive antenna patterns, as well as the locus of the transmit antenna, are considered for this simulator. At first, microwave reflection characteristics of various sea surfaces have been computed, based on an empirical formula which is developed in this study for the relation between the sea surface roughness and wind speed. Then, microwave reflections from land surfaces such as forests, agricultural areas, and bare surfaces, are computed using the first-order vector radiative transfer theory. Finally, the signal paths over sea and land surfaces are found using the ray tracing technique and the digital elevation model, and the signal level received by a receiving antenna is computed by the using the reflection coefficients of sea and land surfaces and the signal paths.

Processing of Multiple Regular Path Expressions using PID (경로 식별자를 이용한 다중 정규경로 처리기법)

  • Kim, Jong-Ik;Jeong, Tae-Seon;Kim, Hyeong-Ju
    • Journal of KIISE:Databases
    • /
    • v.29 no.4
    • /
    • pp.274-284
    • /
    • 2002
  • Queries on XML are based on paths in the data graph, which is represented as an edge labeled graph model. All proposed query languages for XML express queries using regular expressions to traverse arbitrary paths in the data graph. A meaningful query usually has several regular path expressions in it, but much of recent research is more concerned with optimizing a single path expression. In this paper, we present an efficient technique to process multiple path expressions in a query. We developed a data structure named as the path identifier(PID) to identify whether two given nodes lie on the fame path in the data graph or not, and utilized the PID for efficient processing of multiple path expressions. We implement our technique and present preliminary performance results.