International Telemetering Conference Proceedings / October 17-20, 1988 / Riviera Hotel, Las Vegas, Nevada / In this paper, a programming parallel real-time process data flow telemetry system is presented. What we developed recently is a advanced telemetry system which can process multi-data-flow of multi-target for mulit-user at the same time. It can be used in RPV, missile and others. Its main characteristics are as follows: Input radio frequency is S wave band (multi-dot frequencies). In telemetry front-end, the chip microprocessor is used to make demodulation and decode. Telemetry preprocessor consists of parallel distributed chip microprocessor mould plates (bus link). There are menu shope man-computer dialogue, figure display, intelligence display and intelligence self-diagnosis in this system. Now, we have developed data compress mould plate, floating-point arithmetic mould plate, derive calculation mould plate and signal process mould plate etc. The main computer is VAX-II.

[pt] A alta complexidade do processo logístico de transporte ferroviário de carga, propicia um ambiente favorável para o desenvolvimento de ferramentas de apoio à decisão que possibilitam uma melhor utilização dos recursos envolvidos. Neste trabalho é apresentado um modelo de programação inteira original para o Problema da Alocação ótima de Vagões e Locomotivas no curto prazo (PAVL). Esse problema consiste em determinar a movimentação de vagões (carregados e vazios) e locomotivas na malha de maneira a maximizar o retorno obtido pela demanda atendida no período considerado. Além disso, é apresentada uma extensão para esse modelo onde se permite atrasar ou adiantar trens no primeiro dia do horizonte de planejamento. Esse problema foi resolvido de maneira ótima ou quase ótima em tempo razoável, tanto em termos acadêmicos como para sua utilização prática. São apresentados o problema, a formulação do modelo, as técnicas de pré-processamento utilizadas, assim como resultados computacionais de instâncias reais. / [en] The complexity of the logistic process in railway freight transportation provides a natural environment for the development of decision support tools that allow the companies to make a more efficient use of their resources. In this work we present an original integer programming model for the Cars and Locomotives short-term Allocation Problem. This problem consists in determining the movement of the cars (loaded and empty) and locomotives on the railway network in order to maximize the profit obtained with the requested demand in the given period. We also present an extension of the model in which certain delays and anticipations of trains on the first day of the period are allowed. For all instances tested, this problem was solved to optimality or near-optimality in a reasonable time, either for academic or practical purposes. We present a description of the problem, the mathematical formulation, the preprocessing techniques used, as well as the computational results obtained.