<p dir="ltr">Technological advancements in the semiconductor industry have led to the development of fast, low-power, and high-performance electronic devices. With evolving process technologies, the size of an electronic device has greatly reduced, and the number of features a single device can support has steadily increased. To achieve this, billions of transistors are integrated into small electronic chips leading to an increase in the complexity of manufacturing processes. Electronic chips that are manufactured using such complex manufacturing processes are prone to have a large number of defects that are difficult to test, and cause reliability issues. To tackle these issues and produce highly reliable chips, there is a growing need to test each manufactured chip thoroughly. This requires the application of a large number of tests by a tester. The cost of testing an electronic chip primarily depends on the storage requirements of the tester, and the test application time required. The large number of tests required to rigorously test each chip leads to an increase in the testing cost. Earlier works reduced the testing cost by reducing the input storage requirements of the tester. The input storage requirements are reduced by using each stored test on the tester to apply several different tests to the circuit. Several different tests are also applied based on each stored test to improve the quality of a test set. The goal of this thesis is to aide in producing reliable chips, by creating test sets that can detect faults from different fault models. The test sets are created by improving the quality of a test set. </p><p><br></p><p dir="ltr">First, test sets with low storage requirements are produced for defect detection. A base test set is generated and stored. Each stored test is perturbed to produce several different tests. Algorithms are then described in two different scenarios to select a subset of the perturbed tests. The selected subset of tests improves the quality of defect detection with a minimal increase in the input storage requirements.</p><p><br></p><p dir="ltr">Next, test sets with low-storage requirements are produced for defect diagnosis. A fault detection test set is generated and stored. Each stored test is perturbed to produce several different tests. A procedure is then described to select a subset of the perturbed tests to be used as diagnostic tests. The diagnostic test set selected improves the quality of defect diagnosis with a minimal increase in the input storage requirements.</p><p><br></p><p dir="ltr">Finally, storage-aware test sets are produced targeting several fault models in two steps. In the first step, tests in a base test set are replaced with improved tests to produce an improved test set. The improved test set is stored, and it improves the quality of defect detection with no increase in the storage requirements. In the second step, each improved test is perturbed to produce several different tests. A procedure is then described to select a subset of the perturbed tests. The selected subset of tests further improves the quality of defect detection with a minimal increase in the input storage requirements.</p>

There are some systems (or parts of systems) that are very critical and need especially good test suites to test them. For these critical systems, exhaustive testing may be a good way to test them. Thus, we have implemented two versions of bounded exhaustive search (BES) algorithms in a model-based testing tool called, Modbat. One of the BES versions (BESnL) visits each self-loop in the model only once. The other version (BESL) has no constraint or limitation on the number of time it visits each self-loop. We have then compared the two BES algorithms with each other and with an already implemented algorithm in Modbat called random search (RS). We have run the three mentioned algorithms (BESL, BESnL and RS) on five different models and compared their performance on these models in terms of time, coverage and finding faults. We have found that BESnL is faster than BESL and it can miss some faults that BESL can find. However, BESnL can find errors faster than BESL. BESL has sometimes better performance than BESnL in terms of branch coverage. In terms of other coverage criteria (like state coverage, transition coverage and instruction coverage), both BESL and BESnL has very similar performance. We have also found that running the RS algorithm is, in general, faster than both BES algorithms at generating tests (given the same total number of tests generated) if the model has a clear end state. RS may also be faster at finding faults than the BES algorithms. However, The BES algorithms and the RS algorithm have similar behaviours regarding coverage. Nevertheless, RS can sometimes reach higher coverage faster than the BES algorithms and with a smaller number of tests. / Det finns vissa system (eller delar av system) som är mycket essentiella och som behöver särskilt bra testsviter för att testa dem. För dessa essentiella system kan uttömmande tester vara ett bra sätt att testa dem. Således har vi implementerat två versioner av begränsad uttömmande sökning eller på engelska ”bounded exhuastive search” (BES) algoritmer i ett modellbaserat testverktyg kallat Modbat. En av BES-versionerna (BESnL) besöker varje självslinga i modellen bara en gång. Den andra versionen (BESL) har ingen begränsning av hur många gånger den besöker varje självslinga. Vi har sedan jämfört de två BES-algoritmerna med varandra och med en redan implementerad algoritm i Modbat som kallas slumpmässig sökning eller på engelska ”random search” (RS). Vi har kört de tre nämnda algoritmerna (BESL, BESnL och RS) på fem olika modeller och jämfört deras prestanda på dessa modeller när det gäller tid, täckning (coverage) och att hitta fel. Vi har funnit att BESnL är snabbare än BESL och det kan missa några fel som BESL kan hitta, men BESnL kan hitta fel snabbare än BESL. BESL har ibland bättre prestanda än BESnL när det gäller filialtäckning (branch-coverage). När det gäller andra täckningskriterier (som statlig täckning, övergångstäckning (tranintion-coverage) och instruktionstäckning) har både BESL och BESnL mycket liknande resultat. Vi har också funnit att körning av RS-algoritmen i allmänhet är snabbare än båda BES- algoritmerna vid generering av tester (givet samma totala antal genererade tester) om modellen har ett klart slutläge (end-state). RS kan också vara snabbare att hitta fel än BES-algoritmerna. BES-algoritmerna och RS-algoritmen har dock liknande beteenden när det gäller täckning. RS kan ibland nå högre täckning snabbare än BES-algoritmerna och med ett mindre antal tester.

