• Title/Summary/Keyword: optimal assignment

Search Result 336, Processing Time 0.018 seconds

Adaptability Questions of O-D Table Estimation Models (기종점 통행표 산출모형의 적용성 평가)

  • 오상진;박병호
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.5
    • /
    • pp.99-110
    • /
    • 1999
  • This study deals with the adaptability questions of O-D table estimation models. Its objectives are two-fold; (1) to estimate the characteristics of various O-D table estimation models(i.e. linear regression models. entropy models and statistic models) and (2) to find the model which estimates the O-D table with the best accuracy under the various data conditions. In Pursuing the above, this study gives the particular attentions to the test of the models, using the Sioux Falls network and equilibrium assignment method of MINUTP. The major findings are the followings. Firstly. it finds that the statistic models have the most goodness of fat among all models, if the required data are all Prepared. But it Presents that statistic models are the most sensitive against the underspecification and inconsistency problems of link data. Secondly, It shows that the linear regression models have the worst goodness of fat among all models. But the linear regression models are the most insensitive to the underspecification and inconsistency problems. Thirdly, THE/1 model of entropy model is sensitive against the underspecification and incon-sistency problems, but THE/2 model is insensitive. Finally, other informations like total volume, zonal Production and attraction volumes in 0-D table, help models to gain the better goodness of fit. Especially, in the statistic models. both the zonal production and attraction volume data are helpful to estimate the link volumes. It can be expected that the results dive some implications not only to the selection of optimal model under the various given data, but also to the development or modification of model.

  • PDF

On the Performance of Sample-Adaptive Product Quantizer for Noisy Channels (표본적응 프러덕트 양자기의 전송로 잡음에서의 성능 분석에 관한 연구)

  • Kim Dong Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.3 s.303
    • /
    • pp.81-90
    • /
    • 2005
  • When we transmit signals, which are quantized by the vector quantizer (VQ), through noisy channels, the overall performance of the coding system is very dependent on the employed quantization scheme and the channel error effect. In order to design an optimal coding system, the source and channel coding scheme should be jointly optimized as in the channel-optimized VQ. As a suboptimal approach, we may consider the robust VQ (RVQ). In RVQ, we consider developing an index assignment function for mapping the output of quantizers to channel symbols so that the effect of the channel errors is minimized. Recently, a VQ, which can reduce the encoding complexity and is called the sample-adaptive product quantizer (SAPQ), has been proposed. SAPQ has very similar quantizer structure as to the product quantizer (PQ). However, the quantization performance can be better than PQ. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. In this paper, SAPQ is employed in order to design an RVQ to channel errors by reducing the vector dimension. Discussions on the codebook structure of SAPQ and experiments are introduced in an aspect of robustness to noisy channels.

Transportation Card Based Optimal M-Similar Paths Searching for Estimating Passengers' Route Choice in Seoul Metropolitan Railway Network (수도권 도시철도망 승객이동경로추정을 위한 교통카드기반 최적 M-유사경로 구축방안)

  • Lee, Mee young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.16 no.2
    • /
    • pp.1-12
    • /
    • 2017
  • The Seoul metropolitan transportation card's high value lies in its recording of total population movements of the public transit system. In case of recorded information on transit by bus, even though route information utilized by each passenger is accurate, the lack of passenger transfer information of the urban railway makes it difficult to estimate correct routes taken by each passenger. Therefore, pinpointing passenger path selection patterns arising in the metropolitan railway network and using this as part of a path movement estimation model is essential. This research seeks to determine that features of passenger movement routes in the urban railway system is comprised of M-similar routes with increasing number of transfer reflected as additional costs. In order to construct the path finding conditions, an M-similar route searching method is proposed, embedded with non additive path cost which appears through inclusion of the stepwise transportation parameter. As well, sensitivity of the M-similar route method based on transportation card records is evaluated and a stochastic trip assignment model using M-similar path finding is constructed. From these, link trip and transfer trip results between lines of the Seoul metropolitan railway are presented.

Scheduling Method of Real-Time Mobile Transaction Manager considering Value of Transactions and Validity of Real-Time Data (트랜잭션의 중요도와 데이터의 유효성을 고려한 실시간 이동 트랜잭션 관리자의 스케줄링 기법)

  • Jo, Suk-Gyeong;Kim, Gyeong-Bae;Lee, Sun-Jo;Bae, Hae-Yeong
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.533-542
    • /
    • 2001
  • In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.

  • PDF

