• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.12
• /
• pp.3775-3781
• /
• 2009

This aims of this study is to examine the factors influencing on the channel satisfaction and preference of the mobile commerce. This model tests various theoretical research relating to technology acceptance model(TAM), transaction cost theory and service quality. The model is tested Structural Equation Modeling(SEM) using AMOS 7.0 analysis on the sample collected from 320 respondents. The result of hypothesis testing is as follows. First, usefulness, asset specificity, uncertainty, trust and responsiveness were influenced by channel satisfaction. Second, channel satisfaction was influenced positively by channel preference.

• Proceedings of the Korean DIstribution Association Conference
• /
• 2006.02a
• /
• pp.283-307
• /
• 2006

최근의 서비스 마케팅 문헌은 서비스 조직의 경쟁력 향상의 방편으로 서비스 고객에게 관심을 집중하고 있는 실정이다. 특히 서비스 고객은 부분적 종업원으로 인식될 수 있기 때문에 서비스 조직에 대해 참여행동을 나타낼 수 있으며, 이를 통해서 서비스 조직은 추가적 비용 없이 경쟁력을 향상시킬 수 있다. 이에 따라 고객행동 관리가 강조되고는 있으나 아직까지 실증적 연구의 주제로는 거의 다루어지고 있지 않다. 따라서 본 연구는 지금까지 간과되었던 부분인 고객참여가 고객만족에 어떻게 영향을 미치는지에 대한 메카니즘을 실증적으로 분석하기 위해, 고객참여의 영향을 매개하는 변수로서 서비스 성과와 기대를 제시하는 연구모델을 설정하였다. 구성개념을 측정하기 위해 관련 문헌들을 참고하였으며, 본 연구의 서비스 상황에 적합하도록 수정을 가하였다. 최근에 교육 서비스와 병원 서비스를 제공받은 경험이 있는 대학생을 대상으로 구조방정식을 사용하여 분석한 결과, 연구모델의 적합도는 양호하였으며 모든 연구가설이 지지되었다. 참여는 매개변수로 제시된 성과, 기대와 유의한 관계를 가지는 것으로 나타났으며, 성과와 기대는 또한 만족에 유의한 영향을 미치는 것으로 나타났다. 이러한 분석결과를 통해서 서비스 관리자는 종업원과 마찬가지로 서비스 고객을 적극적으로 관리할 필요성이 있고, 특히 고객의 서비스 성과지각과 서비스 기대에 더욱 관심을 기울여야 함을 이해할 수 있었다. 마지막으로, 이러한 실증결과에 대한 시사점을 논의하였고 미래연구를 위한 방향을 제시하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.39-47
• /
• 2010

Constraint satisfaction optimization problem is a kind of optimization problem involving cost minimization as well as complex constraints. Local search and constraint programming respectively have been used for solving such problems. In this paper, I propose a method to integrate local search and constraint programming to improve search performance. Basically, local search is used to solve the given problem. However, it is very difficult to find a feasible neighbor satisfying all the constraints when we use only local search. Therefore, I introduced constraint programming as a tool for neighbor generation. Through the experimental results using weighted N-Queens problems, I confirmed that the proposed method can significantly improve search performance.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.53-63
• /
• 2009

Use of high-strength steel members in building of high-rise buildings and large scale structures is expected to increase the effectiveness of structural design by reducing the weight and cost of structures. So far, high-strength steel members have been used in a very limited way because it is hard to select the proper strengths of steel members in a systematic way with the consideration of the structural cost. In this paper, therefore, a structural optimization technique based on Genetic algorithm is developed for effective use of high-strength steel members in structural design of high-rise buildings with the form of building frame system. The stability and efficiency of the technique is evaluated by using to a 35-story building. As a result, a stable and reliable optimal solution was obtained with a difference of 2.63% between individual and mean optimal structural costs.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.25 no.5
• /
• pp.276-284
• /
• 2013

A stochastic expected cost model has been suggested by combining the nonlinear cumulative damage model with the expected cost model together which can be useful for doing the preventive optimal-maintenance of the armor units of rubble-mound breakwaters. The suggested model has been satisfactorily calibrated by comparison of the results from others models, also the sensitivity analysis has been carried out in detail under the variation of the associated parameters with the model. The optimal repair times can be directly evaluated by minimizing the expected cost rates that depend on the social importances, damage intensity functions and resistance limits. Finally, the present cost model has been straightforwardly applied to the armor units of rubble-mound breakwaters. Based on the assumption of turning the damaged structure back to the state as good as new after repairs, the required optimal repair times and magnitudes can be determined quantitatively in terms of the optimum balance between the costs and benefits on the preventive maintenance.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.103-112
• /
• 2008

