• 정보처리학회논문지D
• /
• 제10D권7호
• /
• pp.1127-1136
• /
• 2003

소프트웨어 개발 초기에 개발비용, 소요 인력과 기간을 추정하는 것은 소프트웨어공학 분야의 주요한 요소이며, 어려운 문제이다. 소프트웨어 개발 소요 인력을 추정하기 위한 대부분의 모델들은 소프트웨어 요구사항 명세서로부터 측정된 기능점수를 이용하였다. 본 논문은 기능점수에 기반하여 프로젝트에 대한 가장 실제적이고 생산적인 팀 규모와 개발기간을 선택하는 지침으로 사용될 수 있는 정보를 제공하기 위해 생산성 척도와 비용 척도를 도입하였다. 소프트웨어 개발과 유지보수를 수행한 300개 프로젝트 데이터 집합을 2개의 서브 그룹인 개발 프로젝트와 유지보수 프로젝트로 분류하였다. 생산성과 비용 측도 기준에 의해 분석한 결과 작은 팀 규모와 최소한의 개발기간이 소요되었을 때, 프로젝트가 성공적으로 수행됨을 보였다. 또한, 연구 결과에 근거하여 기능점수 규모에 따른 개발팀의 규모와 개발기간을 추정할 수 있는 모델을 제안하였다. 본 제안 모델은 소프트웨어 규모에 따라 필요한 개발팀의 규모와 개발기간 평가 기준을 제공한다.

• 정보처리학회논문지C
• /
• 제14C권4호
• /
• pp.365-370
• /
• 2007

CDS는 다양한 라우팅과 브로드캐스팅 프로토콜을 통하여 무선 에트혹 네트워크에서 가상 백본으로 널리 사용되고 있다. 최소 CDS(minimum CDS)를 계산하는 것이 여전히 NP-hard로 알려져 있지만 sub-optimal을 구하기 위한 여러가지 방법들이 제안되고 있다. 그렇지만 대부분의 제안된 프로토콜들은 너무 복잡하거나 non-local 정보를 필요로 하고, 네트워크의 위상이 변할 때 적응하지 못한다. 뿐만 아니라 CDS로 선택된 노드와 선택되지 않은 노드들이 서로 다른양의 에너지를 소비한다는 것을 고려하지 않았다. 본 논문에서는 타이머를 이용하여 에너지를 효율적으로 사용하며 네크워크 전체의 성능을 향상시키는 Timer Based Energy Aware connected Dominating Set(TECDS) 프로토콜을 제안하였다. TECDS 프로토콜은 네트워크 위상이 변할 때 필요에 따라 CDS를 보존 또는 재구성할 수 있다. 시뮬레이션을 통한 성능 평가 결과는 제안된 TECDS 프로토콜이 다른 프로토콜보다 최적에 가까운 CDS를 구성하여 서로 다른 수준의 노드의 이동성 사이에서도 네트워크 운영이 효율적으로 연장 됨을 보여주고 있다.

• 한국생산제조학회지
• /
• 제21권1호
• /
• pp.123-129
• /
• 2012

