• Title/Summary/Keyword: Numerical algorithm

Search Result 4,147, Processing Time 0.036 seconds

Effectiveness of Fuzzy Graph Based Document Model

  • Aswathy M R;P.C. Reghu Raj;Ajeesh Ramanujan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.8
    • /
    • pp.2178-2198
    • /
    • 2024
  • Graph-based document models have good capabilities to reveal inter-dependencies among unstructured text data. Natural language processing (NLP) systems that use such models as an intermediate representation have shown good performance. This paper proposes a novel fuzzy graph-based document model and to demonstrate its effectiveness by applying fuzzy logic tools for text summarization. The proposed system accepts a text document as input and identifies some of its sentence level features, namely sentence position, sentence length, numerical data, thematic word, proper noun, title feature, upper case feature, and sentence similarity. The fuzzy membership value of each feature is computed from the sentences. We also propose a novel algorithm to construct the fuzzy graph as an intermediate representation of the input document. The Recall-Oriented Understudy for Gisting Evaluation (ROUGE) metric is used to evaluate the model. The evaluation based on different quality metrics was also performed to verify the effectiveness of the model. The ANOVA test confirms the hypothesis that the proposed model improves the summarizer performance by 10% when compared with the state-of-the-art summarizers employing alternate intermediate representations for the input text.

Second-order inelastic dynamic analysis of cable-stayed bridges using rectangular concrete-filled steel tubular columns

  • Van-Tuong Bui;Seung-Eock Kim
    • Steel and Composite Structures
    • /
    • v.52 no.6
    • /
    • pp.673-693
    • /
    • 2024
  • An advanced numerical method is proposed in this paper for the second-order inelastic dynamic analysis of cable-stayed bridges using rectangular concrete-filled steel tubular (CFST) columns under earthquake loadings for the first time. The proposed method can exactly predict the nonlinear response of the bridges by using only one element per member in simulating the structural model. This comes from considering both the geometric and material nonlinearities in a fiber beam-column element and a catenary cable element. In the fiber beam-column element, the geometric nonlinearities are captured by applying the stability functions, whereas the material nonlinearities are evaluated by tracing the uniaxial cyclic stress-strain curves of each fiber on the cross-sections, which are located at the integration points along the member length. A computer program was developed based on Newmark's average acceleration algorithm to solve the nonlinear equations of motion. The accuracy and computational efficiency of the proposed program were verified by comparing the predicted results with the experimental results, and the results obtained from the commercial software SAP2000 and ABAQUS. The proposed program is promising as a useful tool for practical designs for the nonlinear inelastic dynamic analysis of cable-stayed bridges.

NUMERICAL STUDY FOR A SECONDARY CIRCULAR CLARIFIER WITH DENSITY EFFECT

  • Kim, Hey-Suk;Shin, Mi-Soo;Jang, Dong-Soon;Lee, Sang-Ill;Park, Jong-Woon
    • Environmental Engineering Research
    • /
    • v.10 no.1
    • /
    • pp.15-21
    • /
    • 2005
  • A computer program is developed for the prediction of the flow pattern and the removal efficiency of suspended solid (SS) in a circular secondary clarifier. In this study the increased density effect by SS on hydrodynamics has been systematically investigated in terms of Froude Number (Fr), baffle existence, and a couple of important empirical models associated with the particle settling and Reynolds stresses. A control-volume based-finite difference method by Patankar is employed together with the SIMPLEC algorithm for the resolution of pressure-velocity coupling. The k-ε turbulence and its modified version are incorporated for the evaluation of Reynolds stresses. The calculation results predicts well the overall flow pattern such as the waterfall phenomenon at the front end of the clarifier and the bottom density current with the formation of strong recirculation especially for the case of decrease of Fr. Even if there are some noticeable differences in the prediction of two turbulence models, the calculated results of the radial velocity profiles are generally in good agreement against experimental data appeared in open literature. Parametric investigation has been systematically made with the Fr and baffle condition with detailed analysis.

