• Title/Summary/Keyword: best first

Search Result 3,350, Processing Time 0.025 seconds

First- and Second-best Pricing in Stable Dynamic Models (안정동력학 모형에서 최선 통행료 및 차선 통행료)

  • Park, Koo-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.4
    • /
    • pp.123-138
    • /
    • 2009
  • This study examined the first- and second-best pricing by stable dynamics in congested transportation networks. Stable dynamics, suggested by Nesterov and de Palma (2003), is a new model which describes and provides a stable state of congestion in urban transportation networks. The first-best pricing in user equilibrium models introduces user-equilibrium in the system-equilibrium by tolling the difference between the marginal social cost and the marginal private cost on each link. Nevertheless, the second-best pricing, which levies the toll on some, but not all, links, is relevant from the practical point of view. In comparison with the user equilibrium model, the stable dynamic model provides a solution equivalent to system-equilibrium if it is focused on link flows. Therefore the toll interval on each link, which keeps up the system-equilibrium, is more meaningful than the first-best pricing. In addition, the second-best pricing in stable dynamic models is the same as the first-best pricing since the toll interval is separately given by each link. As an effect of congestion pricing in stable dynamic models, we can remove the inefficiency of the network with inefficient Braess links by levying a toll on the Braess link. We present a numerical example applied to the network with 6 nodes and 9 links, including 2 Braess links.

Economics of Supply Chain Contracting for Quality

  • Kim Taeho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.539-553
    • /
    • 2004
  • This paper models and solves contracting schemes for both when quality is perfectly observable and when quality is not perfectly observable in supply chain. When quality is perfectly observable, the first-best optimal solution which is that the marginal utility of procurer obtained from the quantity and quality supplied by suppliers (the price) is equal to the marginal cost to produce the quantity and quality is obtained. However, when quality is not perfectly observable to procurers the optimal solution cannot be the first-best but the second-best where the price is greater than the marginal cost to produce the quantity and quality and social welfare is less than that of the first-best solution.

  • PDF

Depth-first branch-and-bound-based decoder with low complexity (검출 복잡도를 감소 시키는 Depth-first branch and bound 알고리즘 기반 디코더)

  • Lee, Eun-Ju;Kabir, S.M.Humayun;Yoon, Gi-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2525-2532
    • /
    • 2009
  • In this paper, a fast sphere decoder is proposed for the joint detection of phase-shift keying (PSK) signals in uncoded Vertical Bell Laboratories Layered Space Time (V-BLAST) systems. The proposed decoder, PSD, consists of preprocessing stage and search stage. The search stage of PSD relies on the depth-first branch-and-bound (BB) algorithm with "best-first" orders stored in lookup tables. Simulation results show that the PSD is able to provide the system with the maximum likelihood (ML) performance at low complexity.

BEST PROXIMITY PAIRS AND NASH EQUILIBRIUM PAIRS

  • Kim, Won-Kyu;Kum, Sang-Ho
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.5
    • /
    • pp.1297-1310
    • /
    • 2008
  • Main purpose of this paper is to combine the optimal form of Fan's best approximation theorem and Nash's equilibrium existence theorem into a single existence theorem simultaneously. For this, we first prove a general best proximity pair theorem which includes a number of known best proximity theorems. Next, we will introduce a new equilibrium concept for a generalized Nash game with normal form, and as applications, we will prove new existence theorems of Nash equilibrium pairs for generalized Nash games with normal form.

Rich Transcription Generation Using Automatic Insertion of Punctuation Marks (자동 구두점 삽입을 이용한 Rich Transcription 생성)

  • Kim, Ji-Hwan
    • MALSORI
    • /
    • no.61
    • /
    • pp.87-100
    • /
    • 2007
  • A punctuation generation system which combines prosodic information with acoustic and language model information is presented. Experiments have been conducted first for the reference text transcriptions. In these experiments, prosodic information was shown to be more useful than language model information. When these information sources are combined, an F-measure of up to 0.7830 was obtained for adding punctuation to a reference transcription. This method of punctuation generation can also be applied to the 1-best output of a speech recogniser. The 1-best output is first time aligned. Based on the time alignment information, prosodic features are generated. As in the approach applied in the punctuation generation for reference transcriptions, the best sequence of punctuation marks for this 1-best output is found using the prosodic feature model and an language model trained on texts which contain punctuation marks.

  • PDF

Research on improving correctness of cardiac disorder data classifier by applying Best-First decision tree method (Best-First decision tree 기법을 적용한 심전도 데이터 분류기의 정확도 향상에 관한 연구)

  • Lee, Hyun-Ju;Shin, Dong-Kyoo;Park, Hee-Won;Kim, Soo-Han;Shin, Dong-Il
    • Journal of Internet Computing and Services
    • /
    • v.12 no.6
    • /
    • pp.63-71
    • /
    • 2011
  • Cardiac disorder data are generally tested using the classifier and QRS-Complex and R-R interval which is used in this experiment are often extracted by ECG(Electrocardiogram) signals. The experimentation of ECG data with classifier is generally performed with SVM(Support Vector Machine) and MLP(Multilayer Perceptron) classifier, but this study experimented with Best-First Decision Tree(B-F Tree) derived from the Dicision Tree among Random Forest classifier algorithms to improve accuracy. To compare and analyze accuracy, experimentation of SVM, MLP, RBF(Radial Basic Function) Network and Decision Tree classifiers are performed and also compared the result of announced papers carried out under same interval and data. Comparing the accuracy of Random Forest classifier with above four ones, Random Forest is the best in accuracy. As though R-R interval was extracted using Band-pass filter in pre-processing of this experiment, in future, more filter study is needed to extract accurate interval.