Recently, interests on cleaning robots workable in pipes (termed as in-pipe cleaning robot) are increasing because Garbage Automatic Collection Facilities (i.e, GACF) are widely being installed in Seoul metropolitan area of Korea. So far research on in-pipe robot has been focused on inspection rather than cleaning. In GACF, when garbage is moving, the impurities which are stuck to the inner face of the pipe are removed (diameter: 300 mm or 400 mm). Thus, in this paper, by using TRIZ (Inventive Theory of Problem Solving in Russian abbreviation), an in-pipe cleaning robot of GACF with the 6-link sliding mechanism will be proposed, which can be adjusted to fit into the inner face of pipe using pneumatic pressure(not spring). The proposed in-pipe cleaning robot for GACF can have forward/backward movement itself as well as rotation of brush in cleaning. The robot body should have the limited size suitable for the smaller pipe with diameter of 300 mm. In addition, for the pipe with diameter of 400 mm, the links of robot should stretch to fit into the diameter of the pipe by using the sliding mechanism. Based on the conceptual design using TRIZ, we will set up the initial design of the robot in collaboration with a field engineer of Robot Valley, Inc. in Korea. For the optimal design of in-pipe cleaning robot, the maximum impulsive force of collision between the robot and the inner face of pipe is simulated by using RecurDyn(R) when the link of sliding mechanism is stretched to fit into the 400 mm diameter of the pipe. The stresses exerted on the 6 links of sliding mechanism by the maximum impulsive force will be simulated by using ANSYS$^{(R)}$ Workbench based on the Design Of Experiment(in short DOE). Finally the optimal dimensions including thicknesses of 4 links will be decided in order to have the best safety factor as 2 in this paper as well as having the minimum mass of 4 links. It will be verified that the optimal design of 4 links has the best safety factor close to 2 as well as having the minimum mass of 4 links, compared with the initial design performed by the expert of Robot Valley, Inc. In addition, the prototype of in-pipe cleaning robot will be stated with further research.

• 열처리공학회지
• /
• 제30권2호
• /
• pp.43-52
• /
• 2017

Heat treatment condition for dissolution of the M23C6 carbides in 2.25Cr-1Mo-V-Ti material for thermal power plant tube was investigated using a dilatometer method. 2.25Cr-1Mo-V-Ti material was heat-treated at $900{\sim}1,100^{\circ}C$ for 0, 10, 30 min to find the proper dissolution condition of M23C6 carbides. The phase identification and volume fraction of the carbide were measured by using OM, SEM, EBSD and TEM analysis. Optimal heat treatment condition of M23C6 carbide dissolution was selected by predicting dissolution temperature of carbide using Bs points appeared at dilatometer curve. Experimental results showed that the conditions of carbide dissolution was 900, 1,000, $1,100^{\circ}C$ for 30 min. Eventually, the optimal heat treatment condition for dissolution was 30 min at $1,000^{\circ}C$ considering the minimum coarsening of Austenite grain size.

• Ocean and Polar Research
• /
• 제37권3호
• /
• pp.179-188
• /
• 2015

This study was carried out to determine the optimal number of ARGO floats in the East Sea in order to maximize their applications. The dominant spatio-temporal scale, size of the domain, and the typical float lifetimes in the East Sea were taken into consideration. The mean spatial de-correlation scale of temperature on isobaric surfaces reaches about 60 km. The minimum necessary number of floats is about 82 on average in order to secure independent ARGO profiles with the de-correlation scale. Considering the float lifetimes, about 27 floats per year should be deployed to maintain the 82 ARGO float array every year. To obtain spatially uniform distribution of ARGO float data, mean residence time and dispersion rate (basin area/residence time) of ARGO floats were evaluated in each basin of the East Sea. A faster (slower) dispersion rate requires more (less) ARGO floats to maintain the spatially uniform number of floats. According to the analysis, it is likely that the optimal ratio of the number of floats for each basin is 1:2:4 corresponding to Ulleung Basin:Yamato Basin:Japan Basin. In order to maintain relatively uniform ARGO observing networks, it is necessary to establish a long-term plan for deployment strategy based on float pathways and the dispersion rate parameters estimated by using currently active ARGO float trajectory data as well as reanalysis data.

• 정보보호학회논문지
• /
• 제14권2호
• /
• pp.57-68
• /
• 2004