Ce travail a pour objectif de développer un outil analytique multi-physiques de dimensionnement d’une gamme de moteurs « hybrides » à démarrage direct, intégrant les avantages des deux technologies : l’auto-démarrage de la technologie asynchrone et les bonnes performances énergétique en régime permanent de la technologie synchrone à aimants permanents en répondant aux nouveaux enjeux d’efficacité énergétique et en ajoutant à cela les aspects économiques.La validation de cet outil est effectuée par des modèles éléments finis créés avec un logiciel commercial ANSYS/Maxwell et par des essais expérimentaux réalisés à l’aide de deux prototypes LSPMSM 7.5kW. / This work aims to develop a multi-physical generic model (and a pre-design software) for a range of LSPMSMs which would integrate the advantages of both technologies: self-start asynchronous technology and good energy performance of synchronous permanent magnet technology. The validation of this model is carried out by finite element commercial software ANSYS / Maxwell and by experimental tests using two 7.5kW.LSPMSM prototypes.

O presente trabalho apresenta a identificação de parâmetros de motor de indução linear tubular para a extração de petróleo, denominado de MATÆOS -- Motor Assíncrono Tubular para Aplicação na Extração de Óleo Subterrâneo. O primeiro passo para a identificação de parâmetros do motor foi a implementação da bancada de testes com o seu sistema de controle e supervisório. O modelo adotado corresponde à situação de operação em regime estacionário e consiste no circuito contendo resistores e indutores tradicionalmente utilizado para representar motores de indução. A identificação dos parâmetros foi realizada por meio de um procedimento de otimização tomando por base o balanço de potência do motor. Para isso, em função dos parâmetros do modelo, definiu-se e minimizou-se uma medida de erro entre as potências medidas e as calculadas pelo modelo para um conjunto pré-fixado de escorregamentos. A solução desse problema de otimização foi obtida por meio de uma busca exaustiva, uma vez que o número de variáveis independentes do problema é pequeno e uma região contendo o ponto de mínimo é conhecida com razoável confiança. Os resultados obtidos indicam que os valores dos parâmetros nominais a quente apresentam algumas diferenças em relação àqueles produzidos pelo método de identificação. Essas diferenças se devem possivelmente a variações nas características térmicas do motor e a erros introduzidos pelos instrumentos de medida. O modelo identificado apresentou uma menor disponibilidade de força e um pior rendimento quando comparado com os valores de projeto do modelo nominal a quente. Apesar disto, verificou-se uma boa proximidade entre a curva característica do modelo e as obtidas experimentalmente. / This work presents the identification of parameters of the tubular linear induction motor for the extraction of oil, called MATÆOS - which is the Portuguese acronym for Asynchronous Tubular Motor for Application to Subterranean Oil Extraction. The first step to the identification of the motor parameters was the implementation of the supervisory and control system for the test bench. The model, which is the usual one containing resistors and inductors, represents the motor operating in steady-state. The parameter identification problem was written as an optimization problem based on the motor power balance. An error between the measured power and the one given by the model was defined and minimized with respect to the model parameters in correspondence to a given set of slipping frequencies. The numerical solution to this problem was obtained by an exhaustive search algorithm. This choice was made because the number of independent variables is small and a region containing the solution is known with a significant degree of confidence. The results obtained show that the nominal values of the model parameters differ slightly from those produced by the identification method. Possibly, such differences are due to the variations in the model caused by temperature changes and to the measurement errors. The identified model presented both a lower available force and a worst efficiency when compared to the nominal design values for the warm motor. Despite this the characteristic curve of the model was quite close to the nominal design one.

