TELEVISÃO REGIONAL: O regional performativo na programação jornalística da TV TEM

Os meios de comunicação que atuam em perspectiva regional alcançaram, inegavelmente, maior visibilidade no contexto da globalização. Em se tratando de emissoras regionais de televisão há, em grande parte dos casos, a afiliação a uma rede nacional. Este estudo é sobre uma emissora regional, a TV TEM Bauru, integrante do grupo TV TEM de afiliadas à Rede Globo de Televisão. O trabalho se fundamenta em conceitos de região, espaço, território e local, mídia local e televisão regional. Tem como objetivo compreender as configurações desta TV, no que se refere às suas origens, vínculos corporativos e as condições de ordem tecnológica, de sustentação comercial e de cobertura jornalística, especificamente, a produção e circulação da informação jornalística gerada e difundida nas cidades da região de cobertura do grupo TV TEM. Visa também caracterizar a relação entre o espaço total de programação ocupado pela cabeça-de-rede em nível nacional e aquele destinado a programas jornalísticos produzidos localmente e, dentro destes, o tempo destinado à veiculação de anúncios publicitários em escala regional. Opta-se pelo método de abordagem dialético, dada a complexidade e as contradições do fenômeno investigado. Trata-se de uma investigação qualitativa do tipo estudo de caso, mas que incorpora dados quantitativos, e se baseia em observação e estudo de conteúdo jornalístico da emissora bauruense, além de pesquisa bibliográfica e documental. A principal conclusão é que o espaço regional é limitado por constrangimentos de ordem comercial, por restrições impostas pela cabeça de rede e, ainda, por um projeto de regionalização que não contempla significativamente as nuanças regionais.(AU)

The Brooklyn Hills Improvement Co.'s plat no. 1 : property at Woodhaven, L.I. ; Brooklyn Hills Improvement Co.'s map showing relative position of property to prominent points in cities of New York & Brooklyn /

Woodside map is black-and-white cadastral map with lot lines/dimensions, lot/block numbers, and street widths.

Influence of distance, geometry and number of control stations on quality of local geodetic networks for the purpose of georeferencing of rural properties

The implementation of local geodetic networks for georeferencing of rural properties has become a requirement after publication of the Georeferencing Technical Standard by INCRA. According to this standard, the maximum distance of baselines to GNSS L1 receivers is of 20 km. Besides the length of the baseline, the geometry and the number of geodetic control stations are other factors to be considered in the implementation of geodetic networks. Thus, this research aimed to examine the influence of baseline lengths higher than the regulated limit of 20 km, the geometry and the number of control stations on quality of local geodetic networks for georeferencing, and also to demonstrate the importance of using specific tests to evaluate the solution of ambiguities and on the quality of the adjustment. The results indicated that the increasing number of control stations has improved the quality of the network, the geometry has not influenced on the quality and the baseline length has influenced on the quality; however, lengths higher than 20 km has not interrupted the implementation, with GPS L1 receiver, of the local geodetic network for the purpose of georeferencing. Also, the use of different statistical tests, both for the evaluation of the resolution of ambiguities and for the adjustment, have enabled greater clearness in analyzing the results, which allow that unsuitable observations may be eliminated.

Occupational employment survey booklet of definitions : local and interurban passenger transit.

"BLS-2877 141."

Derailment of Chicago Transit Authority Train Number 220 between Clark/Lake and Grand/Milwaukee Stations Chicago, Illinois, July 11, 2006.

"PB2007-916302," "Notation 7833A."

Local, joint and proportional freight tariff of class rates applying between stations in the vicinity of New York, N.Y. ....

(Tariff no.)

Chicago Transit Company, a corporation : in the matter of the unification of certain local transportation properties through acquisition by Chicago Transit Company and the issuance of its securities in connection therewith. No. 30937, Examiners' report /

Mimeographed.

In the matter of the arbitration between Transport Workers Union of America, Local 100 and New York City Omnibus Corporation; Fifth Avenue Coach Company; Jamaica Buses, Inc.; Triboro Coach Company; Queens-Nassau Transit Lines, Inc.; Steinway-Omnibus Corporation; Queensboro Bridge Railway Company, Inc.; Avenue B and East Broadway Transit Company, Inc. : opinion and award /

Cover title.

Dwell-time and run-time control for DC mass rapid transit railways

