737 resultados para Sparse Incremental Em Algorithm
Resumo:
Successful management of rivers requires an understanding of the fluvial processes that govern them. This, in turn cannot be achieved without a means of quantifying their geomorphology and hydrology and the spatio-temporal interactions between them, that is, their hydromorphology. For a long time, it has been laborious and time-consuming to measure river topography, especially in the submerged part of the channel. The measurement of the flow field has been challenging as well, and hence, such measurements have long been sparse in natural environments. Technological advancements in the field of remote sensing in the recent years have opened up new possibilities for capturing synoptic information on river environments. This thesis presents new developments in fluvial remote sensing of both topography and water flow. A set of close-range remote sensing methods is employed to eventually construct a high-resolution unified empirical hydromorphological model, that is, river channel and floodplain topography and three-dimensional areal flow field. Empirical as well as hydraulic theory-based optical remote sensing methods are tested and evaluated using normal colour aerial photographs and sonar calibration and reference measurements on a rocky-bed sub-Arctic river. The empirical optical bathymetry model is developed further by the introduction of a deep-water radiance parameter estimation algorithm that extends the field of application of the model to shallow streams. The effect of this parameter on the model is also assessed in a study of a sandy-bed sub-Arctic river using close-range high-resolution aerial photography, presenting one of the first examples of fluvial bathymetry modelling from unmanned aerial vehicles (UAV). Further close-range remote sensing methods are added to complete the topography integrating the river bed with the floodplain to create a seamless high-resolution topography. Boat- cart- and backpack-based mobile laser scanning (MLS) are used to measure the topography of the dry part of the channel at a high resolution and accuracy. Multitemporal MLS is evaluated along with UAV-based photogrammetry against terrestrial laser scanning reference data and merged with UAV-based bathymetry to create a two-year series of seamless digital terrain models. These allow the evaluation of the methodology for conducting high-resolution change analysis of the entire channel. The remote sensing based model of hydromorphology is completed by a new methodology for mapping the flow field in 3D. An acoustic Doppler current profiler (ADCP) is deployed on a remote-controlled boat with a survey-grade global navigation satellite system (GNSS) receiver, allowing the positioning of the areally sampled 3D flow vectors in 3D space as a point cloud and its interpolation into a 3D matrix allows a quantitative volumetric flow analysis. Multitemporal areal 3D flow field data show the evolution of the flow field during a snow-melt flood event. The combination of the underwater and dry topography with the flow field yields a compete model of river hydromorphology at the reach scale.
Resumo:
Several methods are used to estimate anaerobic threshold (AT) during exercise. The aim of the present study was to compare AT obtained by a graphic visual method for the estimate of ventilatory and metabolic variables (gold standard), to a bi-segmental linear regression mathematical model of Hinkley's algorithm applied to heart rate (HR) and carbon dioxide output (VCO2) data. Thirteen young (24 ± 2.63 years old) and 16 postmenopausal (57 ± 4.79 years old) healthy and sedentary women were submitted to a continuous ergospirometric incremental test on an electromagnetic braking cycloergometer with 10 to 20 W/min increases until physical exhaustion. The ventilatory variables were recorded breath-to-breath and HR was obtained beat-to-beat over real time. Data were analyzed by the nonparametric Friedman test and Spearman correlation test with the level of significance set at 5%. Power output (W), HR (bpm), oxygen uptake (VO2; mL kg-1 min-1), VO2 (mL/min), VCO2 (mL/min), and minute ventilation (VE; L/min) data observed at the AT level were similar for both methods and groups studied (P > 0.05). The VO2 (mL kg-1 min-1) data showed significant correlation (P < 0.05) between the gold standard method and the mathematical model when applied to HR (r s = 0.75) and VCO2 (r s = 0.78) data for the subjects as a whole (N = 29). The proposed mathematical method for the detection of changes in response patterns of VCO2 and HR was adequate and promising for AT detection in young and middle-aged women, representing a semi-automatic, non-invasive and objective AT measurement.
Resumo:
We determined the response characteristics and functional correlates of the dynamic relationship between the rate (Δ) of oxygen consumption ( O2) and the applied power output (work rate = WR) during ramp-incremental exercise in patients with mitochondrial myopathy (MM). Fourteen patients (7 males, age 35.4 ± 10.8 years) with biopsy-proven MM and 10 sedentary controls (6 males, age 29.0 ± 7.8 years) took a ramp-incremental cycle ergometer test for the determination of the
O2 on-exercise mean response time (MRT) and the gas exchange threshold (GET). The Δ
O2/ΔWR slope was calculated up to GET (S1), above GET (S2) and over the entire linear portion of the response (S T). Knee muscle endurance was measured by isokinetic dynamometry. As expected, peak
O2 and muscle performance were lower in patients than controls (P < 0.05). Patients had significantly lower Δ
O2/ΔWR than controls, especially the S2 component (6.8 ± 1.5 vs 10.3 ± 0.6 mL·min-1·W-1, respectively; P < 0.001). There were significant relationships between Δ
O2/ΔWR (S T) and muscle endurance, MRT-
O2, GET and peak
O2 in MM patients (P < 0.05). In fact, all patients with Δ
O2/ΔWR below 8 mL·min-1·W-1 had severely reduced peak
O2 values (<60% predicted). Moreover, patients with higher cardiopulmonary stresses during exercise (e.g., higher Δ ventilation/carbon dioxide output and Δ heart rate/Δ
O2) had lower Δ
O2/ΔWR (P < 0.05). In conclusion, a readily available, effort-independent index of aerobic dysfunction during dynamic exercise (Δ
O2/ΔWR) is typically reduced in patients with MM, being related to increased functional impairment and higher cardiopulmonary stress.
Resumo:
Studies on the assessment of heart rate variability threshold (HRVT) during walking are scarce. We determined the reliability and validity of HRVT assessment during the incremental shuttle walk test (ISWT) in healthy subjects. Thirty-one participants aged 57 ± 9 years (17 females) performed 3 ISWTs. During the 1st and 2nd ISWTs, instantaneous heart rate variability was calculated every 30 s and HRVT was measured. Walking velocity at HRVT in these tests (WV-HRVT1 and WV-HRVT2) was registered. During the 3rd ISWT, physiological responses were assessed. The ventilatory equivalents were used to determine ventilatory threshold (VT) and the WV at VT (WV-VT) was recorded. The difference between WV-HRVT1 and WV-HRVT2 was not statistically significant (median and interquartile range = 4.8; 4.8 to 5.4 vs4.8; 4.2 to 5.4 km/h); the correlation between WV-HRVT1 and WV-HRVT2 was significant (r = 0.84); the intraclass correlation coefficient was high (0.92; 0.82 to 0.96), and the agreement was acceptable (-0.08 km/h; -0.92 to 0.87). The difference between WV-VT and WV-HRVT2 was not statistically significant (4.8; 4.8 to 5.4 vs 4.8; 4.2 to 5.4 km/h) and the agreement was acceptable (0.04 km/h; -1.28 to 1.36). HRVT assessment during walking is a reliable measure and permits the estimation of VT in adults. We suggest the use of the ISWT for the assessment of exercise capacity in middle-aged and older adults.
Resumo:
This study aimed to verify the association between the contribution of energy systems during an incremental exercise test (IET), pacing, and performance during a 10-km running time trial. Thirteen male recreational runners completed an incremental exercise test on a treadmill to determine the respiratory compensation point (RCP), maximal oxygen uptake (V˙O2max), peak treadmill speed (PTS), and energy systems contribution; and a 10-km running time trial (T10-km) to determine endurance performance. The fractions of the aerobic (WAER) and glycolytic (WGLYCOL) contributions were calculated for each stage based on the oxygen uptake and the oxygen energy equivalents derived by blood lactate accumulation, respectively. Total metabolic demand (WTOTAL) was the sum of these two energy systems. Endurance performance during the T10-km was moderately correlated with RCP, V˙O2maxand PTS (P<@0.05), and moderate-to-highly correlated with WAER, WGLYCOL, and WTOTAL (P<0.05). In addition, WAER, WGLYCOL, and WTOTAL were also significantly correlated with running speed in the middle (P<0.01) and final (P<0.01) sections of the T10-km. These findings suggest that the assessment of energy contribution during IET is potentially useful as an alternative variable in the evaluation of endurance runners, especially because of its relationship with specific parts of a long-distance race.
Resumo:
This work presents synopsis of efficient strategies used in power managements for achieving the most economical power and energy consumption in multicore systems, FPGA and NoC Platforms. In this work, a practical approach was taken, in an effort to validate the significance of the proposed Adaptive Power Management Algorithm (APMA), proposed for system developed, for this thesis project. This system comprise arithmetic and logic unit, up and down counters, adder, state machine and multiplexer. The essence of carrying this project firstly, is to develop a system that will be used for this power management project. Secondly, to perform area and power synopsis of the system on these various scalable technology platforms, UMC 90nm nanotechnology 1.2v, UMC 90nm nanotechnology 1.32v and UMC 0.18 μmNanotechnology 1.80v, in order to examine the difference in area and power consumption of the system on the platforms. Thirdly, to explore various strategies that can be used to reducing system’s power consumption and to propose an adaptive power management algorithm that can be used to reduce the power consumption of the system. The strategies introduced in this work comprise Dynamic Voltage Frequency Scaling (DVFS) and task parallelism. After the system development, it was run on FPGA board, basically NoC Platforms and on these various technology platforms UMC 90nm nanotechnology1.2v, UMC 90nm nanotechnology 1.32v and UMC180 nm nanotechnology 1.80v, the system synthesis was successfully accomplished, the simulated result analysis shows that the system meets all functional requirements, the power consumption and the area utilization were recorded and analyzed in chapter 7 of this work. This work extensively reviewed various strategies for managing power consumption which were quantitative research works by many researchers and companies, it's a mixture of study analysis and experimented lab works, it condensed and presents the whole basic concepts of power management strategy from quality technical papers.
Resumo:
Nowadays problem of solving sparse linear systems over the field GF(2) remain as a challenge. The popular approach is to improve existing methods such as the block Lanczos method (the Montgomery method) and the Wiedemann-Coppersmith method. Both these methods are considered in the thesis in details: there are their modifications and computational estimation for each process. It demonstrates the most complicated parts of these methods and gives the idea how to improve computations in software point of view. The research provides the implementation of accelerated binary matrix operations computer library which helps to make the progress steps in the Montgomery and in the Wiedemann-Coppersmith methods faster.
Resumo:
This thesis introduces the Salmon Algorithm, a search meta-heuristic which can be used for a variety of combinatorial optimization problems. This algorithm is loosely based on the path finding behaviour of salmon swimming upstream to spawn. There are a number of tunable parameters in the algorithm, so experiments were conducted to find the optimum parameter settings for different search spaces. The algorithm was tested on one instance of the Traveling Salesman Problem and found to have superior performance to an Ant Colony Algorithm and a Genetic Algorithm. It was then tested on three coding theory problems - optimal edit codes, optimal Hamming distance codes, and optimal covering codes. The algorithm produced improvements on the best known values for five of six of the test cases using edit codes. It matched the best known results on four out of seven of the Hamming codes as well as three out of three of the covering codes. The results suggest the Salmon Algorithm is competitive with established guided random search techniques, and may be superior in some search spaces.
Resumo:
Understanding the machinery of gene regulation to control gene expression has been one of the main focuses of bioinformaticians for years. We use a multi-objective genetic algorithm to evolve a specialized version of side effect machines for degenerate motif discovery. We compare some suggested objectives for the motifs they find, test different multi-objective scoring schemes and probabilistic models for the background sequence models and report our results on a synthetic dataset and some biological benchmarking suites. We conclude with a comparison of our algorithm with some widely used motif discovery algorithms in the literature and suggest future directions for research in this area.
Resumo:
DNA assembly is among the most fundamental and difficult problems in bioinformatics. Near optimal assembly solutions are available for bacterial and small genomes, however assembling large and complex genomes especially the human genome using Next-Generation-Sequencing (NGS) technologies is shown to be very difficult because of the highly repetitive and complex nature of the human genome, short read lengths, uneven data coverage and tools that are not specifically built for human genomes. Moreover, many algorithms are not even scalable to human genome datasets containing hundreds of millions of short reads. The DNA assembly problem is usually divided into several subproblems including DNA data error detection and correction, contig creation, scaffolding and contigs orientation; each can be seen as a distinct research area. This thesis specifically focuses on creating contigs from the short reads and combining them with outputs from other tools in order to obtain better results. Three different assemblers including SOAPdenovo [Li09], Velvet [ZB08] and Meraculous [CHS+11] are selected for comparative purposes in this thesis. Obtained results show that this thesis’ work produces comparable results to other assemblers and combining our contigs to outputs from other tools, produces the best results outperforming all other investigated assemblers.
Resumo:
Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.
Resumo:
Understanding the relationship between genetic diseases and the genes associated with them is an important problem regarding human health. The vast amount of data created from a large number of high-throughput experiments performed in the last few years has resulted in an unprecedented growth in computational methods to tackle the disease gene association problem. Nowadays, it is clear that a genetic disease is not a consequence of a defect in a single gene. Instead, the disease phenotype is a reflection of various genetic components interacting in a complex network. In fact, genetic diseases, like any other phenotype, occur as a result of various genes working in sync with each other in a single or several biological module(s). Using a genetic algorithm, our method tries to evolve communities containing the set of potential disease genes likely to be involved in a given genetic disease. Having a set of known disease genes, we first obtain a protein-protein interaction (PPI) network containing all the known disease genes. All the other genes inside the procured PPI network are then considered as candidate disease genes as they lie in the vicinity of the known disease genes in the network. Our method attempts to find communities of potential disease genes strongly working with one another and with the set of known disease genes. As a proof of concept, we tested our approach on 16 breast cancer genes and 15 Parkinson's Disease genes. We obtained comparable or better results than CIPHER, ENDEAVOUR and GPEC, three of the most reliable and frequently used disease-gene ranking frameworks.
Resumo:
In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank.
Resumo:
La psychopathie et le trouble de personnalité antisociale sont deux syndromes reliés qui ont été identifiés comme prédicteurs importants de comportements violents et de criminalité. Cependant, la recherche indique que les facteurs de la psychopathie centrés sur la personnalité ne sont pas des prédicteurs fiables de récidive violente chez les personnes atteintes de maladies mentales. Toutefois, peu d’études se sont centrées sur l’identification des facteurs associés au patron des antécédents criminels. Les 96 hommes de l’étude ont été déclarés non criminellement responsables en raison de troubles mentaux. Ils ont été évalués quant au trouble de la personnalité antisociale ainsi qu’à la psychopathie. Les dossiers criminels de la Gendarmerie Royale du Canada ont également été consultés afin de reconstituer l’histoire criminelle. Les résultats suggèrent que ni les traits de personnalité antisociaux, ni les facteurs de la psychopathie ne démontrent une validité prédictive incrémentielle les uns sur les autres quant au nombre ou à la sévérité des délits. La présence d’un grand nombre de traits antisociaux est associée à un plus grand nombre et à une plus importante sévérité d’actes criminels non-violents. Les résultats sont discutés en termes de l’utilité d’une classification du trouble de personnalité antisociale, et de la pertinence du construit de la psychopathie pour les personnes atteintes de maladies mentales graves.