Yakın Doğu Üniversitesi
Büyük Kütüphane
Adres
Yakın Doğu Bulvarı, Lefkoşa, KKTC
İletişim
library@neu.edu.tr · +90 (392) 223 64 64
Google Jackets'tan alınan resim
OpenLibrary'den resim

Group Based Timetable Algorithm For Large Utc Systems D Ibrahim, K Oastler

Yazar: Materyal türü: MakaleMakaleDil: İngilizce Yayın ayrıntıları:1999.Konu(lar): LOC sınıflandırması:
  • TA153
İçindekiler: 1999.Özet: The London Urban Traffic Control (UTC) system has been in operation for over 20 years. There are two major systems in operation: fixed time plans and SCOOT. The UTC system controls some 2000 traffic signals in Greater London on a second by second basis over the British Telecom based leased-line data circuits. Timetable algorithms enable a plan to be selected for a given junction or a group of junctions, at different times of the day. In standard timetable algorithms, a text based file stores the times and the corresponding plans and then the required plans are selected at the specified times of the day. In large UTC systems the size of this text file can be very large and difficult to manage. This paper describes a new timetable algorithm which is based on groups and it is shown that this algorithm simplifies the management of timetable operations in large UTC systems. (A*) For the covering abstract see ITRD E110327.
Bu kütüphanenin etiketleri: Kütüphanedeki eser adı için etiket yok. Etiket eklemek için oturumu açın.
Yıldız derecelendirmeleri
    Ortalama puan: 0.0 (0 oy)
Mevcut
Materyal türü Geçerli Kütüphane Yer numarası Durum Barkod
Online Electronic Document NEU Grand Library Online electronic TA153 .G76 1999 (Rafa gözat(Aşağıda açılır)) Ödünç verilmez EOL-1047

The London Urban Traffic Control (UTC) system has been in operation for over 20 years. There are two major systems in operation: fixed time plans and SCOOT. The UTC system controls some 2000 traffic signals in Greater London on a second by second basis over the British Telecom based leased-line data circuits. Timetable algorithms enable a plan to be selected for a given junction or a group of junctions, at different times of the day. In standard timetable algorithms, a text based file stores the times and the corresponding plans and then the required plans are selected at the specified times of the day. In large UTC systems the size of this text file can be very large and difficult to manage. This paper describes a new timetable algorithm which is based on groups and it is shown that this algorithm simplifies the management of timetable operations in large UTC systems. (A*) For the covering abstract see ITRD E110327.

Bu materyal hakkında henüz bir yorum yapılmamış.

bir yorum göndermek için.