• Journal of Information Technology Applications and Management
• /
• 제21권1호
• /
• pp.177-184
• /
• 2014

This research analyzes the effects of factors on the demands for outbound to the countries such as Japan, China, the United States of America, Thailand, Philippines, Hong Kong, Singapore and Australia, the countries preferred by many Koreans. The factors for this research are (1) economic variables such as Korea Composite Stock Price Index (KOSPI), which could have influences on outbound tourism and exchange rate and (2) unpredictable events such as diseases, financial crisis and terrors. Regression analysis was used to identify relationship based on the monthly data from January 2001 to December 2010. The results of the analysis show that both exchange rate and KOSPI have impacts on the demands for outbound travel. In the case of travels to the United States of America and Philippines, Korean tourists usually have particular purposes such as studying, visiting relatives, playing golf or honeymoon, thus they are less influenced by the exchange rate. Moreover, Korean tourists tend not to visit particular locations for some time when shock reaction happens. As the demands for outbound travels are different from country to country accompanied by economic variables and shock variables, differentiated measure to should be considered to come close to the target numbers of tourists by switching as well as creating the demands. For further study we plan to build outbound tourism forecasting models using Artificial Neural Networks.

• Earthquakes and Structures
• /
• 제22권2호
• /
• pp.157-168
• /
• 2022

A moment-independent importance measure analysis approach was introduced to quantify the effects of structural uncertainty parameters on probabilistic seismic demands of simply supported girder bridges. Based on the probability distributions of main uncertainty parameters in bridges, conditional and unconditional bridge samples were constructed with Monte-Carlo sampling and analyzed in the OpenSees platform with a series of real seismic ground motion records. Conditional and unconditional probability density functions were developed using kernel density estimation with the results of nonlinear time history analysis of the bridge samples. Moment-independent importance measures of these uncertainty parameters were derived by numerical integrations with the conditional and unconditional probability density functions, and the uncertainty parameters were ranked in descending order of their importance. Different from Tornado diagram approach, the impacts of uncertainty parameters on the whole probability distributions of bridge seismic demands and the interactions of uncertainty parameters were considered simultaneously in the importance measure analysis approach. Results show that the interaction of uncertainty parameters had significant impacts on the seismic demand of components, and in some cases, it changed the most significant parameters for piers, bearings and abutments.

• 한국통신학회논문지
• /
• 제30권11A호
• /
• pp.979-986
• /
• 2005

광전달망(Optical Transport Network)에서 사용자의 서비스 요구는 종종 주기적인 특성을 보이므로 이러한 계획 연결 요구에 대하여 시간 중복성을 RWA 문제에 이용할 수 있다. 계획 연결 요구의 RWA 문제는 조합 최적화 방법(Combinatorial Optimal Solution)과 그래프 컬러링(Graph Coloring)의 조합으로 해결되거나, 경로 선택에 기반한 순차적(sequential) RWA(sRWA) 의해서 해결된다. 이와 같은 방법은 복잡하거나 많은 연산을 필요로 하므로 본 논문에서는 그룹화를 통해 계획 연결 요구들의 시간 중복성을 이용하여 효과적으로 경로 설정 및 파장 할당을 하는 알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘이 현재 실질적으로 효율적이라 알려진 sRWA 보다 같거나 작은 파장 수를 사용하여 $54\%$ 이상의 계산량의 성능 향상을 보인다.

• 산업기술연구
• /
• 제20권A호
• /
• pp.219-228
• /
• 2000

The determination of lot sizes in prevailing inventory problems has been made with constant safety stock over the planning horizon. But, it is more profitable to accommodate the safety stock to dynamically fluctuating demands. The objective of this paper is to study the method to determine the dynamic safety stock and lot sizing rules depending on the actual customer demands. The last period or highly fluctuating period during the consumption of a lot is the most critical one to stock-out. It means that such periods must be given more attentions. Some dynamic methods to control safety stock are proposed with viewpoints of the time, quantity, and time-quantity. Simulation results show that lot sizing methods with dynamic safety stock reduce about 10% of average total cost compared to those with constant safety stock.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제20권3호
• /
• pp.175-202
• /
• 2016