Network lifetime is a key issue in wireless sensor networks where sensor nodes, distributed typically in remote/hostile sensing areas, are powered by finite energy batteries which are not easily replaced/recharged. Depletion of these finite energy batteries can result in a change in network topology or in the end of network life itself. Hence, prolonging the life of wireless sensor networks is important. Energy consumed in wireless sensor nodes can be for the purpose of i) sensing functions, ii) processing/computing functions, and ii) communication functions. For example, energy consumed by the transmit and receive electronics constitute the energy expended for communication functions. Our focus in this thesis is on the efficient use of energy for sensing. In particular, we are concerned with energy efficient algorithms for scheduling the sensing activity of sensor nodes. By scheduling the sensing activity we mean when to activate a sensor node for sensing (active mode) and when to keep it idle (sleep mode). The novel approach we adopt in this thesis to achieve efficient scheduling of sensing activity is an information coverage approach, rather than the widely adopted physical coverage approach. In the physical coverage approach, a point is said to be covered by a sensor node if that point lies within the physical coverage range (or the sensing radius) of that sensor, which is the maximum distance between the sensor and the point up to which the sensor can sense with acceptable accuracy. Information coverage, on the other hand, exploits cooperation among multiple sensors to accurately sense a point even if that point falls outside the physical coverage range of all the sensors. In this thesis, we address the question of how to schedule the activity of various sensor nodes in the network to enhance network lifetime using information coverage. In the first part of the thesis, we are concerned with scheduling of sensor nodes for sensing point targets using information coverage – example of a point-target being temperature or radiation level at a source or point that needs to be monitored. Defining a set of sensor nodes which collectively can sense a point-target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of Information Covers (DSIC) that can sense multiple point-targets in a given sensing area. Being disjoint, the resulting information covers in the proposed algorithm allow a simple round-robin schedule of sensor activation (i.e., activate the covers sequentially). We show that the covers obtained using the proposed DSIC algorithm achieve longer network life compared to the covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms. In the second part of the thesis, we extend the point target sensing problem in the first part to a full area sensing problem, where we are concerned with energy efficient ‘area-monitoring’ using information coverage. We refer to any set of sensors that can collectively sense all points in the entire area-to-monitor as a full area information cover. We first propose a low-complexity heuristic algorithm to obtain full area information covers. Using these covers, we then obtain the optimum schedule for activating the sensing activity of various sensors that maximizes the sensing lifetime. The optimum schedules obtained using the proposed algorithm is shown to achieve significantly longer sensing lifetimes compared to those achieved using physical coverage. Relaxing the full area coverage requirement to a partial area coverage requirement (e.g., 95% of area coverage as adequate instead of 100% area coverage) further enhances the lifetime. The algorithms proposed for the point targets and full area sensing problems in the first two parts are essentially centralized algorithms. Decentralized algorithms are preferred in large networks. Accordingly, in the last part of the thesis, we propose a low-complexity, distributed sensor scheduling algorithm for full area sensing using information coverage. This distributed algorithm is shown to result in significantly longer sensing lifetimes compared to those achieved using physical coverage.