In the feasibility analysis, Braess' Paradox results in the negative social benefit in spite of adding transportation facilities. Consequently, it has been difficult to judge on the investment of SOC projects. This research aims to analyze the Braess' Paradox in the feasibility analysis and to seek a remedy for the Paradox. Several experiments were conducted on the simple network under the various conditions. From the experiments, following findings were validated: Braess' Paradox occurred only if travel demands met within certain intermediate range. In terms of traffic assignment method, the SO was more likely to reduce the effect of the Braess' Paradox than the UE. However, the Braess' Paradox in the benefit of operating cost saving occurred in all cases and the paradox in the total benefit continued. In order to solve the problem, new link cost function considered travel time and operating cost simultaneously were suggested. As a result, the negative benefit was significantly decreased in the UE case and total negative benefit was no longer shown in the SO case through the analysis.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.157-164
• /
• 2001

This paper studies on the processing of spatial joins. The spatial join operation is divided into filters and refinement steps in general. The processing of spatial joins can be greatly improved by the use of filters that reduce the polygons in order to find the intersecting ones. As a result, three possible sets of answers are identified: the positive one, the negative one and the inconclusive one. To identify all the interesting pairs of polygons with inconclusive answers, it is necessary to have access to the representation of polygons so that an exact geometry test can take place. We introduce a bit-map approximation technique to drastically reduce the computation required by the refinement step during refinement processing. Bit-map representation are used for the description of the internal, the external and the boundary regions of the polygon objects. The proposed scheme increases the chance of trivial acceptance and rejection of data objects, and reduces unnecessary disk accesses in query processing. It has been shown that the reference to the object data file can be cut down by as much as 60%.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.29 no.5
• /
• pp.429-436
• /
• 2016

In this study, the genetic algorithm based optimal structural design method is proposed. The objective functions are to minimize the cost and $CO_2$ emissions, simultaneously. The cost and $CO_2$ emissions are calculated based on the cross-sectional dimensions, length, material strength, and reinforcement ratio of beam and column members. Thus, the cost and $CO_2$ emissions are evaluated by using the amounts of concrete and reinforcement used to construct a building. In this study, the cost and $CO_2$ emissions calculated at the phases of material transportation, construction, and building operation are excluded. The constraint conditions on the strength of beam and column members and the inter-story drift ratio are considered. The linear static analysis by using OpenSees is automatically conducted in the proposed method. The genetic algorithm is employed to solve the formulated problem. The proposed method is validated by applying it to the 4-story reinforced concrete moment frame example.

• Journal of Environmental Science International
• /
• v.8 no.1
• /
• pp.115-123
• /
• 1999

Sewage has been almost treated by secondary treatment process. Secondary-treated effluent of sewage treatment plant caused the pollution of nearby beach. Nitrogen(N) and Phosphorus(P) in effluent water have caused many problems on estuary, such as red tide, eutrophication and aquatic toxicity. Therefore, the effective nitrogen and phosphorus removal from sewage treatment plants is necessary to prevent those pollution problems. However, little sewage treatment plant in Korea is effectively being operated for the removal of the nutrients. This study is analyzed for the effectiveness of cost when tertiary treatment process and Ocean Outfall are applied for the water quality of Suyong Bay After secondary treatment process, the effluent was discharged from the seabed in the depth of 32m of 4000m offshore. Pollutant concentration is decreased as much as the 180 times after the result of initial dilution, so that environmental protection requirement of Suyong Bay can satisfied. This Ocean Outfall process can save the 2.6~3.5 times as much as the cost of construction and operation for tertiary treatment process running over a 20 year.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.93-102
• /
• 2013

This paper proposes an algorithm designed to obtain the optimal solution for transportation problem. The transportation problem could be classified into balanced transportation where supply meets demand, and unbalanced transportation where supply and demand do not converge. The archetypal TSM (Transportation Simplex Method) for this optimal solution firstly converts the unbalanced problem into the balanced problem by adding dummy columns or rows. Then it obtains an initial solution through employment of various methods, including NCM, LCM, VAM, etc. Lastly, it verifies whether or not the initial solution is optimal by employing MODI. The abovementioned algorithm therefore carries out a handful of complicated steps to acquire the optimal solution. The proposed algorithm, on the other hand, skips the conversion stage for unbalanced transportation problem. It does not verify initial solution, either. The suggested algorithm firstly allocates resources so that supply meets demand, in the descending order of its loss cost. Secondly, it optimizes any surplus quantity (the amount by which the initially allocated quantity exceeds demand) in such a way that the loss cost could be minimized Once the above reallocation is terminated, an additional arrangement is carried out by transferring the allocated quantity in columns with the maximum cost to the rows with the minimum transportation cost. Upon application to 2 unbalanced transportation data and 13 balanced transportation data, the proposed algorithm has successfully obtained the optimal solution. Additionally, it generated the optimal solution for 4 data, whose solution the existing methods have failed to obtain. Consequently, the suggested algorithm could be universally applied to the transportation problem.