본 논문에서는 UOWHF의 도메인을 확장하기 위한 새로운 병렬 처리 알고리즘을 제안한다. 제시되는 알고리즘은 non-complete l-ary tree 에 기반을 두고 있으며 현재까지 최적의 키 길이를 가진 유일한 알고리즘인 Shoup 의 알고리즘과 동일한 최적의 키 길이를 가진다. 또한 Sarkar의 결과를 이용하여 본 논문에서 제시되는 알고리즘이 Shoup의 알고리즘과 함께 Sarkar가 제시한 도메인 확장 알고리즘들의 커다란 집합 중에서 가장 최적화된 키 길이를 가짐을 증명한다. 그러나 제안 알고리즘의 병렬처리능력은 complete tree에 기반 한 구성 방법들 보다 약간 비효율적이다. 그러나 만약 l이 점점 커진다면 알고리즘의 병렬처리능력도 complete tree 에 기반 한 방법들에 가까워진다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집E
• /
• pp.253-258
• /
• 2001

Control of drag force on a circular cylinder using a detached splitter plate is numerically studied for laminar flow. A splitter plate with the same length as the cylinder diameter(d) is placed horizontally in the wake region. Its position is described by the gap ratio(G/d), where G represents the gap between the cylinder base point and the leading edge of the plate. The drag varies with the gap ratio; it has the minimum value at a certain gap ratio for each Reynolds number. The drag sharply increases past the optimum gap ratio; this seems to be related to the sudden change in the bubble size in the wake region. This trend is consistent with the experimental observation currently available in case of turbulent flow. It is also found that the net drag coefficient significantly depends on the variation of base suction coefficient.

• Steel and Composite Structures
• /
• 제19권4호
• /
• pp.995-1009
• /
• 2015

This study presents design optimization of spot welded structures to attain maximum strength by using the Nelder-Mead (Simplex) method. It is the main idea of the algorithm that the simulation run is executed several times to satisfy predefined convergence criteria and every run uses the starting points of the previous configurations. The material and size of the sheet plates are the pre-assigned parameters which do not change in the optimization cycle. Locations of the spot welds, on the other hand, are chosen to be design variables. In order to calculate the objective function, which is the maximum equivalent stress, ANSYS, general purpose finite element analysis software, is used. To obtain global optimum locations of spot welds a methodology is proposed by modifying the Nelder-Mead (Simplex) method. The procedure is applied to a number of representative problems to demonstrate the validity and effectiveness of the proposed method. It is shown that it is possible to obtain the global optimum values without stacking local minimum ones by using proposed methodology.

• 대한전자공학회논문지
• /
• 제24권6호
• /
• pp.1068-1073
• /
• 1987

Traditional circuit partitioning algorithm using the cluster development method, which is suitable for such applications as single chip floor planning or multiple layer PCB system placement, where the clusters are formed so that inter-cluster nets are localized within the I/O connector pins, may not be appropriate for the functiona block placement in truly 3-D electronic modules. 3-D hybrid IC is one such example where the inter-layer routing as well as the intra-layer routing can be maximally incorporated to reduce the overall circuit size, cooling requirements and to improve the speed performance. In this paper, we propose a new algorithm called MBE(Minimum Box Embedding) for the layer assignment of each functional block in 3-D hybrid IC design. The sequence of MBE is as follows` i) force-directed relaxation in 3-D space, ii) exhaustive search for the optimal orientation of the slicing plane and iii) layer assignment. The algorithm is first explaines for a 2-D reduced problem, and then extended for 3-D applications. An example result for a circuit consisting of 80 blocks has been shown.

• 전자공학회논문지D
• /
• 제34D권12호
• /
• pp.62-67
• /
• 1997

The optical lithography wit an ArF excimer laser as a light source is expected to be used in the mass production of giga-bit DRAMs which require less than 0.2.mu.m minimum feature size. In this case, the distortion of a patterned image becomes very severe, since the lithography porcess is performed at the resolution limit. Traditionally, the photomask pattern was designed and revised with trial-and-error methods, such as repeated execution of process simulators or actual process experiments which require time and effort. Ths paper describes a program which automatically finds an optimal mask pattern. The program divides the mask plane into cells with same sizes, chooses a cell randomly, changes the transparent/opaque property of the cell, and eventually genrates a mask pattern which produces required image pattern. The program was applied to real DRAM cell patterns to produce mask patterns which genertes image patterns closer to object images than original mask patterns.