Road network of a region is of a paramount importance in the overall development. Management of road traffic is a key factor for the city authority and reducing the road traffic congestion is a significant challenge in this perspective. In this thesis, a Wireless Sensor Network (WSN) based road-traffic monitoring scheme with dynamic mathematical traffic model is presented that will not necessarily include all adjacent intersections of a block; rather the important major intersections of a city. The objective of this scheme is to reduce the congestion by re-routing the vehicles to better performing road-segments by informing the down-stream drivers through broadcasting the congestion information in a dedicated radio channel. The dynamic model can provide with the instantaneous status of the traffic of the road-network. The scheme is a WSN based multi-hop relay network with hierarchical architecture and composed of ordinary nodes, Cluster-Head nodes, Base Stations, Gateway nodes and Monitoring and Control Centers (MCC) etc. Through collecting the traffic information, MCC will check the congestion status and in defining the congestion, threshold factors have been used in this model. For the congested situation of a road-segment, a cost function has been defined as a performance indicator and estimated using the weight factors (importance) of these selected intersections. This thesis considered a traffic network with twelve major intersections of a city with four major directions. Traffic arrivals in these intersections are assumed to follow Poisson distribution. Model was simulated in Matlab with traffic generated through Poisson Random Number Generator and cost function was estimated for the congestion status of the road-segments over a simulation period of 1440 minutes starting from midnight. For optimization purpose we adopted two different approaches; in the first approach, performance of the scheme was evaluated for all threshold factor values iteratively one at a time, applying a threshold factor value to define threshold capacities of all the road segments; traffic was generated and relative cost has been estimated following the model specifications with the purpose of congestion avoidance. In the second approach, different values of threshold factor have been used for different road segments for determining the optimum set-up, and exhaustive search technique has been applied with a smaller configuration in order to keep computations reachable. Simulation results show the capacity of this scheme to improve the traffic performance by reducing the congestion level with low congestion costs.

O presente trabalho apresenta a identificação de parâmetros de motor de indução linear tubular para a extração de petróleo, denominado de MATÆOS -- Motor Assíncrono Tubular para Aplicação na Extração de Óleo Subterrâneo. O primeiro passo para a identificação de parâmetros do motor foi a implementação da bancada de testes com o seu sistema de controle e supervisório. O modelo adotado corresponde à situação de operação em regime estacionário e consiste no circuito contendo resistores e indutores tradicionalmente utilizado para representar motores de indução. A identificação dos parâmetros foi realizada por meio de um procedimento de otimização tomando por base o balanço de potência do motor. Para isso, em função dos parâmetros do modelo, definiu-se e minimizou-se uma medida de erro entre as potências medidas e as calculadas pelo modelo para um conjunto pré-fixado de escorregamentos. A solução desse problema de otimização foi obtida por meio de uma busca exaustiva, uma vez que o número de variáveis independentes do problema é pequeno e uma região contendo o ponto de mínimo é conhecida com razoável confiança. Os resultados obtidos indicam que os valores dos parâmetros nominais a quente apresentam algumas diferenças em relação àqueles produzidos pelo método de identificação. Essas diferenças se devem possivelmente a variações nas características térmicas do motor e a erros introduzidos pelos instrumentos de medida. O modelo identificado apresentou uma menor disponibilidade de força e um pior rendimento quando comparado com os valores de projeto do modelo nominal a quente. Apesar disto, verificou-se uma boa proximidade entre a curva característica do modelo e as obtidas experimentalmente. / This work presents the identification of parameters of the tubular linear induction motor for the extraction of oil, called MATÆOS - which is the Portuguese acronym for Asynchronous Tubular Motor for Application to Subterranean Oil Extraction. The first step to the identification of the motor parameters was the implementation of the supervisory and control system for the test bench. The model, which is the usual one containing resistors and inductors, represents the motor operating in steady-state. The parameter identification problem was written as an optimization problem based on the motor power balance. An error between the measured power and the one given by the model was defined and minimized with respect to the model parameters in correspondence to a given set of slipping frequencies. The numerical solution to this problem was obtained by an exhaustive search algorithm. This choice was made because the number of independent variables is small and a region containing the solution is known with a significant degree of confidence. The results obtained show that the nominal values of the model parameters differ slightly from those produced by the identification method. Possibly, such differences are due to the variations in the model caused by temperature changes and to the measurement errors. The identified model presented both a lower available force and a worst efficiency when compared to the nominal design values for the warm motor. Despite this the characteristic curve of the model was quite close to the nominal design one.

