<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>TEDE Coleção: O programa tem como área de concentração a Ciência da Computação, e será desenvolvido segundo 2 linhas de pesquisa: Sistemas de Computação e Computação Aplicada.</title>
  <link rel="alternate" href="https://tedebc.ufma.br/jspui/handle/tede/3739" />
  <subtitle>O programa tem como área de concentração a Ciência da Computação, e será desenvolvido segundo 2 linhas de pesquisa: Sistemas de Computação e Computação Aplicada.</subtitle>
  <id>https://tedebc.ufma.br/jspui/handle/tede/3739</id>
  <updated>2026-06-05T05:23:10Z</updated>
  <dc:date>2026-06-05T05:23:10Z</dc:date>
  <entry>
    <title>Aprendizado por reforço aplicado ao problema de alocação de berços graneleiros com controle de estoque</title>
    <link rel="alternate" href="https://tedebc.ufma.br/jspui/handle/tede/6964" />
    <author>
      <name>SILVA, Victor Hugo Barros</name>
    </author>
    <id>https://tedebc.ufma.br/jspui/handle/tede/6964</id>
    <updated>2026-05-13T19:15:40Z</updated>
    <published>2026-02-26T00:00:00Z</published>
    <summary type="text">Título: Aprendizado por reforço aplicado ao problema de alocação de berços graneleiros com controle de estoque
Autor: SILVA, Victor Hugo Barros
Primeiro orientador: OLIVEIRA, Alexandre César Muniz de
Abstract: International maritime transport has established itself as the cornerstone of the global&#xD;
economy, accounting for approximately 80% of the volume and more than 70% of the total&#xD;
value of world trade in goods. Given this magnitude, optimizing port operations efficiency&#xD;
has become strategic for supply chain resilience. However, the recent period (2020–2025)&#xD;
was marked by a succession of disruptive events, including geopolitical crises along critical&#xD;
routes and climatic instability, which posed unprecedented challenges to port logistics.&#xD;
In this context, the Berth Allocation Problem (BAP), although well-established in the&#xD;
literature, demands new approaches that offer greater robustness to uncertainty. Classical&#xD;
optimization methodologies often exhibit scalability limitations and make simplifying&#xD;
assumptions that neglect the high dimensionality and operational volatility of real terminals.&#xD;
This thesis proposes a formulation of the BAP for dry bulk cargo, integrated with inventory&#xD;
control, and modeled under the Deep Reinforcement Learning (DRL) paradigm. The&#xD;
investigation initially employs the DQN (Deep Q-Network) algorithm. Subsequently, it&#xD;
evolves toward an architecture incorporating LSTM (Long Short-Term Memory) cells to&#xD;
capture the temporal dependencies inherent to complex sequential decision-making&#xD;
problems. The experimental results demonstrate that the proposed approach not only&#xD;
generates high-quality solutions in dynamic scenarios but also effectively mitigates&#xD;
inventory failures, surpassing the limitations of traditional heuristics.
Instituição: Universidade Federal do Maranhão
Tipo do documento: Tese</summary>
    <dc:date>2026-02-26T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Inserção colaborativa de camadas em redes stacked autoencoder</title>
    <link rel="alternate" href="https://tedebc.ufma.br/jspui/handle/tede/6958" />
    <author>
      <name>VIANA, Francisco dos Santos</name>
    </author>
    <id>https://tedebc.ufma.br/jspui/handle/tede/6958</id>
    <updated>2026-05-13T17:19:53Z</updated>
    <published>2026-03-27T00:00:00Z</published>
    <summary type="text">Título: Inserção colaborativa de camadas em redes stacked autoencoder
Autor: VIANA, Francisco dos Santos
Primeiro orientador: ALMEIDA NETO, Areolino de
Abstract: This work proposes an innovative method for the structured growth of deep neural networks&#xD;
of the stacked autoencoder type, aiming to overcome limitations of conventional network&#xD;
expansion approaches. Deep neural networks have proven highly effective in classification,&#xD;
pattern recognition, and automatic feature extraction tasks; however, defining appropriate&#xD;
topologies remains a challenge. In traditional methods, inserting new hidden layers during&#xD;
training often leads to an increase in output error and degradation of previously acquired&#xD;
knowledge, making the expansion process time-consuming and dependent on complex manual&#xD;
adjustments. The method developed in this research performs the parallel addition of a new&#xD;
hidden layer and a new output layer alongside the existing output layer. Unlike conventional&#xD;
approaches, the added layers create a new data flow toward the network output, forming an&#xD;
auxiliary processing branch in which the new layers learn without degrading previously acquired&#xD;
knowledge. As a result, the proposed insertion strategy collaborates with the existing layers,&#xD;
characterizing the method as collaborative. After insertion, an integration step is carried out&#xD;
in which the auxiliary branch and the original output layer are combined to consolidate the&#xD;
learning of the new layers. This ensures that the global network error exhibits a decreasing&#xD;
behavior while maintaining learning stability. At the end of the process, the previous output&#xD;
layer becomes part of the new hidden layer, forming a network with a single output layer. The&#xD;
proposed method was evaluated on different classification datasets, demonstrating its ability&#xD;
to preserve previously consolidated knowledge, consistently reduce output error, and maintain&#xD;
stability during network expansion. The results indicate that the method provides a robust&#xD;
alternative for the automatic expansion of adaptive neural networks, improving training time&#xD;
efficiency, reducing the need for manual adjustments, and promoting greater flexibility and&#xD;
reliability in classification and pattern recognition applications.
Instituição: Universidade Federal do Maranhão
Tipo do documento: Tese</summary>
    <dc:date>2026-03-27T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Segmentação automática do pâncreas e massas pancreáticas em tomografias computadorizadas usando arquiteturas encoder-decoder</title>
    <link rel="alternate" href="https://tedebc.ufma.br/jspui/handle/tede/6873" />
    <author>
      <name>ARAÚJO, Alexandre de Carvalho</name>
    </author>
    <id>https://tedebc.ufma.br/jspui/handle/tede/6873</id>
    <updated>2026-03-26T18:22:07Z</updated>
    <published>2025-09-29T00:00:00Z</published>
    <summary type="text">Título: Segmentação automática do pâncreas e massas pancreáticas em tomografias computadorizadas usando arquiteturas encoder-decoder