Study on Detailed Air Flows in Urban Areas Using GIS Data in a Vector Format and a CFD Model (벡터 형식의 GIS 자료와 CFD 모델을 이용한 도시 지역 상세 대기 흐름 연구)

  • Kwon, A-Rum;Kim, Jae-Jin
    • Korean Journal of Remote Sensing
    • /
    • v.30 no.6
    • /
    • pp.755-767
    • /
    • 2014
  • In this study, detailed air flow characteristics in an urban areas were analyzed using GIS data and a Computational Fluid Dynamics (CFD) model. For this, a building construction algorithm optimized for Geographic Information System (GIS) data with a vector format (Los Angeles region imagery acquisition consortium 2 geographic information system, LARIAC2 GIS) was used. In the LARIAC2 GIS data, building vertices were expressed as latitude and longitude. Using the model buildings constructed by the algorithm as the surface boundary data in the CFD model, we performed numerical simulations for two building-congested areas in Los Angeles using inflow information provided by California Air Resources Board. Comparing with the inflow, there was a marked difference in wind speed and direction within the target areas, which was mainly caused by the secondarily induced local circulations such as street-canyon vortices, horse-shoe vortices, and recirculation zones. In street canyons parallel to the inflow direction, wind speed increased due to a channeling effect and, in street canyons perpendicular to the inflow direction, vertically well developed vortices were induced. In front of a building, a horse-shoe vortex was developed near the surface and, behind a building, a recirculation zone was developed. Near the surface in the areas where the secondarily induced local circulations, wind speed remarkably increased. Overall, wind direction little (largely) changed at the areas where wind speed largely increased (decreased).

Three-dimensional anisotropic inversion of resistivity tomography data in an abandoned mine area (폐광지역에서의 3차원 이방성 전기비저항 토모그래피 영상화)

  • Yi, Myeong-Jong;Kim, Jung-Ho;Son, Jeong-Sul
    • Geophysics and Geophysical Exploration
    • /
    • v.14 no.1
    • /
    • pp.7-17
    • /
    • 2011
  • We have developed an inversion code for three-dimensional (3D) resistivity tomography including the anisotropy effect. The algorithm is based on the finite element approximations for the forward modelling and Active Constraint Balancing method is adopted to enhance the resolving power of the smoothness constraint least-squares inversion. Using numerical experiments, we have shown that anisotropic inversion is viable to get an accurate image of the subsurface when the subsurface shows strong electrical anisotropy. Moreover, anisotropy can be used as additional information in the interpretation of subsurface. This algorithm was also applied to the field dataset acquired in the abandoned old mine area, where a high-rise apartment block has been built up over a mining tunnel. The main purpose of the investigation was to evaluate the safety analysis of the building due to old mining activities. Strong electrical anisotropy has been observed and it was proven to be caused by geological setting of the site. To handle the anisotropy problem, field data were inverted by a 3D anisotropic tomography algorithm and we could obtain 3D subsurface images, which matches well with geology mapping observations. The inversion results have been used to provide the subsurface model for the safety analysis in rock engineering and we could assure the residents that the apartment has no problem in its safety after the completion of investigation works.

Finding the One-to-One Optimum Path Considering User's Route Perception Characteristics of Origin and Destination (Focused on the Origin-Based Formulation and Algorithm) (출발지와 도착지의 경로인지특성을 반영한 One-to-One 최적경로탐색 (출발지기반 수식 및 알고리즘을 중심으로))

  • Shin, Seong-Il;Sohn, Kee-Min;Cho, Chong-Suk;Cho, Tcheol-Woong;Kim, Won-Keun
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.99-110
    • /
    • 2005
  • Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

Mean Square Projection Error Gradient-based Variable Forgetting Factor FAPI Algorithm (평균 제곱 투영 오차의 기울기에 기반한 가변 망각 인자 FAPI 알고리즘)

  • Seo, YoungKwang;Shin, Jong-Woo;Seo, Won-Gi;Kim, Hyoung-Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.177-187
    • /
    • 2014
  • This paper proposes a fast subspace tracking methods, which is called GVFF FAPI, based on FAPI (Fast Approximated Power Iteration) method and GVFF RLS (Gradient-based Variable Forgetting Factor Recursive Lease Squares). Since the conventional FAPI uses a constant forgetting factor for estimating covariance matrix of source signals, it has difficulty in applying to non-stationary environments such as continuously changing DOAs of source signals. To overcome the drawback of conventioanl FAPI method, the GVFF FAPI uses the gradient-based variable forgetting factor derived from an improved means square error (MSE) analysis of RLS. In order to achieve the decreased subspace error in non-stationary environments, the GVFF-FAPI algorithm used an improved forgetting factor updating equation that can produce a fast decreasing forgetting factor when the gradient is positive and a slowly increasing forgetting factor when the gradient is negative. Our numerical simulations show that GVFF-FAPI algorithm offers lower subspace error and RMSE (Root Mean Square Error) of tracked DOAs of source signals than conventional FAPI based MUSIC (MUltiple SIgnal Classification).

