• Title/Summary/Keyword: Constraint method

Search Result 1,686, Processing Time 0.022 seconds

Determination of Structural Member Section based on Nonlinear Behaviors of Steel Cable-Stayed Bridges and Harmony Search Algorithm (강사장교 비선형거동과 하모니 서치 알고리즘에 기반한 사장교 구성 단면 결정)

  • Sang-Soo Ma;Tae-Yun Kwon;Won-Hong Lee;Jin-Hee Ahn
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.28 no.4
    • /
    • pp.1-12
    • /
    • 2024
  • In this study, a determination method of structural member section based on Nonlinear behaviors of steel cable-stayed bridges and the Harmony Search algorithm was presented. The Harmony Search algorithm determines the structural member section of cable-stayed bridges by repeating the process of setting the initial value, initializing the harmony memory, configuring the new harmony memory, and updating the harmony memory to search for the optimal value. The nonlinear initial shape analysis of a three-dimensional steel cable-stayed bridge was performed with the cross-section of the main member selected by the Harmony Search algorithm, and the optimal cross-section of the main members of the cable-stayed bridge, such as pylons, girders, cross-beams, and cables, reflecting the complex behavior characteristics and the nonlinearity of each member was determined in consideration of the initial tension and shape. The total weight was used as the objective function for determining the cross-section of the main member of the cable-stayed bridges, and the load resistance ability and serviceability based on the ultimate state design method were used as the restraint conditions. The width and height ratio of the girder and cross-section were considered additional restraint conditions. The optimal sections of the main members were made possible to be determined by considering the geometry and material nonlinearity of the pylons, girders, and cross-sections and the nonlinearity of the cable members. As a result of determining the optimal cross-section, it was confirmed that the proposed analysis method can determine the optimal cross-section according to the various constraint conditions of the cable-stayed bridge, and the structural member section of the cable-stayed bridge considering the nonlinearity can be determined through the Harmony Search algorithm.

The MCSTOP Algorithm about the Minimum Cost Spanning Tree and the Optimum Path Generation for the Multicasting Path Assignment (최적 경로 생성 및 최소 비용 신장 트리를 이용한 멀티캐스트 경로 배정 알고리즘 : MCSTOP)

  • Park, Moon-Sung;Kim, Jin-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.4
    • /
    • pp.1033-1043
    • /
    • 1998
  • In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

  • PDF

Estimation of Life Expectancy and Budget Demands based on Maintenance Strategy (도로포장 유지보수 전략에 따른 기대수명과 보수비용산정)

  • Han, Dae-Seok;Do, Myung-Sik
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.4D
    • /
    • pp.345-356
    • /
    • 2012
  • Road pavement requires repetitive maintenance works to maintain satisfactory service level to the public. However, the repetitive maintenance works upon deteriorated pavement structure make negative effects to deterioration speed. It often leads to inefficient use of limited budget. For that reason, the pavements require reconstruction work to recover their original performance. Recently, construction demands in the Korean national highway have already been reached to maximum level, and the aged pavements start to demand much more reconstruction works. However, in the real world, road agencies have often been confused when they determine maintenance design for such aged road sections due to budget constraint. It is because there is no reliable long-term maintenance strategy that supports their decision making. To support their decision making, this paper aimed to suggest the best maintenance strategy considering changing process of pavement performance by repetitive maintenance works. As an analysis method, probability distribution and hazard function to estimate the life expectancy were adopted, and then the results were used for long-term life cycle cost analysis with deterministic or Monte-Carlo method under various scenarios. As an empirical study, the Korean national highway data that has long-maintenance history data since 1986 has been applied. Last, this paper considered quality assurance of maintenance work to improve maintenance quality. These could be important information as a part of long-term maintenance strategy of pavement.