Road network of a region is of a paramount importance in the overall development. Management of road traffic is a key factor for the city authority and reducing the road traffic congestion is a significant challenge in this perspective. In this thesis, a Wireless Sensor Network (WSN) based road-traffic monitoring scheme with dynamic mathematical traffic model is presented that will not necessarily include all adjacent intersections of a block; rather the important major intersections of a city. The objective of this scheme is to reduce the congestion by re-routing the vehicles to better performing road-segments by informing the down-stream drivers through broadcasting the congestion information in a dedicated radio channel. The dynamic model can provide with the instantaneous status of the traffic of the road-network. The scheme is a WSN based multi-hop relay network with hierarchical architecture and composed of ordinary nodes, Cluster-Head nodes, Base Stations, Gateway nodes and Monitoring and Control Centers (MCC) etc. Through collecting the traffic information, MCC will check the congestion status and in defining the congestion, threshold factors have been used in this model. For the congested situation of a road-segment, a cost function has been defined as a performance indicator and estimated using the weight factors (importance) of these selected intersections. This thesis considered a traffic network with twelve major intersections of a city with four major directions. Traffic arrivals in these intersections are assumed to follow Poisson distribution. Model was simulated in Matlab with traffic generated through Poisson Random Number Generator and cost function was estimated for the congestion status of the road-segments over a simulation period of 1440 minutes starting from midnight. For optimization purpose we adopted two different approaches; in the first approach, performance of the scheme was evaluated for all threshold factor values iteratively one at a time, applying a threshold factor value to define threshold capacities of all the road segments; traffic was generated and relative cost has been estimated following the model specifications with the purpose of congestion avoidance. In the second approach, different values of threshold factor have been used for different road segments for determining the optimum set-up, and exhaustive search technique has been applied with a smaller configuration in order to keep computations reachable. Simulation results show the capacity of this scheme to improve the traffic performance by reducing the congestion level with low congestion costs.

Estudos epidemiológicos vêm demonstrando que quantidades apropriadas de atividade física regular estão associadas a significativa redução do risco para o desenvolvimento de câncer de cólon em até 40% entre os indivíduos mais fisicamente ativos. Por outro lado, tem sido observado que o exercício físico exaustivo aumenta a produção sistêmica de radicais livres, com concomitante aumento dos danos oxidativos ao DNA, além de deprimir a função imune global, eventos relacionados ao aumento do risco para o desenvolvimento de câncer. Relativamente, poucos estudos experimentais exploram essas relações, principalmente no que concerne ao exercício exaustivo e o câncer. A taxa de proliferação celular epitelial, os focos de criptas aberrantes (FCAs) e as criptas com acúmulo de beta-catenina (CABC) têm sido marcadores biológicos (biomarcadores) usados para a identificação precoce de fatores que poderiam influenciar a carcinogênese colônica em ratos. Através da aplicação do carcinógeno químico 1,2dimetilhidrazina (DMH), logo após os protocolos de exercício, foram estudados quatro grupos principais de ratos previamente sedentários (grupo-controle, e três grupos submetidos, respectivamente, ao treinamento crônico de natação, à natação até a exaustão, e à natação até a exaustão após treinamento crônico), sendo sacrificados quinze dias após a injeção da DMH. Após análise histológica e imunohistoquímica, os biomarcadores estudados mostraram resultados coerentes nas diferentes situações experimentais aferidas. Foi observada uma diminuição estatisticamente significante da resposta hiperproliferativa, do número de FCAs e de CABC no grupo que realizou o treinamento crônico, enquanto o grupo submetido ao exercício exaustivo apresentou aumento estatisticamente significante dos parâmetros citados, quando comparados ao grupo-controle. No grupo submetido à associação dos dois protocolos de exercício, quando comparado ao grupo-controle, não houve alterações significantes nos biomarcadores de transformação neoplásica estudados. Nesse estudo experimental, o treinamento físico crônico teve efeito protetor contra o desenvolvimento dos biomarcadores precoces de transformação neoplásica do cólon, enquanto o exercício físico exaustivo aumentou a prevalência destes em ratos sedentários. O treinamento físico crônico, quando associado ao exercício físico exaustivo, não alterou a prevalência dos biomarcadores estudados. Desse achado, acrescido do que se pode encontrar na literatura científica atual, levanta-se a hipótese de que, de maneira similar à relação entre exercício físico e infecções, também o exercício poderia ou proteger contra o desenvolvimento, ou aumentar o risco para o câncer, dependendo do tipo, intensidade e duração da atividade desenvolvida. / Ephitelial cell proliferation, aberrant crypt foci (ACF) and â-catenin-accumulated crypts (BCAC) have been used for early detection of factors that influence colorectal carcinogenesis in rats. It has been observed that moderate and regular physical activity may prevent colon cancer up to 40% in humans. However, exhaustive exercise increases free radical DNA oxidative damage and depresses immune function, events also related to the increased risk for cancer development. Fifteen days after either a single exhaustive swimming bout or a swimming physical training for 8 weeks, or both, in untrained rats treated with a colon carcinogen, we observed a statistically significant decreased number of those biomarkers in rats under training protocol, and a statistically significant increased number of them in rats under exhaustive protocol, when compared to the non-exercised group. For the rats under exhaustive protocol after being trained, data was not evident. Thus, we concluded that training protected against the biomakers development and exhaustive exercise improved colorectal carcinogenesis biomarkers development in sedentary rats. From our finding and literature data, we hypothesize that, similarly to the suggested relationship between exercise and infections, exercise could be protective against cancer or it could increase the risk for this disease depending on its type, dose and duration.

