Buy On the Traffic Flow Control System at Bookstore UAE
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > On the Traffic Flow Control System
On the Traffic Flow Control System

On the Traffic Flow Control System


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This dissertation, "On the Traffic Flow Control System" by Li, Yan, 顏理, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Abstract of thesis entitled "On The Traffic Flow Control System" Submitted by Li Yan for the degree of Master of Philosophy at the University of Hong Kong in August 2006 The study of traffic flow control systems has been an interesting area in computer science and operations research, as such systems have important applications in road network design, public transportationsystem development andtravel planning. Inall theseapplications, theknowledge oftrafficflowinthenetwork iscrucial. Aflowisthe amount of traffic through a road connecting two junctions. A traffic control system is built with a number of monitors, with each monitor on one road. The network is modeled as a directed graph, with nodes representing network junctions and edges representing roads connecting a pair of adjacent junctions. Monitors can be placed on edges so that the flow through that edge can be determined. Additional edges can have their flow determined due to flow conservation constraint imposed on each node, that is, the sum of flow entering a node is equal to the sum of flow leaving this node. In this thesis, the k-monitor problem on traffic networks is studied. Given k monitors, we are to find a placement of monitors on edges, such that the number of edges with their flow determined is maximized. In this thesis we show the k- monitor problem is NP-hard and we also provide a simple 3-approximation algorithm called algorithm GP. Moreover, if the input graph is 3-edge-connected, we furtherimprove the approximation ratio to 2 with an algorithm based on minimum cuts, called algorithm GCUT. We shall show that algorithm GCUT has an approximation ratio of 2 for 3-edge-connected graphs. Several related problems are also discussed and some preliminary results are pre- sented. (255 words) DOI: 10.5353/th_b3943117 Subjects: Traffic flow - Mathematical models


Best Sellers


Product Details
  • ISBN-13: 9781361433867
  • Publisher: Open Dissertation Press
  • Publisher Imprint: Open Dissertation Press
  • Height: 279 mm
  • No of Pages: 72
  • Weight: 191 gr
  • ISBN-10: 1361433868
  • Publisher Date: 27 Jan 2017
  • Binding: Paperback
  • Language: English
  • Spine Width: 4 mm
  • Width: 216 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
On the Traffic Flow Control System
Open Dissertation Press -
On the Traffic Flow Control System
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

On the Traffic Flow Control System

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!