Dwell times at stations and inter-station run times are the two major operational parameters to maintain train schedule in railway service. Current practices on dwell-time and run-time control are that they are only optimal with respect to certain nominal traffic conditions, but not necessarily the current service demand. The advantages of dwell-time and run-time control on trains are therefore not fully considered. The application of a dynamic programming approach, with the aid of an event-based model, to devise an optimal set of dwell times and run times for trains under given operational constraints over a regional level is presented. Since train operation is interactive and of multi-attributes, dwell-time and run-time coordination among trains is a multi-dimensional problem. The computational demand on devising trains' instructions, a prime concern in real-time applications, is excessively high. To properly reduce the computational demand in the provision of appropriate dwell times and run times for trains, a DC railway line is divided into a number of regions and each region is controlled by a dwell- time and run-time controller. The performance and feasibility of the controller in formulating the dwell-time and run-time solutions for real-time applications are demonstrated through simulations.

Coast control for mass rapid transit railways with searching methods

With daily commercial and social activity in cities, regulation of train service in mass rapid transit railways is necessary to maintain service and passenger flow. Dwell-time adjustment at stations is one commonly used approach to regulation of train service, but its control space is very limited. Coasting control is a viable means of meeting the specific run-time in an inter-station run. The current practice is to start coasting at a fixed distance from the departed station. Hence, it is only optimal with respect to a nominal operational condition of the train schedule, but not the current service demand. The advantage of coasting can only be fully secured when coasting points are determined in real-time. However, identifying the necessary starting point(s) for coasting under the constraints of current service conditions is no simple task as train movement is governed by a large number of factors. The feasibility and performance of classical and heuristic searching measures in locating coasting point(s) is studied with the aid of a single train simulator, according to specified inter-station run times.

Bottlenecks detection of track allocation schemes at rail stations by Petri nets

Robustness of the track allocation problem is rarely addressed in literatures and the obtained track allocation schemes (TAS) embody some bottlenecks. Therefore, an approach to detect bottlenecks is needed to support local optimization. First a TAS is transformed to an executable model by Petri nets. Then disturbances analysis is performed using the model and the indicators of the total trains' departure delays are collected to detect bottlenecks when each train suffers a disturbance. Finally, the results of the tests based on a rail hub linking six lines and a TAS about thirty minutes show that the minimum buffer time is 21 seconds and there are two bottlenecks where the buffer times are 57 and 44 seconds respectively, and it indicates that the bottlenecks do not certainly locate at the area where there is minimum buffer time. The proposed approach can further support selection of multi schemes and robustness optimization.

Railway junction conflict resolution by local search method

This study investigates the application of local search methods on the railway junction traffic conflict-resolution problem, with the objective of attaining a quick and reasonable solution. A procedure based on local search relies on finding a better solution than the current one by a search in the neighbourhood of the current one. The structure of neighbourhood is therefore very important to an efficient local search procedure. In this paper, the formulation of the structure of the solution, which is the right-of-way sequence assignment, is first described. Two new neighbourhood definitions are then proposed and the performance of the corresponding local search procedures is evaluated by simulation. It has been shown that they provide similar results but they can be used to handle different traffic conditions and system requirements.

Modeling Bus Rapid Transit station bus queuing for Bus Rapid Transit station bus operation analysis

Stations on Bus Rapid Transit (BRT) lines ordinarily control line capacity because they act as bottlenecks. At stations with passing lanes, congestion may occur when buses maneuvering into and out of the platform stopping lane interfere with bus flow, or when a queue of buses forms upstream of the station blocking inflow. We contend that, as bus inflow to the station area approaches capacity, queuing will become excessive in a manner similar to operation of a minor movement on an unsignalized intersection. This analogy is used to treat BRT station operation and to analyze the relationship between station queuing and capacity. In the first of three stages, we conducted microscopic simulation modeling to study and analyze operating characteristics of the station under near steady state conditions through output variables of capacity, degree of saturation and queuing. A mathematical model was then developed to estimate the relationship between average queue and degree of saturation and calibrated for a specified range of controlled scenarios of mean and coefficient of variation of dwell time. Finally, simulation results were calibrated and validated.

A Memetic Algorithm for the location-based continuously operating reference stations placement problem in Network Real-Time Kinematic

Network Real-Time Kinematic (NRTK) is a technology that can provide centimeter-level accuracy positioning services in real time, and it is enabled by a network of Continuously Operating Reference Stations (CORS). The location-oriented CORS placement problem is an important problem in the design of a NRTK as it will directly affect not only the installation and operational cost of the NRTK, but also the quality of positioning services provided by the NRTK. This paper presents a Memetic Algorithm (MA) for the location-oriented CORS placement problem, which hybridizes the powerful explorative search capacity of a genetic algorithm and the efficient and effective exploitative search capacity of a local optimization. Experimental results have shown that the MA has better performance than existing approaches. In this paper we also conduct an empirical study about the scalability of the MA, effectiveness of the hybridization technique and selection of crossover operator in the MA.