Ultrasound imaging is a widely used tool for visualizing human body's internal organs and quantifying clinical parameters. Due to its advantages such as safety, non-invasiveness, portability, low cost and real-time 2D/3D imaging, diagnostic ultrasound industry has steadily grown. Since the technology advancements such as digital beam-forming, Doppler ultrasound, real-time 3D imaging and automated diagnosis techniques, there are still a lot of demands for image quality improvement, faster and accurate imaging, 3D color Doppler imaging and advanced functional imaging modes. In order to satisfy those demands, mathematics should be used properly and effectively in ultrasound imaging. Mathematics has been used commonly as mathematical modelling, numerical solutions and visualization, combined with science and engineering. In this article, we describe a brief history of ultrasound imaging, its basic principle, its applications in obstetrics/gynecology, cardiology and radiology, domestic-industrial products, contributions of mathematics and challenging issues in ultrasound imaging.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.119-131
• /
• 1988

Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

• 한국경영과학회지
• /
• 제13권1호
• /
• pp.10-23
• /
• 1988

This paper examines a deterministic, discrete-time, finite-horizon, production/distribution problem for a one-plant multi-retailer system. Production may occur at the plant in each time period. Customer demands at each retailer over a finite number of periods are known and must be met without backlogging. The plant as well as the retailers can serve as stocking points. The problem is to find a minimum-cost production/distribution schedule satisfying the known demands. We show that under a certain cost structure a nested policy is optimal, and present an efficient algorithm to find such an optimal policy. Planning horizon results and some computational saving schemes are also presented.

• 한국멀티미디어학회논문지
• /
• 제4권3호
• /
• pp.205-214
• /
• 2001

As the real time multimedia data service has become available due to the rapid progress of computer and Internet technology, the users can enjoy the newly developed service, which is called Video On-Dem-and(VOD). However, most of service providers have not paid their attention much on the software for various service modes on VOD, but they are only concentrating un the hardware to provide with the high resolution video display. Therefore, the service providers are recently to pay more attention on the software to cope with the various demands of users than hardware. So this paper has designed and implemented the VOD service system for those demands. Since the VOD service system suggested by this paper enable off-line search functions through E-mail, the users can possibly get the necessary information from off-line Search without connecting to the server while the current VOD service can prominently help users to save the time and effort to sea고 and select the Video contents by using periodical current awareness service supported by PUSH technology and user oriented information booking and feedback service supported by SDI service.

• 한국경영과학회지
• /
• 제26권4호
• /
• pp.99-108
• /
• 2001

In the ring loading problem with demand splitting, traffic demands are given for each pall of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum load on the ring. The fastest a1gorithm to date is Myung, Kim and Tcha＇s a1gorithm that runs in Ο(n｜K｜) time where n is the number of nodes and K is the index set of the origin-destination pairs of nodes having flow traffic demands. Here we develop an a1gorithm for the ring loading problem with demand splitting that improves the rerouting step of Myung, Kim and Tcha＇s a1gorithm arid runs in Ο(min{n｜K｜, n$^2$}) time.

• 한국경영과학회지
• /
• 제34권1호
• /
• pp.61-83
• /
• 2009

This study developed a variable demand traffic assignment model by stable dynamics. Stable dynamics, suggested by Nesterov and do Palma[19], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with the user equilibrium model, which is based on the arc travel time function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on congestion. It is therefore expected to be a useful analysis tool for transportation planners. In this study, we generalize the stable dynamics into the model with variable demands. We suggest a three stage optimization model. In the first stage, we introduce critical travel times and dummy links and determine variable demands and link flows by applying an optimization problem to an extended network with the dummy links. Then we determine link travel times and path flows in the following stages. We present a numerical example of the application of the model to a given network.