• Title/Summary/Keyword: OPTIMAL NUMBER OF USERS

Search Result 147, Processing Time 0.031 seconds

A Study on Key Successful Factors of Cruise Port (크루즈 항만의 성공요인에 관한 연구)

  • Lee, Choong Bae;Lee, Jongkoo;Noh, Jinho
    • Journal of Korea Port Economic Association
    • /
    • v.29 no.2
    • /
    • pp.81-111
    • /
    • 2013
  • Along with a general growth in living standards there has been a corresponding increase in the demand for tourism. Cruise based tourism, in particular, has become one of the most dynamic and dramatic growth sectors in the tourism industry over the last 20 years, including in the Northeast Asian region. In line with the growth of passenger numbers, the number of cruise ships and their berth capacities has increased significantly since the late 1970s. Korea, as a peninsular nation, has also experienced a rapid growth in cruise passenger numbers. The national economy has greatly benefited from this as the industry acts as an income generator, creating new jobs and potential investments and in developing local tourism. Ports play an important role in the development of any national cruise industry, providing not only ship berths but supply and bunkering facilities and a gateway to local tourism opportunities. The selection of the optimal cruise port location is an important and complex problem because the decision makers have to consider a large number of criteria which have a significant effect on the economy, environment, human life, and society. This paper investigates those criteria that are significant in developing a successful cruise port by employing a questionnaire survey of major cruise port users - shipping companies and tourism companies. The ports, surveyed in this study are Busan, Incheon, Yeosu and Jeju. All have been identified as important potential cruise ports in the Korean Government's 'The 3rd Port Basic Plan (2011-2020)'.

Ontology-based User Customized Search Service Considering User Intention (온톨로지 기반의 사용자 의도를 고려한 맞춤형 검색 서비스)

  • Kim, Sukyoung;Kim, Gunwoo
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.4
    • /
    • pp.129-143
    • /
    • 2012
  • Recently, the rapid progress of a number of standardized web technologies and the proliferation of web users in the world bring an explosive increase of producing and consuming information documents on the web. In addition, most companies have produced, shared, and managed a huge number of information documents that are needed to perform their businesses. They also have discretionally raked, stored and managed a number of web documents published on the web for their business. Along with this increase of information documents that should be managed in the companies, the need of a solution to locate information documents more accurately among a huge number of information sources have increased. In order to satisfy the need of accurate search, the market size of search engine solution market is becoming increasingly expended. The most important functionality among much functionality provided by search engine is to locate accurate information documents from a huge information sources. The major metric to evaluate the accuracy of search engine is relevance that consists of two measures, precision and recall. Precision is thought of as a measure of exactness, that is, what percentage of information considered as true answer are actually such, whereas recall is a measure of completeness, that is, what percentage of true answer are retrieved as such. These two measures can be used differently according to the applied domain. If we need to exhaustively search information such as patent documents and research papers, it is better to increase the recall. On the other hand, when the amount of information is small scale, it is better to increase precision. Most of existing web search engines typically uses a keyword search method that returns web documents including keywords which correspond to search words entered by a user. This method has a virtue of locating all web documents quickly, even though many search words are inputted. However, this method has a fundamental imitation of not considering search intention of a user, thereby retrieving irrelevant results as well as relevant ones. Thus, it takes additional time and effort to set relevant ones out from all results returned by a search engine. That is, keyword search method can increase recall, while it is difficult to locate web documents which a user actually want to find because it does not provide a means of understanding the intention of a user and reflecting it to a progress of searching information. Thus, this research suggests a new method of combining ontology-based search solution with core search functionalities provided by existing search engine solutions. The method enables a search engine to provide optimal search results by inferenceing the search intention of a user. To that end, we build an ontology which contains concepts and relationships among them in a specific domain. The ontology is used to inference synonyms of a set of search keywords inputted by a user, thereby making the search intention of the user reflected into the progress of searching information more actively compared to existing search engines. Based on the proposed method we implement a prototype search system and test the system in the patent domain where we experiment on searching relevant documents associated with a patent. The experiment shows that our system increases the both recall and precision in accuracy and augments the search productivity by using improved user interface that enables a user to interact with our search system effectively. In the future research, we will study a means of validating the better performance of our prototype system by comparing other search engine solution and will extend the applied domain into other domains for searching information such as portal.