Estudos epidemiológicos vêm demonstrando que quantidades apropriadas de atividade física regular estão associadas a significativa redução do risco para o desenvolvimento de câncer de cólon em até 40% entre os indivíduos mais fisicamente ativos. Por outro lado, tem sido observado que o exercício físico exaustivo aumenta a produção sistêmica de radicais livres, com concomitante aumento dos danos oxidativos ao DNA, além de deprimir a função imune global, eventos relacionados ao aumento do risco para o desenvolvimento de câncer. Relativamente, poucos estudos experimentais exploram essas relações, principalmente no que concerne ao exercício exaustivo e o câncer. A taxa de proliferação celular epitelial, os focos de criptas aberrantes (FCAs) e as criptas com acúmulo de beta-catenina (CABC) têm sido marcadores biológicos (biomarcadores) usados para a identificação precoce de fatores que poderiam influenciar a carcinogênese colônica em ratos. Através da aplicação do carcinógeno químico 1,2dimetilhidrazina (DMH), logo após os protocolos de exercício, foram estudados quatro grupos principais de ratos previamente sedentários (grupo-controle, e três grupos submetidos, respectivamente, ao treinamento crônico de natação, à natação até a exaustão, e à natação até a exaustão após treinamento crônico), sendo sacrificados quinze dias após a injeção da DMH. Após análise histológica e imunohistoquímica, os biomarcadores estudados mostraram resultados coerentes nas diferentes situações experimentais aferidas. Foi observada uma diminuição estatisticamente significante da resposta hiperproliferativa, do número de FCAs e de CABC no grupo que realizou o treinamento crônico, enquanto o grupo submetido ao exercício exaustivo apresentou aumento estatisticamente significante dos parâmetros citados, quando comparados ao grupo-controle. No grupo submetido à associação dos dois protocolos de exercício, quando comparado ao grupo-controle, não houve alterações significantes nos biomarcadores de transformação neoplásica estudados. Nesse estudo experimental, o treinamento físico crônico teve efeito protetor contra o desenvolvimento dos biomarcadores precoces de transformação neoplásica do cólon, enquanto o exercício físico exaustivo aumentou a prevalência destes em ratos sedentários. O treinamento físico crônico, quando associado ao exercício físico exaustivo, não alterou a prevalência dos biomarcadores estudados. Desse achado, acrescido do que se pode encontrar na literatura científica atual, levanta-se a hipótese de que, de maneira similar à relação entre exercício físico e infecções, também o exercício poderia ou proteger contra o desenvolvimento, ou aumentar o risco para o câncer, dependendo do tipo, intensidade e duração da atividade desenvolvida. / Ephitelial cell proliferation, aberrant crypt foci (ACF) and â-catenin-accumulated crypts (BCAC) have been used for early detection of factors that influence colorectal carcinogenesis in rats. It has been observed that moderate and regular physical activity may prevent colon cancer up to 40% in humans. However, exhaustive exercise increases free radical DNA oxidative damage and depresses immune function, events also related to the increased risk for cancer development. Fifteen days after either a single exhaustive swimming bout or a swimming physical training for 8 weeks, or both, in untrained rats treated with a colon carcinogen, we observed a statistically significant decreased number of those biomarkers in rats under training protocol, and a statistically significant increased number of them in rats under exhaustive protocol, when compared to the non-exercised group. For the rats under exhaustive protocol after being trained, data was not evident. Thus, we concluded that training protected against the biomakers development and exhaustive exercise improved colorectal carcinogenesis biomarkers development in sedentary rats. From our finding and literature data, we hypothesize that, similarly to the suggested relationship between exercise and infections, exercise could be protective against cancer or it could increase the risk for this disease depending on its type, dose and duration.