An Exact Solution Approach for Release Planning of Software Product Lines (소프트웨어 제품라인의 출시 계획을 위한 최적해법)

  • Yoo, Jae-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.2
    • /
    • pp.57-63
    • /
    • 2012
  • Software release planning model of software product lines was formulated as a precedence-constrained multiple 0-1 knapsack problem. The purpose of the model was to maximize the total profit of an entire set of selected features in a software product line over a multi-release planning horizon. The solution approach is a dynamic programming procedure. Feasible solutions at each stage in dynamic programming are determined by using backward dynamic programming approach while dynamic programming for multi-release planning is forward approach. The pre-processing procedure with a heuristic and reduction algorithm was applied to the single-release problems corresponding to each stage in multi-release dynamic programming in order to reduce the problem size. The heuristic algorithm is used to find a lower bound to the problem. The reduction method makes use of the lower bound to fix a number of variables at either 0 or 1. Then the reduced problem can be solved easily by the dynamic programming approaches. These procedures keep on going until release t = T. A numerical example was developed to show how well the solution procedures in this research works on it. Future work in this area could include the development of a heuristic to obtain lower bounds closer to the optimal solution to the model in this article, as well as computational test of the heuristic algorithm and the exact solution approach developed in this paper. Also, more constraints reflecting the characteristics of software product lines may be added to the model. For instance, other resources such as multiple teams, each developing one product or a platform in a software product line could be added to the model.

Color Transient Improvement Algorithm Based on Image Fusion Technique (영상 융합 기술을 이용한 색 번짐 개선 방법)

  • Chang, Joon-Young;Kang, Moon-Gi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.4
    • /
    • pp.50-58
    • /
    • 2008
  • In this paper, we propose a color transient improvement (CTI) algorithm based on image fusion to improve the color transient in the television(TV) receiver or in the MPEG decoder. Video image signals are composed of one luminance and two chrominance components, and the chrominance signals have been more band-limited than the luminance signals since the human eyes usually cannot perceive changes in chrominance over small areas. However, nowadays, as the advanced media like high-definition TV(HDTV) is developed, the blurring of color is perceived visually and affects the image quality. The proposed CTI method improves the transient of chrominance signals by exploiting the high-frequency information of the luminance signal. The high-frequency component extracted from the luminance signal is modified by spatially adaptive weights and added to the input chrominance signals. The spatially adaptive weight is estimated to minimize the ${\iota}_2-norm$ of the error between the original and the estimated chrominance signals in a local window. Experimental results with various test images show that the proposed algorithm produces steep and natural color edge transition and the proposed method outperforms conventional algorithms in terms of both visual and numerical criteria.

A Non-consecutive Cloth Draping Simulation Algorithm using Conjugate Harmonic Functions (켤레조화함수를 이용한 비순차적 의류 주름 모사 알고리즘)

  • Kang Moon Koo
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.3
    • /
    • pp.181-191
    • /
    • 2005
  • This article describes a simplified mathematical model and the relevant numerical algorithm to simulate the draped cloth on virtual human body. The proposed algorithm incorporates an elliptical, or non-consecutive, method to simulate the cloth wrinkles on moving bodies without resorting to the result of the past time-steps of drape simulation. A global-local analysis technique was employed to decompose the drape of cloths into the global deformation and the local wrinkles that will be superposed linearly The global deformation is determined directly by the rotation and the translation of body parts to generate a wrinkle-free yet globally deformed shape of cloth. The local wrinkles are calculated by solving simple elliptical equations based on the orthogonality between conjugate harmonic functions representing the wrinkle amplitude and the direction of wrinkles. The proposed method requires no interpolative time frames even for discontinuous body postures. Standing away from the incremental approach of time integration in conventional methods, the proposed method yields a remarkable reduction of CPU time and an enhanced stability. Also, the transient motion of cloth could be achieved by interpolating between the deformations corresponding to each static posture.