A Fundamental Study on Village Planning in the Reclaimed Area -A Case Study of Farming Villages in Deuk Ryang Reclaimed Area- (간척지 농촌취락계획을 위한 기초연구 -전남 보성군 득량간척지 농촌취락의 사례연구-)

  • 최수영;이원철;한경수;황한철
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.35 no.2
    • /
    • pp.33-42
    • /
    • 1993
  • In order to obtain the basic information for the optimal settlement planning in the reclaimed area, various existing settlement conditions on reclaimed farming village were analysed through a case study of in-and-round farming villages in Deuk Ryang Reclaimed Area. By comparison study between in-and-around villages, the allocation policy of farming settlement in the samll and medium scale area was proposed. The results obtained in this study were as follows ; 1.The population structure of the inner village(Ansim village) had become worse than the around village during 1976~1981 period from the viewpoint of total and female emigration ratios. Especially, the originally unbalanced sex ratio of Ansim village had worsen to the unacceptable ratio of 1.5 : 1(male : female). Therefore, the structural stability of the population should be carefully improved in the newly reclaimed farming villages by the systematic long-term controlling machanism.2.The farming status of Ansim village was much lower than the around villages viewing of the cultivated acreage and agricultural machinery stock Therefore, the continuous and intensive governmental support different from the existing farming area should be required for the settling of reclaimed farming. 3. The regularity of the village site as a planned village, though pursed in the first phase of village construction, had been severely disturbed inflowing of squatters. Recently, there are increasing vaccant houses in the village, and the level of living amenities and personal mobility of Ansim village are much lower than the around village. So, now, the physical structure of the village should be improved to the level of village reconstruction or new village construction. 4. The cultivated area of Ansim village leans to the south side which would be unfavoured by the farmers of the around villages, while its distributing pattern should be concentric around the village site. This phenomenon disturbs the central fuction of the planned farming village. In this respect, role assignment, relationship and balance of competence in farming activities should be planned between in-and-around villages in the reclaimed area from the initial stage. 5. Putting together the above results in this study, the farming and living conditions of Ansim village threaten its existence as a planned new farming village in the reclaimed area. And, so, the full scale reconstruction of village structure, including moving to the new site, should be designed as soon as possible. Although further many studies should be carried out, it would be sure that the new village planning should be reconsidered in the small and-medium scale reclamation works.

  • PDF

Artificial Neural Network with Firefly Algorithm-Based Collaborative Spectrum Sensing in Cognitive Radio Networks

  • Velmurugan., S;P. Ezhumalai;E.A. Mary Anita
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.7
    • /
    • pp.1951-1975
    • /
    • 2023
  • Recent advances in Cognitive Radio Networks (CRN) have elevated them to the status of a critical instrument for overcoming spectrum limits and achieving severe future wireless communication requirements. Collaborative spectrum sensing is presented for efficient channel selection because spectrum sensing is an essential part of CRNs. This study presents an innovative cooperative spectrum sensing (CSS) model that is built on the Firefly Algorithm (FA), as well as machine learning artificial neural networks (ANN). This system makes use of user grouping strategies to improve detection performance dramatically while lowering collaboration costs. Cooperative sensing wasn't used until after cognitive radio users had been correctly identified using energy data samples and an ANN model. Cooperative sensing strategies produce a user base that is either secure, requires less effort, or is faultless. The suggested method's purpose is to choose the best transmission channel. Clustering is utilized by the suggested ANN-FA model to reduce spectrum sensing inaccuracy. The transmission channel that has the highest weight is chosen by employing the method that has been provided for computing channel weight. The proposed ANN-FA model computes channel weight based on three sets of input parameters: PU utilization, CR count, and channel capacity. Using an improved evolutionary algorithm, the key principles of the ANN-FA scheme are optimized to boost the overall efficiency of the CRN channel selection technique. This study proposes the Artificial Neural Network with Firefly Algorithm (ANN-FA) for cognitive radio networks to overcome the obstacles. This proposed work focuses primarily on sensing the optimal secondary user channel and reducing the spectrum handoff delay in wireless networks. Several benchmark functions are utilized We analyze the efficacy of this innovative strategy by evaluating its performance. The performance of ANN-FA is 22.72 percent more robust and effective than that of the other metaheuristic algorithm, according to experimental findings. The proposed ANN-FA model is simulated using the NS2 simulator, The results are evaluated in terms of average interference ratio, spectrum opportunity utilization, three metrics are measured: packet delivery ratio (PDR), end-to-end delay, and end-to-average throughput for a variety of different CRs found in the network.