Generalization of error decision rules in a grammar checker using Korean WordNet, KorLex (명사 어휘의미망을 활용한 문법 검사기의 문맥 오류 결정 규칙 일반화)

  • So, Gil-Ja;Lee, Seung-Hee;Kwon, Hyuk-Chul
    • The KIPS Transactions:PartB
    • /
    • v.18B no.6
    • /
    • pp.405-414
    • /
    • 2011
  • Korean grammar checkers typically detect context-dependent errors by employing heuristic rules that are manually formulated by a language expert. These rules are appended each time a new error pattern is detected. However, such grammar checkers are not consistent. In order to resolve this shortcoming, we propose new method for generalizing error decision rules to detect the above errors. For this purpose, we use an existing thesaurus KorLex, which is the Korean version of Princeton WordNet. KorLex has hierarchical word senses for nouns, but does not contain any information about the relationships between cases in a sentence. Through the Tree Cut Model and the MDL(minimum description length) model based on information theory, we extract noun classes from KorLex and generalize error decision rules from these noun classes. In order to verify the accuracy of the new method in an experiment, we extracted nouns used as an object of the four predicates usually confused from a large corpus, and subsequently extracted noun classes from these nouns. We found that the number of error decision rules generalized from these noun classes has decreased to about 64.8%. In conclusion, the precision of our grammar checker exceeds that of conventional ones by 6.2%.

Development of a Metamodel-Based Healthcare Service System using OSGi Component Platform (OSGi 컴포넌트 플랫폼을 이용한 메타모델 기반의 건강관리 서비스 시스템 개발)

  • Kim, Tae-Woong;Kim, Hee-Cheol
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.1
    • /
    • pp.121-132
    • /
    • 2011
  • A healthcare system is a type of medical information system that performs early detection and prevention in diseases by checking one's health condition periodically. Such a healthcare system is based on the signal obtained from the body. However, the developed existing system represents certain differences in the storage and description of vital signs according to medicare devices and the evaluation method of the system. It brings some disadvantages, such as lacks in the interoperability between systems, increases in the development cost of systems, and absence of a unified system. Thus, this study develops a healthcare system based on a meta model. For establishing this objective, this study describes and stores vital sign data based on the standard meta model of HL7 and applies OCL, which is a mathematical specification language, for defining wellness indexes and extracting data in order to evaluate health risk appraisals in health. In addition, this study implements components based on OSGi and assemble them in order to easily extend various devices and systems. By describing vital data based on the meta model, it represents some advantages that it makes possible to ensure the interoperability between systems and introduce the standardization of the evaluation method of health conditions through defining the wellness index using OCL. Also, it provides dear specifications.

Effective Harmony Search-Based Optimization of Cost-Sensitive Boosting for Improving the Performance of Cross-Project Defect Prediction (교차 프로젝트 결함 예측 성능 향상을 위한 효과적인 하모니 검색 기반 비용 민감 부스팅 최적화)

  • Ryu, Duksan;Baik, Jongmoon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.3
    • /
    • pp.77-90
    • /
    • 2018
  • Software Defect Prediction (SDP) is a field of study that identifies defective modules. With insufficient local data, a company can exploit Cross-Project Defect Prediction (CPDP), a way to build a classifier using dataset collected from other companies. Most machine learning algorithms for SDP have used more than one parameter that significantly affects prediction performance depending on different values. The objective of this study is to propose a parameter selection technique to enhance the performance of CPDP. Using a Harmony Search algorithm (HS), our approach tunes parameters of cost-sensitive boosting, a method to tackle class imbalance causing the difficulty of prediction. According to distributional characteristics, parameter ranges and constraint rules between parameters are defined and applied to HS. The proposed approach is compared with three CPDP methods and a Within-Project Defect Prediction (WPDP) method over fifteen target projects. The experimental results indicate that the proposed model outperforms the other CPDP methods in the context of class imbalance. Unlike the previous researches showing high probability of false alarm or low probability of detection, our approach provides acceptable high PD and low PF while providing high overall performance. It also provides similar performance compared with WPDP.

Integration of Ontology Open-World and Rule Closed-World Reasoning (온톨로지 Open World 추론과 규칙 Closed World 추론의 통합)

  • Choi, Jung-Hwa;Park, Young-Tack
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.4
    • /
    • pp.282-296
    • /
    • 2010
  • OWL is an ontology language for the Semantic Web, and suited to modelling the knowledge of a specific domain in the real-world. Ontology also can infer new implicit knowledge from the explicit knowledge. However, the modeled knowledge cannot be complete as the whole of the common-sense of the human cannot be represented totally. Ontology do not concern handling nonmonotonic reasoning to detect incomplete modeling such as the integrity constraints and exceptions. A default rule can handle the exception about a specific class in ontology. Integrity constraint can be clear that restrictions on class define which and how many relationships the instances of that class must hold. In this paper, we propose a practical reasoning system for open and closed-world reasoning that supports a novel hybrid integration of ontology based on open world assumption (OWA) and non-monotonic rule based on closed-world assumption (CWA). The system utilizes a method to solve the problem which occurs when dealing with the incomplete knowledge under the OWA. The method uses the answer set programming (ASP) to find a solution. ASP is a logic-program, which can be seen as the computational embodiment of non-monotonic reasoning, and enables a query based on CWA to knowledge base (KB) of description logic. Our system not only finds practical cases from examples by the Protege, which require non-monotonic reasoning, but also estimates novel reasoning results for the cases based on KB which realizes a transparent integration of rules and ontologies supported by some well-known projects.

