• 대한조선학회논문집
• /
• 제33권4호
• /
• pp.97-105
• /
• 1996

선체 중량이 최소가 되는 설계를 수행하기 위해서는 선체 중량이 최소가 되는 tank 배치의 결정이 선행되어야 하며, 결정된 tank 배치 내에서 선체 중량이 최소가 되는 구조 부재의 배치 및 치수를 결정하여야 한다. 선체 중량이 최소가 되는 tank 배치를 하기 위하여 저자들에 의해 개발된 선급 규정에 의한 종강도 부재의 최소 중량 설계 프로그램과 일반화 경사처짐법에 의한 횡강도 부재의 최소 중량 설계 프로그램을 결합하여 화물창부의 선각 중량을 구하였으며, 중량 추정 공식에 의해 횡격벽 및 선수미부 등의 중량을 구함으로서 선체 전체의 최소 중량 설계 프로그램을 개발하였다. 본 연구에서는 tank의 개수, web의 개수 및 종격벽의 위치 변화에 따른 선각 중량 변화를 알아보았으며, 실선 설계에 적용하고자 MARPOL을 만족하는 다양한 tank 배치를 결정하고 선체 전체의 최소 중량 설계를 수행하여 이들 중 선각 중량이 작게 되는 tank 배치를 구하였으며 실적선의 선각 중량과 비교 검토하였다.

• 한국공작기계학회논문집
• /
• 제15권1호
• /
• pp.95-101
• /
• 2006

Minimum weight design of laminated composite panel under combined loading was studied using linear and nonlinear deformation theories and by closed-form analysis and finite difference energy methods. Various buckling load factors are obatined for laminated composite panels with rectangular type longitudinal stiffeners and various longitudinal length to radius ratios, which are made from Carbon/Epoxy USNl25 prepreg and are simply-supported on four edges under combined loading, and then for them, minimum weight design analyses are carried out by the nonlinear search optimizer, ADS. This minimum weight design analyses are constructed with various process such as the simple design process, test simulation process and sensitivity analysis. Subseguently, the buckling mode shapes are obtained by buckling and minimum weight analyses.

• 대한수학회지
• /
• 제46권5호
• /
• pp.967-977
• /
• 2009

There are three standard weight functions on a linear code viz. Hamming weight, Lee weight, and Euclidean weight. Euclidean weight function is useful in connection with the lattice constructions [2] where the minimum norm of vectors in the lattice is related to the minimum Euclidean weight of the code. In this paper, we obtain an upper bound over the number of parity check digits for Euclidean weight codes detecting and correcting burst errors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권8호
• /
• pp.2157-2169
• /
• 2023

In order to handle the problem that puncture patterns will change the position distribution of original information bits and frozen bits in polar codes, which affects performance of puncture polar codes further, a minimum row weight and polar spectrum based puncture polar codes construction algorithm (called PA-MRWP) is proposed in this paper. The algorithm calculates row weight of generator matrix and sorts the row weight in ascending order first. Next, the positions with the minimum row weight are selected as initial puncture positions. If the rows with the same row weight cannot all be punctured, polar spectrum based auxiliary puncture scheme is used. In sub-channels with the same row weight, rows corresponding to the polarized sub-channels with higher reliability are selected as puncture positions to construct puncture vector, and the reliability is calculated based on polar spectrum. It is actually a two-step selection strategy, the proposed minimum row weight puncture (MRWP) algorithm is used for primary selection and polar spectrum based auxiliary puncture is used for adjustment. Simulation results show that, compared with worst quality puncture (WQP) algorithm, the proposed PA-MRWP algorithm and Gaussian approximation-aided minimum row weight puncture (GA-MRWP) algorithm provide gains of about 0.46 dB and 0.29 dB at bit error rate (BER) of 10^-4, respectively when code length N=400, code rate R=1/2. In addition, the proposed puncture algorithms improve the BER performance significantly with respect to quasi-uniform puncture (QUP) algorithm.

• 정보처리학회논문지B
• /
• 제15B권4호
• /
• pp.341-346
• /
• 2008