Autor: ARAÚJO, Alexandre de Carvalho
Primeiro orientador: ALMEIDA, João Dallyson Sousa de
Abstract: Cancer, the second leading cause of mortality worldwide, accounted for approximately&#xD;
10 million deaths in 2020. Although relatively rare compared to other malignancies,&#xD;
pancreatic cancer presents one of the poorest prognoses, with a mortality rate of approximately 98%, ranking among the highest across all cancer types. Early-stage detection&#xD;
is the most critical determinant of patient prognosis. However, early diagnosis is particularly challenging due to the difficulty in identifying small lesions in medical imaging&#xD;
modalities such as abdominal ultrasound, computed tomography (CT), and magnetic&#xD;
resonance imaging (MRI). These imaging techniques constitute the primary tools for&#xD;
early detection, and the accurate identification of small pancreatic lesions at early stages&#xD;
significantly improves clinical outcomes. Therefore, there is a pressing need for technologies that can augment and enhance image-based diagnostic workflows. In this&#xD;
work, two deep learning-based methods were developed: one for automatic pancreas&#xD;
segmentation and another for pancreatic mass segmentation in CT scans. The proposed pancreas segmentation approach integrates the EfficientNetB7 backbone within&#xD;
a U-Net architecture, achieving promising results, with a mean Dice similarity coefficient (DSC) of 85.39 ± 2.39% on the NIH dataset and 85.96 ± 2.08% on the MSD&#xD;
dataset. For pancreatic mass segmentation, an ensemble of five encoder-decoder architectures was employed: U-Net, FPN, LinkNet, EDU-Net, and ETDPU-Net. The first&#xD;
three utilize EfficientNetB7 as their encoder backbone. The latter two—EDU-Net and&#xD;
ETDPU-Net—were designed as part of this thesis and incorporate deformable convolutions and Squeeze-and-Excitation (SE) attention mechanisms to enhance feature&#xD;
representation. The outputs of all five models are aggregated using a majority voting ensemble strategy to surpass the performance of individual models. The proposed mass&#xD;
segmentation framework achieved a DSC of 65.28% ± 5.57% on the MSD dataset,&#xD;
validating the efficacy and robustness of the method.
Instituição: Universidade Federal do Maranhão
Tipo do documento: Tese; Trabalho sob Sigilo. Motivo: Resultados apresentados na Tese ainda não foram publicados. Data Provável de Liberação:  2 anos.</summary>
    <dc:date>2025-09-29T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Geração de documentos de design de jogos educacionais a partir de templates orientados ao Pensamento Computacional</title>
    <link rel="alternate" href="https://tedebc.ufma.br/jspui/handle/tede/6664" />
    <author>
      <name>CRUZ, Allan Kássio Beckman Soares da</name>
    </author>
    <id>https://tedebc.ufma.br/jspui/handle/tede/6664</id>
    <updated>2025-12-10T11:48:54Z</updated>
    <published>2025-10-15T00:00:00Z</published>
    <summary type="text">Título: Geração de documentos de design de jogos educacionais a partir de templates orientados ao Pensamento Computacional
Autor: CRUZ, Allan Kássio Beckman Soares da
Primeiro orientador: SOARES NETO, Carlos de Salles
Abstract: This thesis investigates how to support the authoring of educational games oriented&#xD;
to Computational Thinking by tightly linking pedagogical objectives, game mechanics,&#xD;
and assessability. It proposes the GDD2PC model, which makes explicit the correlation&#xD;
between Computational Thinking pillars (abstraction, algorithmic thinking, decomposition, and pattern recognition) and families of mechanics, and derives an operational&#xD;
Game Design Document template tailored to teaching practice, including a concise onepage format. Both were instantiated in the Hefesto Game Lab tool, designed to reduce&#xD;
authoring effort, standardize document quality, and preserve flexibility across educational&#xD;
contexts. The research followed a Design Science Research process: requirements&#xD;
elicitation, model and template construction, tool implementation, and user-oriented&#xD;
evaluation. Technology acceptance was assessed with the TAM, complemented by&#xD;
pedagogical alignment and applicability. Results show mean perceived usefulness&#xD;
around 4.0, perceived ease of use near 4.1, and behavioral intention at 3.8 on a&#xD;
1–5 Likert scale, with high instrument reliability (high Cronbach’s alpha). Evidence&#xD;
indicates that the approach reduces authoring ambiguity, speeds up iteration cycles, and&#xD;
strengthens alignment between Computational Thinking pillars and design decisions,&#xD;
contributing to a more efficient and replicable teaching practice.
Instituição: Universidade Federal do Maranhão
Tipo do documento: Tese</summary>
    <dc:date>2025-10-15T00:00:00Z</dc:date>
  </entry>
</feed>