Interactive Projection by Closed-loop based Position Tracking of Projected Area for Portable Projector (이동 프로젝터 투사영역의 폐회로 기반 위치추적에 의한 인터랙티브 투사)

  • Park, Ji-Young;Rhee, Seon-Min;Kim, Myoung-Hee
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.1
    • /
    • pp.29-38
    • /
    • 2010
  • We propose an interactive projection technique to display details of a large image in a high resolution and brightness by tracking a portable projector. A closed-loop based tracking method is presented to update the projected image while a user changes the position of the detail area by moving the portable projector. A marker is embedded in the large image to indicate the position to be occupied by the detail image projected by the portable projector. The marker is extracted in sequential images acquired by a camera attached to the portable projector. The marker position in the large display image is updated under a constraint that the center positions of marker and camera frame coincide in every camera frame. The image and projective transformation for warping are calculated using the marker position and shape in the camera frame. The marker's four corner points are determined by a four-step segmentation process which consists of camera image preprocessing based on HSI, edge extraction by Hough transformation, quadrangle test, and cross-ratio test. The interactive projection system implemented by the proposed method performs at about 24fps. In the user study, the overall feedback about the system usability was very high.

Face Detection Using A Selectively Attentional Hough Transform and Neural Network (선택적 주의집중 Hough 변환과 신경망을 이용한 얼굴 검출)

  • Choi, Il;Seo, Jung-Ik;Chien, Sung-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.4
    • /
    • pp.93-101
    • /
    • 2004
  • A face boundary can be approximated by an ellipse with five-dimensional parameters. This property allows an ellipse detection algorithm to be adapted to detecting faces. However, the construction of a huge five-dimensional parameter space for a Hough transform is quite unpractical. Accordingly, we Propose a selectively attentional Hough transform method for detecting faces from a symmetric contour in an image. The idea is based on the use of a constant aspect ratio for a face, gradient information, and scan-line-based orientation decomposition, thereby allowing a 5-dimensional problem to be decomposed into a two-dimensional one to compute a center with a specific orientation and an one-dimensional one to estimate a short axis. In addition, a two-point selection constraint using geometric and gradient information is also employed to increase the speed and cope with a cluttered background. After detecting candidate face regions using the proposed Hough transform, a multi-layer perceptron verifier is adopted to reject false positives. The proposed method was found to be relatively fast and promising.

A Study on the Structural Optimization for Geodesic Dome (지오데식 돔의 구조최적화에 대한 연구)

  • Lee, Sang-Jin;Bae, Jung-Eun
    • Journal of Korean Association for Spatial Structures
    • /
    • v.8 no.4
    • /
    • pp.47-55
    • /
    • 2008
  • This paper deals with basic theories and some numerical results on structural optimization for geodesic dome. First of all, the space efficiency of geodesic dome is investigated by using the ratio of icosahedron's surface area to the internal volume enclosed by it. The procedure how to create the geodesic dome is also provided in systematic way and implemented and utilized into the design optimization code ISADO-OPT. The mathematical programming technique is introduced to find out the optimum pattern of member size of geodesic dome against a point load. In this study, total weight of structure is considered as the objective function to be minimized and the displacement occurred at loading point and member stresses of geodesic dome are used as the constraint functions. The finite difference method is used to calculate the design sensitivity of objective function with respect to design variables. The SLP, SQP and MFDM available in the optimizer DoT is used to search optimum member size patterns of geodesic dome. It is found to be that the optimum member size pattern can be efficiently obtained by using the proposed design optimization technique and numerical results can be used as benchmark test as a basic reference solution for design optimization of dome structures.

  • PDF