Design and Performance Analysis of a Parallel Optimal Branch-and-Bound Algorithm for MIN-based Multiprocessors (MIN-based 다중 처리 시스템을 위한 효율적인 병렬 Branch-and-Bound 알고리즘 설계 및 성능 분석)

  • Yang, Myung-Kook
    • Journal of IKEEE
    • /
    • v.1 no.1 s.1
    • /
    • pp.31-46
    • /
    • 1997
  • In this paper, a parallel Optimal Best-First search Branch-and-Bound(B&B) algorithm(pobs) is designed and evaluated for MIN-based multiprocessor systems. The proposed algorithm decomposes a problem into G subproblems, where each subproblem is processed on a group of P processors. Each processor group uses tile sub-Global Best-First search technique to find a local solution. The local solutions are broadcasted through the network to compute the global solution. This broadcast provides not only the comparison of G local solutions but also the load balancing among the processor groups. A performance analysis is then conducted to estimate the speed-up of the proposed parallel B&B algorithm. The analytical model is developed based on the probabilistic properties of the B&B algorithm. It considers both the computation time and communication overheads to evaluate the realistic performance of the algorithm under the parallel processing environment. In order to validate the proposed evaluation model, the simulation of the parallel B&B algorithm on a MIN-based system is carried out at the same time. The results from both analysis and simulation match closely. It is also shown that the proposed Optimal Best-First search B&B algorithm performs better than other reported schemes with its various advantageous features such as: less subproblem evaluations, prefer load balancing, and limited scope of remote communication.

  • PDF

Characteristics of First Flush in Highway Storm Runoff (강우시 발생하는 고속도로 유출수의 초기우수 특성 및 기준)

  • Kim, Lee-Hyung;Kang, Joohyon
    • Journal of Korean Society on Water Environment
    • /
    • v.20 no.6
    • /
    • pp.641-646
    • /
    • 2004
  • Vehicle emissions from highway landuse include different pollutants such as heavy metals, oil and grease and particulates from fuels, brake pad wear and tire wear. Since highways are impervious and have high pollutant mass emissions from vehicular activity, it is considered as stormwater intensive landuses. Therefore this research was performed to understand the magnitude of first flush and to suggest the criteria of first flush for storm runoff management in highways. The fractions of washed-off mass are very high in first 30% of runoff volume, which suggests a definition of first flush. The washed-off mass stabilizes after 30% of the runoff volume and it is apparent that treatment capacity in the early part of a storm is more valuable than treatment capacity in the later part of the storm. Using the criteria of "high" first flush and "medium" first flush, as 50% of the mass in the first 30% of the volume, and 30 to 50% in the first 30% volume, respectively, more than 30% of the storms showed high first flush. A "first flush friendly" best management practice(BMP), meaning a BMP that can treat a high percentage or all of the initial flow, would be advantageous up to 80% of the events.

A study on the improvement of BCM industry through legal systems (BCM(재해경감활동관리)산업 활성화를 위한 법·제도 개선 방안 연구)

  • Han, Jong-U
    • Disaster and Security
    • /
    • v.5 no.1
    • /
    • pp.93-100
    • /
    • 2015
  • Although many years passed since 'The Legislative bill on the support of voluntary activities of enterprises for disaster reduction'(hereinafter referred to as 'enterprise disaster reduction act') has been first enacted in 2007, BCMS is still not activated in our society. In contrast, after 911 Terror, importance of BCM is getting magnified and standardization research & institutionalization i s a lso proceeding i all over world. Lately, Disaster preventing activities is urgently needed like the sinking of 'Sewol ferry'. So the purpose of this paper is proposed for establishment of 'BCMS' and activation of the certificate system for Best-Run Business by analyzing the problem of 'enterprise disaster reduction act' and weak of activation as following. First, propel changing the policy of self-regulated participation to mandatory about the certificate system for Best-Run Business from public entity to government ministry and it is able to activate by propelling demo business of the certificate system for Best-Run Business. Second, public entity that has been given the certificate system for Best-Run Business by affiliating with Disaster Management Assessment of government management can be exempted from Disaster Management Assessment or those entity can arrange for connectivity acquisition method of 'Excellent rate'. Third, to publicize the activation of the law mentioned above, makes public entity r ecognizable by incorporating 'BCMS' into National safety management plan and establishment of National critical infrastructures security plan. Fourth, it should be reviewed to improving the related act regarding to inclusion of public organizations as well as private enterprises.

  • PDF