Analysis of Spatial Characteristics Affecting the Use of Public Bicycles: Case of 'Tashu' in Daejeon (공공자전거 이용에 영향을 미치는 공간 특성 분석 - 대전광역시 '타슈'를 대상으로 -)

  • Ahn, Minsu;Yi, Changhyo
    • Journal of the Korean Regional Science Association
    • /
    • v.38 no.4
    • /
    • pp.75-91
    • /
    • 2022
  • With the recent increase in interest in climate change issues, the use of bicycles is complementing public transportation and attracting attention as one of the eco-friendly means of transportation. Daejeon Metropolitan City has been operating Tashu, a public bicycle, since 2008. This study empirically analyzed the spatial characteristics that affect the use of public bicycles by grasping the current status and characteristics of public bicycles and applying spatial econometrics analysis, an analysis model that considers the spatial dependence of spatial data. In addition, a comparative analysis was performed by deriving the results of analyzing six models in terms of rental, return, peak time, non-peak time, weekday, and weekend based on the spatial error model identified as the optimal spatial econometrics model. The analysis model results showed that significant spatial characteristics differed according to the type of public bicycle use. In general, the use of public bicycles was high in areas with a high proportion of young people, a high number of public transportation users, good access to universities and rivers, and relatively low land use mix, and high proportion of apartments. These results indicated that public bicycles are used for commuting purposes on weekdays and leisure purposes on weekends, and if the convenience of using bicycles is improved, the use of public bicycles can be further increased.

Throughput Performance analysis of AMC based on New SNR Estimation Algorithm using Preamble (프리앰블을 이용한 새로운 SNR 추정 알고리즘 기반의 AMC 기법의 전송률 성능 분석)

  • Seo, Chang-Woo;Portugal, Sherlie;Hwang, In-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.4
    • /
    • pp.6-14
    • /
    • 2011
  • The fast growing of the number of users requires the development of reliable communication systems able to provide higher data rates. In order to meet those requirements, techniques such as Multiple Input Multiple Out (MIMO) and Orthogonal Frequency Division multiplexing (OFDM) have been developed in the recent years. In order to combine the benefits of both techniques, the research activity is currently focused on MIMO-OFDM systems. In addition, for a fast wireless channel environment, the data rate and reliability can be optimized by setting the modulation and coding adaptively according to the channel conditions; and using sub-carrier frequency, and power allocation techniques. Depending on how accurate the feedback-based system obtain the channel state information (CSI) and feed it back to the transmitter without delay, the overall system performance would be poor or optimal. In this paper, we propose a Signal to Noise Ratio (SNR) estimation algorithm where the preamble is known for both sides of the transciever. Through simulations made over several channel environments, we prove that our proposed SNR estimation algorithm is more accurate compared with the traditional SNR estimation. Also, We applied AMC on several channel environments using the parameters of IEEE 802.11n, and compared the Throughput performance when using each of the different SNR Estimation Algorithms. The results obtained in the simulation confirm that the proposed algorithm produces the highest Throughput performance.

New SNR Estimation Algorithm using Preamble and Performance Analysis (프리앰블을 이용한 새로운 SNR 추정 알고리즘 제안 및 성능 분석)

  • Seo, Chang-Woo;Yoon, Gil-Sang;Portugal, Sherlie;Hwang, In-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.6-12
    • /
    • 2011
  • The fast growing of the number of users requires the development of reliable communication systems able to provide higher data rates. In order to meet those requirements, techniques such as Multiple Input Multiple Out (MIMO) and Orthogonal Frequency Division multiplexing (OFDM) have been developed in the recent years. In order to combine the benefits of both techniques, the research activity is currently focused on MIMO-OFDM systems. In addition, for a fast wireless channel environment, the data rate and reliability can be optimized by setting the modulation and coding adaptively according to the channel conditions; and using sub-carrier frequency, and power allocation techniques. Depending on how accurate the feedback-based system obtain the channel state information (CSI) and feed it back to the transmitter without delay, the overall system performance would be poor or optimal. In this paper, we propose a Signal to Noise Ratio (SNR) estimation algorithm where the preamble is known for both sides of the transciever. Through simulations made over several channel environments, we prove that our proposed SNR estimation algorithm is more accurate compared with the traditional SNR estimation.

