PERSPECTIVA HISTÓRICA DE GESTÃO NAS IES: BALANCED SCORECARD (BSC) NO CENÁRIO ATUAL DAS UNIVERSIDADES PÚBLICAS

Esse trabalho faz um panorama das Instituições de Ensino Superior - IES públicas considerando as politicas de gestão administrativa; procura retrata uma visão das bases legais e histórica e descreve os aspectos políticos no processo decisório de gestão do Estado Nacional. O problema observa como se estrutura a gestão das IES sob o controle político do Estado? Objetivou identificar a organização estrutural da gestão pública no contexto histórico a fim de observar a gestão no modelo do Balanced Scorecard (BSC) das IES. O método utilizado na pesquisa é de natureza básica bibliográfica e documental. Os resultados observados na pesquisa levaram a considerar que as IES públicas que os gestores necessitam ter conhecimento dos processos decisórios da gestão da qual são objeto de controle do Estado e dos órgãos de controle e financiamento internacionais. No entanto as universidades públicas vêm seguindo o modelo da administração empresarial na elaboração do planejamento estratégico do qual o BSC se destaca pela sua natureza na perspectiva dos fenômenos sociais e se alinhando novas exigências da lei de responsabilidade fiscal no gerenciamento dos recursos para aprimoramento da gestão para a eficiente e eficácia

The impact of surgical delay on resectability of colorectal cancer: An international prospective cohort study

AIM: The SARS-CoV-2 pandemic has provided a unique opportunity to explore the impact of surgical delays on cancer resectability. This study aimed to compare resectability for colorectal cancer patients undergoing delayed versus non-delayed surgery. METHODS: This was an international prospective cohort study of consecutive colorectal cancer patients with a decision for curative surgery (January-April 2020). Surgical delay was defined as an operation taking place more than 4 weeks after treatment decision, in a patient who did not receive neoadjuvant therapy. A subgroup analysis explored the effects of delay in elective patients only. The impact of longer delays was explored in a sensitivity analysis. The primary outcome was complete resection, defined as curative resection with an R0 margin. RESULTS: Overall, 5453 patients from 304 hospitals in 47 countries were included, of whom 6.6% (358/5453) did not receive their planned operation. Of the 4304 operated patients without neoadjuvant therapy, 40.5% (1744/4304) were delayed beyond 4 weeks. Delayed patients were more likely to be older, men, more comorbid, have higher body mass index and have rectal cancer and early stage disease. Delayed patients had higher unadjusted rates of complete resection (93.7% vs. 91.9%, P = 0.032) and lower rates of emergency surgery (4.5% vs. 22.5%, P < 0.001). After adjustment, delay was not associated with a lower rate of complete resection (OR 1.18, 95% CI 0.90-1.55, P = 0.224), which was consistent in elective patients only (OR 0.94, 95% CI 0.69-1.27, P = 0.672). Longer delays were not associated with poorer outcomes. CONCLUSION: One in 15 colorectal cancer patients did not receive their planned operation during the first wave of COVID-19. Surgical delay did not appear to compromise resectability, raising the hypothesis that any reduction in long-term survival attributable to delays is likely to be due to micro-metastatic disease

Mitochondrial physiology

As the knowledge base and importance of mitochondrial physiology to evolution, health and disease expands, the necessity for harmonizing the terminology concerning mitochondrial respiratory states and rates has become increasingly apparent. The chemiosmotic theory establishes the mechanism of energy transformation and coupling in oxidative phosphorylation. The unifying concept of the protonmotive force provides the framework for developing a consistent theoretical foundation of mitochondrial physiology and bioenergetics. We follow the latest SI guidelines and those of the International Union of Pure and Applied Chemistry (IUPAC) on terminology in physical chemistry, extended by considerations of open systems and thermodynamics of irreversible processes. The concept-driven constructive terminology incorporates the meaning of each quantity and aligns concepts and symbols with the nomenclature of classical bioenergetics. We endeavour to provide a balanced view of mitochondrial respiratory control and a critical discussion on reporting data of mitochondrial respiration in terms of metabolic flows and fluxes. Uniform standards for evaluation of respiratory states and rates will ultimately contribute to reproducibility between laboratories and thus support the development of data repositories of mitochondrial respiratory function in species, tissues, and cells. Clarity of concept and consistency of nomenclature facilitate effective transdisciplinary communication, education, and ultimately further discovery