Minimum Weight Triangulation (MWT) 는 최적화 문제로서 주어진 그래프에 대한 최소 무게 삼각화를 계산하는 문제이다. 본 문제는 많은 다른 그래프 문제들처럼 일반 그래프에 대하여 NP-hard 계열의 문제로 알려져 있으며 지금까지 simulated annealing 및 유전 알고리즘 등 heuristic algorithm 들이 제시되어 왔다. 본 논문에서는 MWT 문제에 대하여 GA-FF 라 불리우는 새로운 유전 알고리즘을 제시하며 또한 그성능이 기존의 유전 알고리즘보다 더욱 효율적임을 보인다.

• Structural Engineering and Mechanics
• /
• 제14권4호
• /
• pp.473-489
• /
• 2002

A static linear programming formulation for minimum weight design of frames that is based on a matrix displacement method is presented in this paper. According to elementary theory of plasticity, minimum weight design of frames can be carried out by using only the equilibrium equations, because the system is statically determinate when at an incipient collapse state. In the present formulation, a statically determinate released frame is defined by introducing hinges into the real frame and the bending moments in yield constraints are expressed in terms of unit hinge rotations and the external loads respectively, by utilizing the matrix displacement method. Conventional Simplex algorithm with some modifications is utilized for the solution of linear programming problem. As the formulation is based on matrix displacement method, it may be easily adopted to the weight optimization of frames with displacement and deformation limitations. Four illustrative examples are also given for comparing the results to those obtained in previous studies.

• 대한산업공학회지
• /
• 제26권3호
• /
• pp.289-295
• /
• 2000

The triangulation problem is to make triangles using the given points on the space. The Minimum Weight Triangulation(MWT) is the problem of finding a set of triangles with the minimum weight among possible set of the triangles. In this paper, a modified genetic algorithm(GA) based on an existing genetic algorithm and multispace smoothing technique is proposed. Through the computational results, we can find the tendency that the proposed GA finds good solutions though it needs longer time than the existing GA does as the problem size increases.

• 대한수학회보
• /
• 제54권3호
• /
• pp.763-787
• /
• 2017

A graph is called 1-planar if it can be drawn in the Euclidean plane ${\mathbb{R}}^2$ such that each edge is crossed by at most one other edge. The weight of an edge is the sum of degrees of two ends. It is known that every planar graph of minimum degree ${\delta}{\geq}3$ has an edge with weight at most 13. In the present paper, we show the existence of edges with weight at most 25 in 3-connected 1-planar graphs.

• ETRI Journal
• /
• 제29권3호
• /
• pp.336-352
• /
• 2007

Sequential pattern mining has become an essential task with broad applications. Most sequential pattern mining algorithms use a minimum support threshold to prune the combinatorial search space. This strategy provides basic pruning; however, it cannot mine correlated sequential patterns with similar support and/or weight levels. If the minimum support is low, many spurious patterns having items with different support levels are found; if the minimum support is high, meaningful sequential patterns with low support levels may be missed. We present a new algorithm, weighted interesting sequential (WIS) pattern mining based on a pattern growth method in which new measures, sequential s-confidence and w-confidence, are suggested. Using these measures, weighted interesting sequential patterns with similar levels of support and/or weight are mined. The WIS algorithm gives a balance between the measures of support and weight, and considers correlation between items within sequential patterns. A performance analysis shows that WIS is efficient and scalable in weighted sequential pattern mining.

• 한국정밀공학회지
• /
• 제21권2호
• /
• pp.153-159
• /
• 2004

A control-structure combined optimal design problem is discussed taking a 3-D truss structure as a design object. We use descriptor forms for a controlled object and a generalized plant because the structural parameters appear naturally in these forms. We consider not only minimum weight design problem for structure system, but also suppression problem of the effect of disturbances for control system as the purpose of the design. By minimizing the linear sum of the normalized structural objective function and control objective function, it is possible to make optimal design by which the balance of the structural weight and the control performance is taken.