Proxy Caching Scheme Based on the User Access Pattern Analysis for Series Video Data (시리즈 비디오 데이터의 접근 패턴에 기반한 프록시 캐슁 기법)

  • Hong, Hyeon-Ok;Park, Seong-Ho;Chung, Ki-Dong
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.8
    • /
    • pp.1066-1077
    • /
    • 2004
  • Dramatic increase in the number of Internet users want highly qualified service of continuous media contents on the web. To solve these problems, we present two network caching schemes(PPC, PPCwP) which consider the characteristics of continuous media objects and user access pattern in this paper. While there are plenty of reasons to create rich media contents, delivering this high bandwidth contents over the internet presents problems such as server overload, network congestion and client-perceived latency. PPC scheme periodically calculates the popularity of objects based on the playback quantity and determines the optimal size of the initial fraction of a continuous media object to be cached in proportion to the calculated popularity. PPCwP scheme calculates the expected popularity using the series information and prefetches the expected initial fraction of newly created continuous media objects. Under the PPCwP scheme, the initial client-perceived latency and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Trace-driven simulation have been performed to evaluate the presented caching schemes using the log-files of iMBC. Through these simulations, PPC and PPCwP outperforms LRU and LFU in terms of BHR and DSR.

  • PDF

A study on the selection of the optimal smoke control mode in train platform through quantitative risk assessment (정량적 위험도 평가를 통한 열차 승강장 화재시 최적 제연모드 선정에 관한 연구)

  • Lee, Bo-Hoon;Hong, Seo-Hee;Baek, Doo-San;Lee, Ho-Hyung
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.24 no.6
    • /
    • pp.539-552
    • /
    • 2022
  • In the case of train stations, due to the specificity of underground spaces with limited smoke emissions, if appropriate removal equipment is not equipped, the damage caused by fire smoke may increase in the event of a fire. As a result, the need for measures to ensure the safety of evacuation of underground stations has been highlighted, and research for safe evacuation of platform users in case of fire is continuously being conducted at home and abroad. However, although the smoke removal area is currently divided by smoke boundary walls and platform screen doors (PSD) and installed in the train platform, standards for smoke removal methods (air supply or exhaust) for each fire removal area, that is, smoke removal mode, are not presented. In this study, fire analysis and evacuation analysis were performed to estimate the number of deaths and to derive F/N guidance in order to quantitatively evaluate the fire risk according to the fire station fire, and the total risk was the lowest in the case of fire area exhaust and supply to adjacent areas.

Low Cost and Acceptable Delay Unicast Routing Algorithm Based on Interval Estimation (구간 추정 기반의 지연시간을 고려한 저비용 유니캐스트 라우팅 방식)

  • Kim, Moon-Seong;Bang, Young-Cheol;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.263-268
    • /
    • 2004
  • The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.

Solution Algorithms for Logit Stochastic User Equilibrium Assignment Model (확률적 로짓 통행배정모형의 해석 알고리듬)

  • 임용택
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.2
    • /
    • pp.95-105
    • /
    • 2003
  • Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.

Flow Calibration and Validation of Daechung Lake Watershed, Korea Using SWAT-CUP (SWAT-CUP을 이용한 대청호 유역 장기 유출 유량 보정 및 검증)

  • Lee, Eun-Hyoung;Seo, Dong-Il
    • Journal of Korea Water Resources Association
    • /
    • v.44 no.9
    • /
    • pp.711-720
    • /
    • 2011
  • SWAT (Soil and Water Assessment Tool) model was calibrated for the flow rate of the Deachung lake with a large area of 3108.29 $km^2$. Application of SWAT model requires significant number of input data and is prone to result in uncertainties due to errors in input data, model structure and model parameters. The SUFI-2 (Sequential Uncertainty Fitting Ver. 2) program and GLUE (Generalized Likelihood Uncertainty Estimation) program in SWAT-CUP (SWAT-Calibration and Uncertainty Program) are used to select the best parameters for SWAT model. Optimal combination of parameter values was determined through 2,000 iterative SWAT model runs. The Nash-Sutcliffe values and $R^2$ values were 0.87 and 0.89 respectively indicating both methods show good agreements with observed data successfully. RMSE and MSE values also showed similar results for both programs. It seems the SWAT-CUP has a great practical appeal for parameter optimization especially for large basin area and it also can be used for less experienced SWAT model users.