Highly-parallelized simulation of a pixelated LArTPC on a GPU

The rapid development of general-purpose computing on graphics processing units (GPGPU) is allowing the implementation of highly-parallelized Monte Carlo simulation chains for particle physics experiments. This technique is particularly suitable for the simulation of a pixelated charge readout for time projection chambers, given the large number of channels that this technology employs. Here we present the first implementation of a full microphysical simulator of a liquid argon time projection chamber (LArTPC) equipped with light readout and pixelated charge readout, developed for the DUNE Near Detector. The software is implemented with an end-to-end set of GPU-optimized algorithms. The algorithms have been written in Python and translated into CUDA kernels using Numba, a just-in-time compiler for a subset of Python and NumPy instructions. The GPU implementation achieves a speed up of four orders of magnitude compared with the equivalent CPU version. The simulation of the current induced on $10^3$ pixels takes around 1 ms on the GPU, compared with approximately 10 s on the CPU. The results of the simulation are compared against data from a pixel-readout LArTPC prototype

Highly-parallelized simulation of a pixelated LArTPC on a GPU

The rapid development of general-purpose computing on graphics processing units (GPGPU) is allowing the implementation of highly-parallelized Monte Carlo simulation chains for particle physics experiments. This technique is particularly suitable for the simulation of a pixelated charge readout for time projection chambers, given the large number of channels that this technology employs. Here we present the first implementation of a full microphysical simulator of a liquid argon time projection chamber (LArTPC) equipped with light readout and pixelated charge readout, developed for the DUNE Near Detector. The software is implemented with an end-to-end set of GPU-optimized algorithms. The algorithms have been written in Python and translated into CUDA kernels using Numba, a just-in-time compiler for a subset of Python and NumPy instructions. The GPU implementation achieves a speed up of four orders of magnitude compared with the equivalent CPU version. The simulation of the current induced on $10^3$ pixels takes around 1 ms on the GPU, compared with approximately 10 s on the CPU. The results of the simulation are compared against data from a pixel-readout LArTPC prototype

Highly-parallelized simulation of a pixelated LArTPC on a GPU

The rapid development of general-purpose computing on graphics processing units (GPGPU) is allowing the implementation of highly-parallelized Monte Carlo simulation chains for particle physics experiments. This technique is particularly suitable for the simulation of a pixelated charge readout for time projection chambers, given the large number of channels that this technology employs. Here we present the first implementation of a full microphysical simulator of a liquid argon time projection chamber (LArTPC) equipped with light readout and pixelated charge readout, developed for the DUNE Near Detector. The software is implemented with an end-to-end set of GPU-optimized algorithms. The algorithms have been written in Python and translated into CUDA kernels using Numba, a just-in-time compiler for a subset of Python and NumPy instructions. The GPU implementation achieves a speed up of four orders of magnitude compared with the equivalent CPU version. The simulation of the current induced on $10^3$ pixels takes around 1 ms on the GPU, compared with approximately 10 s on the CPU. The results of the simulation are compared against data from a pixel-readout LArTPC prototype

Highly-parallelized simulation of a pixelated LArTPC on a GPU

The rapid development of general-purpose computing on graphics processing units (GPGPU) is allowing the implementation of highly-parallelized Monte Carlo simulation chains for particle physics experiments. This technique is particularly suitable for the simulation of a pixelated charge readout for time projection chambers, given the large number of channels that this technology employs. Here we present the first implementation of a full microphysical simulator of a liquid argon time projection chamber (LArTPC) equipped with light readout and pixelated charge readout, developed for the DUNE Near Detector. The software is implemented with an end-to-end set of GPU-optimized algorithms. The algorithms have been written in Python and translated into CUDA kernels using Numba, a just-in-time compiler for a subset of Python and NumPy instructions. The GPU implementation achieves a speed up of four orders of magnitude compared with the equivalent CPU version. The simulation of the current induced on $10^3$ pixels takes around 1 ms on the GPU, compared with approximately 10 s on the CPU. The results of the simulation are compared against data from a pixel-readout LArTPC prototype