• 전자공학회논문지B
• /
• 제31B권6호
• /
• pp.25-32
• /
• 1994

A new projection-based approach derived from the Radon transform for detecting and estimating 3-D locations of unresolved targets in a time-sequential set of infrared imageries is presented. Since the signal-to-noise ration per pixel is very low (a dim target) and target tracks which span over many image frames. Since the 2-D multiple representations along arbitary orientations utilizing the 3-D Radon transform, our projection-based transform method enables us to analyze the 3-D problem in terms of its 2-D projections. Our method not only alleviates the great computatioonal expense of processing entire set of images as a whole, but the results reveal that the proposed strategy produces a robust detection and estimation of 3-D target trajectories event at low SNRs.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2009년도 추계 학술논문 발표대회
• /
• pp.209-212
• /
• 2009

The Development of Cost Management is embossed efficiently to use the budget for the construction industry. The government is exploring every efforts and polices to control increasing the budget for the construction industry. However, despite of the government's efforts, researches are insufficient for a cost management of development. Also, the changed cost of construction by frequent plan change is caused of decline in quality etc during an accomplishing project. Therefore, in this study, analyzed about principal official phase of design phase to solve the problem. In order to define clearly the target cost concepts in the planning phase apply to the DTC(Design To Cost) concept and technique at the development of cost management process which will be able to manage the enterprise expense. It's process is expected with the fact that will be the possibility efficiently of fixing target cost in the planning phase by the construction client and designer.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 가을 학술발표회논문집
• /
• pp.32-39
• /
• 2000

Probabilistic structural design optimization, which is characterized by the so-called probabilistic. constraints which introduce permissible probability of violation, is preferred to deterministic design optimization since unpredictable inherent uncertainties and randomness in structural and environmental properties are to be taken quantitatively into account by probabilistic design optimization. In this paper, the well-known reliability index based MPFP(Most Probable Failure Point) search approach and the newly introduced target performance measure based MPTP(Minimum Performance Target Point) search approach are summarized and compared. The present comparison focuses on the number of iterations required for the estimation of probabilistic constraints and a technique for improvement which removes exhaustive iterations is presented as well. A 10 bar truss problem is examined for this.

• 복식문화연구
• /
• 제12권1호
• /
• pp.182-198
• /
• 2004

The purpose of this study was to analyze the previous make-up studies. A number of publications and journals were reviewed and analyzed carefully. The results of review and analysis were as follows: There were many different subjects in make-up studies and They can be divided into ten types : cosmetics purchase behavior, change of make-up culture and comparison, make-up trend by era, cosmetics industry's standing of today and strategy, art trend in make-up, brand preference of cosmetics, make up attitude, recognition about imported cosmetics and purchase behavior, color preference of cosmetics, the relationship between self-concept and make-up. In general, the cosmetic purchase behavior studies are conducted most actively. According to result that analyze existent study, special duality of cosmetics purchase action appears very variously according to standard of classification of study target and study target. But, study target and method of study are not various, and purchase behavior study collected with make-un and clothes is yew lacking. Therefore, in this study, wished to discover problem of virtue study because analyzes studies about previous make-up and present forward study direction.

• Journal of Information Processing Systems
• /
• 제16권3호
• /
• pp.639-647
• /
• 2020

In the vibration target localization algorithms based on time difference of arrival (TDOA), Fang algorithm is often used in practice because of its simple calculation. However, when the delay estimation error is large, the localization equation of Fang algorithm has no solution. In order to solve this problem, one dimensional search location algorithm based on TDOA is proposed in this paper. The concept of search is introduced in the algorithm. The distance d1 between any single sensor and the vibration target is considered as a search variable. The vibration target location is searched by changing the value of d1 in the two-dimensional plane. The experiment results show that the proposed algorithm is superior to traditional methods in localization accuracy.

• Structural Engineering and Mechanics
• /
• 제69권1호
• /
• pp.105-120
• /
• 2019

In this paper, a new efficient method for structural modal reanalysis is proposed, which can handle large finite element (FE) models requiring frequent design modifications. The global FE model is divided into a residual part not to be modified and a target part to be modified. Then, an automated matrix permutation and substructuring algorithm is applied to these parts independently. The reduced model for the residual part is calculated and saved in the initial analysis, and the target part is reduced repeatedly, whenever design modifications occur. Then, the reduced model for the target part is assembled with that of the residual part already saved; thus, the final reduced model corresponding to the new design is obtained easily and rapidly. Here, the formulation of the proposed method is derived in detail, and its computational efficiency and reanalysis ability are demonstrated through several engineering problems, including a topological modification.

• Management Science and Financial Engineering
• /
• 제5권2호
• /
• pp.55-59
• /
• 1999

In this note, we introduce the Fire Sequencing Problem, which arises in military operations. Given m weapons, n fixed targets nad required duration of firing of the weapons on the targets, we want to determine the start time of firing on each target so that makespan is miniized while satisfying various operational constraints. We show that the decision problem of the Fire Sequencing problem is strongly NP-complete and remains strongly NP-complete even if the number of weapons is two. We also briefly discuss the results with respect to the complexities of several well-known scheduling models.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.306-309
• /
• 1996

The job shop scheduling problem has been a major target for many researchers. And, most of the past studies did not consider setup time. In many cases of real manufacturing environment, however, there exists a setup time for each operations. The setup can be divide into two parts, one can be done after job arrival. The setup time based on the latter can be summed together with processing time, but that based on the former can not be. We propose an approximation method based on shifting bottleneck procedure for solving the job shop scheduling problem with sequence independent setup time. It schedules the machines one by one, taking a bottleneck machine among the machines not yet scheduled. Every time after a new machine is scheduled, all schedules previously established are updated. Both the bottlenck search and the schedule updating procedure are based on solving a single machine scheduling problem with ready time, setup time and delivery time iteratively.

• 제어로봇시스템학회논문지
• /
• 제18권12호
• /
• pp.1096-1100
• /
• 2012

Most of previous genetic algorithms for solving graph problems have used a vertex-based encoding. We proposed an edge encoding based new genetic algorithm using a spanning tree. Contrary to general edge-based encoding, a spanning tree-based encoding represents only feasible partitions. As a target problem, we adopted the MAX CUT problem, which is well known as a representative NP-hard problem, and examined the performance of the proposed genetic algorithm. The experiments on benchmark graphs are executed and compared with vertex-based encoding. Performance improvements of the spanning tree-based encoding on sparse graphs was observed.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1416-1424
• /
• 1996

The problem of optimaizing multiframe targe detection (MFTD) performance si discussed. The MFTD problem is treated as a multiple hypothesis desision problem, and a ne optimality criterion for the MFTD problem is established. It is of Neyman-Pearson (NP) type which is extended to multiple hypothesis cases. An optimal solution with respect tot eh established criterion is derived, and also proposed is a suboptimal solution which reduces the compelexity accompanying the optimal one. The trade-off between the reduction of complexity and the amount of loss in the detection performance is also studied. The proposed algorithm is applied to an active sonar system and the performance is evaluated via Monte-Carlo simulations.