A rainbow <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:math> -coloring of a<mml:math id="M2"><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:math>-connected graph<mml:math id="M3"><mml:mrow><mml:mi>G</mml:mi></mml:mrow></mml:math>is an edge coloring such that for any two distinct vertices<mml:math id="M4"><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:math>and<mml:math...

In 2020 Bang-Jensen et. al. generalized the Haj\'os join of two graphs to class digraphs and several results for vertex colorings in digraphs. Although, as a consequence these results, digraph can be obtained by constructions (directed identifying non-adjacent vertices), determining obtain is complex problem. particular, et posed problem operations construct symmetric 5-cycle from complete order 3 using only constructions. We successfully adapted rank-based genetic algorithm solve this...

In this paper, we explore the application of a particular genetic algorithm, Rank Genetic Algorithm (Rank GA), to address graph theory problem. The GA was introduced problem coloring, exploring into specialized field Chromatic Graph Theory. We successfully improved several previously known lower bounds. To validate effectiveness these new bounds, performed an analytical approximation, confirming their validity. findings underscore interdisciplinary impact use algorithms in theoretical...

The User Interface Transition Diagram (UITD) is a graphic notation designed to simplify the specification and design of system-user interactions without losing technical detail that necessary develop system. UITD aims be good communication tool between customers software developers. We present here specialized for editing Diagrams: editor. It provides functionalities edition properties in comparison with existing tools.

Abstract The User Interface Transition Diagram (UITD) is a simplified modeling notation to describe the transitions between UIs of software system. It designed be used for customer‐developer s improving models. This study investigates (i) which concepts UITD language are easy understand and ones require more effort understood (ii) what extent comprehensibility depends on user's programming skill level. A questionnaire was applied group 334 non‐developers after they received very brief...

In this paper, we presented a methodology that allows the simultaneous evolution of neuro-controllers for multiple car-like robots.The consists three modules: Evolutionary Algorithm module based on Rank Genetic to optimize weights robots' neuro-controllers, Robots Controllers Module Feedforward Neural Network, and Module, where TORCS robots simulator was used experiments.Since TORCS' characteristics are realistic enough, obtained results could provide insights applicable real autonomous...

Aplicamos una metodología que combina los Diagramas de Transiciones entre Interfaces Usuario (DTIU) y Secuencia Detallados (DSD) para construir tienda virtual libros, revistas, música películas. Los DTIU son diagramas permiten modelar la navegación las interfaces usuario un sistema, mientras DSD secuencia construidos bajo conjunto reglas hechas específicamente documentar el diseño detallado. Especificamos del por sistema mediante combinación bosquejos (IU) DTIU. se construyen haciendo...

The dichromatic number of a digraph $D$ is the minimum colors vertex coloring such that has no monochromatic cycles. Haj\'os join were recently extended to digraphs (using number) by J. Bang-Jensen et. al. and (directed) operations tool obtain r-(di)chromatic (di)graphs. posed in 2020 problem how symmetric cycle length 5 from cycles 3. We solved this applying genetic algorithm. In article, procedure presented construct any odd directed 3, thus, generalizing known construction 5. addition,...

The User Interface Transition Diagram (UITD) is a formal modeling notation that simplifies the specification and design of user-system interactions. It valuable communication tool for technical non-technical stakeholders during requirements elicitation phase, as it provides simple yet technically complete easy to understand. In this paper, we investigated efficiency creating UITDs using draw.io, widely used diagramming software, compared dedicated UITD editor. We conducted study compare time...

The dichromatic number of a digraph D is the minimum colors vertex coloring such that has no monochromatic cycles, an extension chromatic to class digraphs. Hajós join tool obtain r-chromatic graphs, using number, J. Bang-Jensen et. al. extended digraphs, and thus obtained r-dichromatic posed in 2020 problem how symmetric cycle length 5 from cycles 3. We recently solved this by applying genetic algorithm. In article, we generalize construction determine computational complexity as Θ(n ln(n)).

This paper presents a case study where the interdisciplinary approach between artificial intelligence, specifically genetic algorithms, and discrete mathematics has been instrumental in verifying conjecture graph theory. The focus of our research lies Minimum Dominating Set (MDS) problem, which involves identifying dominating set with minimum cardinality for given graph. While previous works have primarily aimed at utilizing algorithms to efficiently find satisfactory solutions MDS aims...

Over the past decade, convolutional neural networks (CNNs) have become driving force of an ever-increasing set applications, achieving state-of-the-art performance. Most modern CNN architectures are composed many and fully connected layers typically require thousands or millions parameters to learn. CNNs also been effective in detection Event-Related Potentials from electroencephalogram (EEG) signals, notably P300 component which is frequently employed Brain-Computer Interfaces (BCIs)....

QualiTeam is a web application to support the teaching-learning process on Software Quality Assurance, Control and Testing introductory concepts. It has two main objectives: facilitate understanding of concepts learned in theory monitoring SW projects that students develop. The system gives teacher control guide activities must be carried out throughout software project development. tool conceived help challenge providing with concrete examples which they can practice clarify topics taught...

In 2020 Bang-Jensen et. al. generalized the Hajós join of two graphs to class digraphs and several results for vertex colorings in digraphs. Although, as a consequence these results, digraph can be obtained by constructions (directed identifying non-adjacent vertices), determining obtain is complex problem. particular, et posed problem operations construct symmetric 5-cycle from complete order 3 using only constructions. We successfully adapted rank-based genetic algorithm solve this...

In this work we revisit the known problem of lack well-defined semantics, at implementation level, for association and aggregation relationships in class diagrams to hypothesize that, context software development, there is a better understanding associations between classes when omitting aggregation. We conducted an experimental study which questionnaire was applied 100 subjects, 50 test group control group. The obtained responses were analyzed with statistical methods. From our results...