Dissertations / Theses on the topic 'Bounded jumps'
To see the other types of publications on this topic, follow the link: Bounded jumps.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 38 dissertations / theses for your research on the topic 'Bounded jumps.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Cadotte, Patrick. "Robust bounded-input bounded-output stability of systems." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100331.
Full textAbstract:
Two research problems involving the class of discrete-time signals bounded in magnitude are addressed in this thesis. The first problem concerns robust stability of systems with repeated, structured, linear time-varying, and induced-ℓinfinity-norm bounded perturbations. The second problem consists in the design of an ℓ₁-optimal controller that allows for flexible management of the tradeoff between the ability of a system to attenuate disturbance signals versus its expected worst peak-to-peak amplification. Original solutions to both problems are provided and their efficiency is assessed with examples and applications.
2
Jalalzai, Khalid. "Regularization of inverse problems in image processing." Phd thesis, Ecole Polytechnique X, 2012. http://pastel.archives-ouvertes.fr/pastel-00787790.
Full textAbstract:
Les problèmes inverses consistent à retrouver une donnée qui a été transformée ou perturbée. Ils nécessitent une régularisation puisque mal posés. En traitement d'images, la variation totale en tant qu'outil de régularisation a l'avantage de préserver les discontinuités tout en créant des zones lisses, résultats établis dans cette thèse dans un cadre continu et pour des énergies générales. En outre, nous proposons et étudions une variante de la variation totale. Nous établissons une formulation duale qui nous permet de démontrer que cette variante coïncide avec la variation totale sur des ensembles de périmètre fini. Ces dernières années les méthodes non-locales exploitant les auto-similarités dans les images ont connu un succès particulier. Nous adaptons cette approche au problème de complétion de spectre pour des problèmes inverses généraux. La dernière partie est consacrée aux aspects algorithmiques inhérents à l'optimisation des énergies convexes considérées. Nous étudions la convergence et la complexité d'une famille récente d'algorithmes dits Primal-Dual.
3
Schilling, René L., and Toshihiro Uemura. "On the Structure of the Domain of a Symmetric Jump-type Dirichlet Form." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-145198.
Full textAbstract:
We characterize the structure of the domain of a pure jump-type Dirichlet form which is given by a Beurling–Deny formula. In particular, we obtain su cient conditions in terms of the jumping kernel guaranteeing that the test functions are a core for the Dirichlet form and that the form is a Silverstein extension. As an application we show that for recurrent Dirichlet forms the extended Dirichlet space can be interpreted in a natural way as a homogeneous Dirichlet space. For reflected Dirichlet spaces this leads to a simple purely analytic proof that the active reflected Dirichlet space (in the sense of Chen, Fukushima and Kuwae) coincides with the extended active reflected Dirichlet spaceDieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich
4
Vrljicak, Tomislav. "Reinforcement learning in stochastic games against bounded memory opponents." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=98512.
Full textAbstract:
Learning to play in the presence of independent and self-motivated opponents is a difficult task, because the dynamics of the environment appear to be non-stationary. In recent years there has been considerable amount of research in the field of Multi-Agent Learning, and some of this work has been in the context of Reinforcement Learning. One commonly used approach has been to restrict the opponent to a class of computationally bounded players, creating a parametrized model of it, and then search the model that can best explain the observed opponent behavior. In this thesis we study the problem of Reinforcement Learning in Stochastic Games, and propose two models for the opponent and two search algorithms, one based on Tests of Significance and the other on Maximum a Posteriori probabilities. We integrate the modeled opponent into a Markovian environment, and present an algorithm for solving the resulting MDP. Finally, we perform experiments on the effectiveness of the search algorithms.
5
Schilling, René L., and Toshihiro Uemura. "On the Structure of the Domain of a Symmetric Jump-type Dirichlet Form." EMS Publishing House, 2012. https://tud.qucosa.de/id/qucosa%3A28135.
Full textAbstract:
We characterize the structure of the domain of a pure jump-type Dirichlet form which is given by a Beurling–Deny formula. In particular, we obtain su cient conditions in terms of the jumping kernel guaranteeing that the test functions are a core for the Dirichlet form and that the form is a Silverstein extension. As an application we show that for recurrent Dirichlet forms the extended Dirichlet space can be interpreted in a natural way as a homogeneous Dirichlet space. For reflected Dirichlet spaces this leads to a simple purely analytic proof that the active reflected Dirichlet space (in the sense of Chen, Fukushima and Kuwae) coincides with the extended active reflected Dirichlet space.Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich.
6
Sababheh, Mohammad Suboh. "Constructions of bounded functions related to two-sided Hardy inequalities." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=102160.
Full textAbstract:
We investigate inequalities that can be viewed as generalizations of Hardy's inequality about the Fourier coefficients of a function analytic on the circle. The proof of the Littlewood conjecture opened a wide door in front of questions regarding possible generalizations of Hardy's inequality. The proof of the Littlewood conjecture was based on some constructions of bounded functions having particular properties.In 1993, I. Klemes investigated one of the constructions (we shall call it the algebraic construction) and proved what is called a mixed norm generalization of Hardy's inequality. It turns out that we can work with the same construction and examine more properties of it in order to get more results.
The objectives of the thesis are to give more detailed properties of the algebraic construction and to use these properties in order to prove various versions of two-sided Hardy inequalities.
7
Noel, Jonathan. "Choosability of graphs with bounded order: Ohba's conjecture and beyond." Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=119763.
Full textAbstract:
The choice number of a graph G, denoted ch(G), is the minimum integer k such that for any assignment of lists of size k to the vertices of G, there is a proper colouring of G such that every vertex is mapped to a colour in its list. For general graphs, the choice number is not bounded above by a function of the chromatic number.In this thesis, we prove a conjecture of Ohba which asserts that ch(G) = χ(G) whenever |V (G)| ≤ 2χ(G) + 1. We also prove a strengthening of Ohba's Conjecture which is best possible for graphs on at most 3χ(G) vertices, and pose several conjectures related to our work.Le nombre de choix d'un graphe G, noté ch(G), est le plus petit entier k tel que pour toute affectation de listes de taille k au sommets de G, il y a une coloration de G tel que chaque sommet de G est coloré par une couleur de sa liste. En général, le nombre de choix n'est pas borné supérieurement par une fonction du nombre chromatique.Dans cette thèse, nous démontrons une conjecture de Ohba qui affirme que ch(G) =χ(G) dès que |V (G)| ≤ 2χ(G) + 1. Nous démontrons aussi une version plus forte de la conjecture de Ohba qui est optimale pour les graphes ayant au plus 3χ(G) sommets, et énonçons plusieurs conjectures par rapport à nos travaux.
8
Lu, Lei 1975. "Essays on asset pricing with heterogeneous beliefs and bounded rational investor." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=103267.
Full textAbstract:
The thesis includes two essays on asset pricing. In the first essay, "Asset Pricing in a Monetary Economy with Heterogeneous Beliefs", we shed new light on the role of monetary policy in asset pricing by focusing on the case where investors have heterogeneous expectations about future monetary policy. Under heterogeneity in beliefs, investors place bets against each other on the evolution of money supply, and as a result, the sharing of wealth in the economy evolves stochastically over time, making money non-neutral. Employing a continuous-time, general equilibrium model, we establish these fluctuations to be rich in implications, in that they majorly affect the equilibrium prices of all assets, as well as inflation. In particular, we find that the stock market volatility may be significantly increased by the heterogeneity in beliefs, a conclusion supported by our empirical analysis. The second essay is titled with " Asset Pricing and Welfare Analysis with Bounded Rational Investors". Motivated by the fact that investors have limited ability and insufficient knowledge to process information, I model investors' bounded-rational behavior in processing information and study its implications on asset pricing. Bounded rational investors perceive "correlated" information (which consists of news that is correlated with fundamentals, but provides no information on them) as "fundamental" information. This generates "bounded rational risk". Asset prices and volatilities of asset returns are derived. Specially, the equity premium and the stock volatility are raised under some conditions. I also analyze the welfare impact of bounded rationality.
9
Malik, Sarah. "Reading between the lines: race, culture, and bounded identity in multicultural societies." Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=97127.
Full textAbstract:
This thesis demonstrates the colonizing impact of multiculturalism on in-between subjects. In-between subjects are defined as individuals whose identities form at the interstices of two or more cultures. Using evidence from the narratives of The Namesake, The In-Between World of Vikram Lall, and Londonstani, this research describes a set of structurally embedded cultural concepts – rooting, marking, deference, and communication. These concepts contribute to the scripting of the essentialized identity roles that limit the recognition, inclusion, and participation of in-between subjects. Further, these conditions impose a double-bind on in-between subjects; in performing essentialized identities, in-between subjects deny their own free participation and expression, but to not perform an essentialized identity would mean sure exclusion and marginalization. The evidence points to a possible solution, however, in the form of safe spaces and relationships where difference is unscripted and alterity fills the space between Self and Other.Ce travail démontre les effets colonisant de la multiculturalisme sur les "in-betweens." Les in-betweens sont des individus ayant une identité constituer au croisement de deux ou plusieurs cultures. Avec des données prises des récits de The Namesake, The In-Between World of Vikram Lall, et Londonstani, ce recherche décrit des concepts enfoncés dans la structure sociale – le racinement, la marque, la différence, et la communication. Ces concepts contribuent à la création des personnages hyper-culturelles, dont l'effectualisation limite la reconnaissance, l'inclusion, et la participation des in-betweens. En effectuant ces personnages, les in-betweens perdre leurs voix et leurs droits de participer. Par contre, s'ils n'effectuent pas ces personnages, les in-betweens seront exclus et marginalisés. Les espaces et les relations ou il ne faut pas distinguer entre soi et l'autre pour comprendre la différence offrent une solution; c'est là ou les in-betweens peuvent trouver le soutien communautaire qu'il faut pour assurer la participation.
10
Gu, Lian Sheng. "Migration of a neutrally buoyant particle suspended in a general bounded creeping flow." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=29032.
Full textAbstract:
The migration phenomenon of a neutrally buoyant solid particle suspended in an arbitrary flowing fluid of zero Reynolds number bounded by a plane solid wall has been analytically studied for the situation where the influence of boundary conditions is important. In particular, it is shown that for flows near a solid wall, particles can move in such a manner so as to cause large spatial variations of particle concentration in the suspension.Similar techniques are used to obtain a theoretical formulation for the non-deformable spherical droplet suspended in the prescribed flowing fluid bounded by the solid plane boundary. Special cases such as flows containing a vortex near the solid boundary or flows which are periodic along the wall are particularly examined.
Experiments have been performed to verify the validity of the theory for the solid particles and non-deformable fluid drops. Experimental results are also compared to theoretical conclusions.
11
Munro, Kathleen Margaret. ""Learning through work" : a case study of a bounded system of learning within an NHS Trust in Scotland." Thesis, University of Strathclyde, 2001. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=23943.
Full textAbstract:
The idea that knowledge is generated from practice and that nurses learn through their work was the starting point for this thesis that examines the system of learning through work for experienced nurses and their managers working in a National Health Service Trust in Scotland. The thesis includes a pursuit of the meaning of work-based learning, life long learning and continuing professional development. The implications for the NHS as a learning organisation and the emerging conceptual issues generated questions about the current system of learning at work for nurses. Thirteen nurses and six managers from five hospitals participated in this case study that included a semi-structured interview, the development of individual picture maps and a second interview. Learning through work, its purpose and the processes experienced by the participants were analysed. Individual and collective benefits and the institutional and organisational omissions and barriers to learning were identified. Many factors were found that influence learning through work. The development of the charity paradigm is an attempt to explain one aspect. Key features such as learning on the job, learning by doing and learning from others are described as part of the informal learning that occurs within the organisation. Other learning, such as defined pathways, combine with informal learning to form the learning through work continuum. These different modes of learning within the system are categorised and related to single and double loop learning mechanisms. The matrix of the learning system within the organisation includes the four major components of the system. It is suggested that achievement of productive integrated learning needs a collaborative approach to curriculum development and learning within organisations that will facilitate collective experiential learning through work.
12
De, Maio Sukic Alejandro. "Landowners' willingness to accept compensation for selling saltwater marshes to a conservation program : a multiple bounded discrete choice approach." Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=31217.
Full textAbstract:
Saltwater marshes in the Bay of Fundy act as greenhouse gases sinks and reservoirs by fixing atmospheric carbon dioxide and storing it in carbon rich deposits. There are approximately 3,131.5 hectares of saltwater marsh in the Bay of Fundy, of which 958 ha are currently owned by the government or conservation organizations and 2,173.5 ha are owned by private landowners. A multiple bounded discrete choice contingent valuation survey was conducted to estimate landowners' willingness to accept compensation for selling their saltwater marshes to a conservation program. A multiple bounded model developed by Gregory Poe and Michael Welsh (1995) was used to analyze the responses. Mean willingness to accept compensation for one hectare of saltwater marsh was estimated to be $1,004.22, and aggregate willingness to accept compensation for the total of 2,173.5 ha of saltwater marsh owned by private landowners was approximately $2,180,000. Using these estimates and the rate of carbon dioxide-equivalent absorption of saltwater marshes, the opportunity cost of one tonne of carbon dioxide-equivalent sequestered by saltwater marshes in the Bay of Fundy was calculated to range between $16.70 and $19.95. Decision-makers can use this result for policy purposes concerning the achievement by Canada of its greenhouse gases emission reduction commitment under the Kyoto Protocol (1997).
13
Rajasingam, Prasanthan. "On the numerical solution of continuous coupled algebraic Riccati equations." OpenSIUC, 2016. https://opensiuc.lib.siu.edu/dissertations/1203.
Full textAbstract:
In this dissertation we first derive a new unified upper solution bound for the continuous coupled algebraic Riccati equation, which arises from the optimal control of a Markovian jump linear system. In particular, we address the issue of rank deficiency with the control matrices. In the case of rank deficiency the existing matrix upper bounds are inapplicable. Moreover, our new result is not restricted to rank deficiency cases only. It now contains the existing results as special cases. Next, an iterative refinement is presented to improve our new unified matrix upper solution bounds. In particular, this iterative refinement determines a monotonically decreasing sequence of upper bounds for the solution of the continuous coupled algebraic Riccati equation. We formulate a new iterative algorithm by modifying this iterative refinement. We also prove that this new algorithm generates a monotonically decreasing sequence of matrix upper solution bounds that converges to the maximal solution of the continuous coupled algebraic Riccati equation. Furthermore, we prove the convergence of an accelerated Riccati iteration which computes a positive semidefinite solution of the continuous coupled algebraic Riccati equation. In particular, we establish sufficient conditions for the convergence of this algorithm. We also prove that for particular initial values this algorithm determines a monotonically increasing sequence of positive semidefinite matrices that converge to the minimal solution of the continuous coupled algebraic Riccati equation. Additionally, we show that for specific initial values this algorithm generates a monotonically decreasing sequence that converges to the maximal solution of the continuous coupled algebraic Riccati equation. In addition, we prove that this accelerated Riccati iteration converges faster than the Riccati iteration. Finally, we formulate a weighted modified accelerated Riccati iteration which is a more generalized Riccati type iteration. All of the existing Riccati iterations are now the special cases of this algorithm. Furthermore, we establish sufficient conditions for the convergence of this algorithm and we prove the monotonic convergence of the sequence generated by this algorithm. We also discuss how the weight and other quantities affect the rate of convergence of this algorithm. Illustrative numerical examples are also presented.
14
Tkac, Jennifer May. "Estimating willingness to pay for the preservation of the Alfred bog wetland in Ontario : a multiple bounded discrete choice approach." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=29480.
Full textAbstract:
The Alfred Bog wetland is the largest high quality bog ecosystem and one of the most important natural areas in southern Ontario. The 4,200 hectare bog provides habitat to a large number of rare and endangered species and plays an integral role as a natural water filter. This study used the contingent valuation survey method to estimate respondents' willingness to pay for the preservation of the Alfred Bog wetland, which is threatened by the competing activities of drainage, burning, and the extraction of peat. A multiple bounded discrete choice model was used to analyze the survey results. Results indicated that respondents were willing to pay an average of $79.22, in the form of a one-time voluntary contribution to a hypothetical preservation fund, for the preservation of the Alfred Bog wetland. Conservation club membership, visits to the bog, donations to wetland preservation programs, attitudes, distance from the bog, household income, and education level were found to be important predictors of willingness to pay. Aggregate willingness to pay to preserve the bog was estimated to be between $2.2 million to $663,000 depending upon the inclusion or exclusion of protest bids. The survey results suggested that most of this value was nonuse value attributed to option, bequest, and altruistic values. Thus, the failure of policy makers and resource managers to consider nonuse values in decision making processes can understate the value of preserving the Alfred Bog.
15
El, Hajj Layan. "Intersection bounds for nodal sets of Eigenfunctions." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=107810.
Full textAbstract:
We consider the zeros of a Neumann eigenfunction φ_λ on an analytic domainsolving the equation -∆ φ_λ =λ^2 φ_λ. We count the number n(λ;H) of intersection points of the nodal lines of φ_λ (components of the nodal set) with a fixed real analytic curve H contained in the interior of the domain. We identify a large family of curves H, namely C^ω-homotopic curves to the boundary, for which the nodal intersection bound for n(λ;H) is O(λ). This bound is consistent with Yau's famous conjecture on the measure of the nodal set.On considère les zéros d'une fonction propre de Neumann φ_λ d'un domaine analytique , solution de l'équation -∆ φ_λ =λ^2 φ_λ. On compte le nombre d'intersectionn (λ;H) de lignes nodales des fonctions propres de Neumann (composantes de l'ensemble nodal) avec une courbe fixe analytique réelle H contenue à l'intérieur du domaine. On identifie explicitement une grande famille de courbes pour lesquelles une borne pour l'intersection nodale n(λ;H) est O(λ). Cette borne est compatible avec la conjecture célèbre de Yau sur la mesure de l'ensemble nodal.
16
Han, Ying 1974. "Upper bounds for the likelihood of a phylogeny." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80285.
Full textAbstract:
Phylogenetics is the study of the evolutionary history of species. Given an observed set of data, deriving the optimal phylogenetic trees which explain the data with maximum probability remains a central problem in mathematical biology.Even when the phylogenetic tree is given, there is no efficient algorithm for determining branch lengths with optimal likelihood. This motivates the development of efficient upper bounds for the likelihood of a tree. These upper bounds can be used to assess the quality of a particular branch length optimization or to eliminate the trees which are not possible optimal solutions.
The upper bounds derived in the thesis are based on the circular ordering of leaves of a phylogenetic tree T. They apply to extremely general models of evolution, with both equal and unequal base frequencies. We obtain tighter bounds for some specific models as well.
17
Sloan, Peter. "Price of anarchy bounds for core-selecting mechanisms." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121179.
Full textAbstract:
Core-selecting auction mechanisms are auctions that select player utilities which satisfy certain stability properties. They are currently of theoretical and practical interest in mechanism design, having already been used to conduct multi-billion dollar auctions. We generalize the concept of a Core-selecting auction mechanism to a large class of complete information games and demonstrate that several well-known games can be described by these Core-selecting mechanisms. Our main result is a bound on the Price of Anarchy of Core-selecting mechanisms. Provided some simple conditions are met, there are Core-selecting mechanisms with Price of Anarchy at most 1 + 1/D^2, where D in [0,1] is a measure of the degree of submodularity of the game's social welfare function, expressed as a set function. In addition to this result, we show that there exist special Core-selecting mechanisms which have two additional properties: they are player-Pareto optimal and they provide a local, individual utility guarantee.Les mécanismes d'enchères de Coeur-sélection (Core-selecting auction mechanisms) sont des enchères qui sélectionnent les utilités des joueurs qui satisfont certains propriétés de stabilité. Ils occupent présentement une place d'intérêt théorique et pratique dans la théorie de la conception des mécanismes, ayant été utilisés pour effectuer des enchères avec des recettes en milliards de dollars. Nous généralisons la notion d'un mécanisme d'enchères de Coeur-sélection pour les appliquer à des jeux des informations complètes. Nous démontrons que ces mécanismes décrivent plusieurs jeux bien connus. Notre résultat principal est un majorant pour le Prix de l'Anarchie (Price of Anarchy) des mécanismes de Coeur-sélection. Nous démontrons que, si certaines conditions simples sont atteintes, il existe des mécanismes de Coeur-sélection avec un Prix de l'Anarchie d'au plus que 1+1/D^2, où D, entre 0 et 1, est une measure du degré du Sous-modularité (Submodularity) de la fonction du Bien-être du jeu, encodée sous forme de fonction d'ensemble. En plus de cette garantie, nous démontrons qu'il éxiste des mécanismes de Coeur-sélection qui ont aussi deux autres caractéristiques: ils sont Joueur-Optimales (Player Optimal), et ils garantissent un minimum pour le bien-être individuel.
18
Rubin, Aviad. "From marginalization to bounded integration - reassessing the compatibility of religion and democracy: a comparison of the state-religion relationship in Turkey and Israel." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=92304.
Full textAbstract:
There is an inherent tension in the relationship between religion and democracy. While religion generally adheres to a single ultimate set of values, democracy requires political tolerance and the recognition of the coexistence of several truths.This is why, both intuitively and according to influential theories of modernization, the separation of religion and the state has been seen as a pre-condition for successful democratization. Yet a comparison of Israel and Turkey challenge the validity of such alleged "truths." This is because existing theories cannot adequately account for the dynamic nature of the state-religion relations. Israel, which assigned a formal role to religion in the state, was able to maintain stable democratic rule despite some major internal and external political challenges. Nevertheless, after three decades of constructive collaboration between the state and religious actors, the latter have increased their demands on the state in a manner that challenged the foundations of the regime, although so far the state has been successful in effectively containing them. In contrast, the Turkish state attempted to enforce strict secularization on society by marginalizing religion from public affairs through constitutional measures and military repression. Yet after eight decades trying, Turkish society remained far from being truly secular and the attempts to enforce secularism seriously undermined Turkish democracy.
To understand why this has been the case, the dissertation develops a model for the state-religion relationship, the Bounded Integration Model (BIM), that overcomes the over simplistic, static and deterministic nature of existing theories. The model demonstrates that religious actors should be understood as potential members in civil society, the dynamic interaction of which with the state determines the boundaries of civil society and the prospects for stable democratic governance.
The study concludes that there is a need to re-evaluate the relationship between the state and religion over time, and reconsider deterministic conclusions about the ability of some religions - Islam in particular - to peacefully co-exist with democratically governed states.
Il existe une crispation inhérente de la relation entre la religion et la démocratie. La religion, pour sa part, adhère à un seul et unique code de valeurs, tandis que la démocratie, elle, nécessite une tolérance politique et l'acceptation de la coexistence de plusieurs vérités.
C'est pour ces raisons que non seulement intuitivement, mais également selon les théories influentes de la modernisation, la séparation de la religion et de l'État est regardée comme la pierre angulaire d'une démocratisation réussie. Toutefois, une comparaison entre l'Israël et la Turquie conteste la validité de ces présumées vérités, et ce, parce que les théories actuelles ne peuvent expliquer convenablement la dynamique de la nature des relations entre la religion et l'État. D'une part, l'Israël, consacrant au sein de l'État un rôle officiel à la religion, a été en mesure de maintenir un gouvernement démocratique stable malgré certains enjeux politiques, internes et externes, importants. Néanmoins, après trois décennies de collaboration fructueuse entre l'État et les acteurs religieux, ces derniers ont augmenté leurs demandes envers l'État de sorte qu'elles s'opposaient aux assises du régime; jusqu'à maintenant, l'État a toutefois réussi à les limiter. D'autre part, l'État turque a tenté d'appliquer une sécularisation absolue en marginalisant la religion des affaires publiques par l'entremise de mesures constitutionnelles et de répression militaire. Pourtant, après huit années de persévérance, la Turquie demeure loin d'être un État réellement laïque et les efforts déployés dans le but d'appliquer ce laïcisme ont grandement nui à la démocratie.
Afin de comprendre le pourquoi de tels aboutissements, la présente dissertation propose un modèle intitulé le Modèle d'intégration limitée (MIL) illustrant la relation entre l'État et la religion en palliant la nature simpliste, statique et déterministe des théories actuelles. Ce modèle démontre que les acteurs religieux doivent être considérés comme étant des membres potentiels de la société civile dont l'interaction dynamique avec l'État déterminerait les limites de la société civile et les aspirations à une gouvernance démocratique stable.
Cette étude conclue qu'une réévaluation de la relation entre l'État et la religion au fil du temps est nécessaire et remet en question les conclusions déterministes sur la capacité de certaines religions notamment l'Islam de pouvoir coexister en paix avec des États gouvernés démocratiquement.
19
Qian, Feng 1973. "A comprehensive approach to array bounds check elimination for Java /." Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=31528.
Full textAbstract:
We present a new approach to eliminate array bounds checks in Java by using static analyses. Our approach is based upon a flow-sensitive intraprocedural analysis called variable constraint analysis (VCA). VCA collects constraints between locals related to array references. The array bounds check problem is formulated as solving a system of difference constraints. The analysis builds a small constraint graph for each important point in a method, and then computes the shortest-path weight of the graph. The shortest-path weights from upper bound to array index and from the index to lower bound indicates the safety of checks. Using VCA as the base analysis, we also show how two further analyses can improve the results of VCA. Array field analysis is applied on each class and provides information about some arrays stored in fields, while rectangular array analysis is an interprocedural analysis to approximate the shape of arrays, and is useful for finding rectangular (non-ragged) arrays. (Abstract shortened by UMI.)
20
Côté, François. "GNSS modulation: a unified statistical description with application to tracking bounds." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=86778.
Full textAbstract:
A unifying framework for all signals belonging to the Global Positioning System (GPS) and Galileo system is presented and applied to assess the potential code tracking performance of modernized satellite radionavigation signals. The framework reconciles, under a single analytical formulation, subcarrier signaling schemes, including the Binary Offset Carrier (BOC), Multiplexed Binary Offset Carrier (MBOC), and Alternative Binary Offset Carrier (ALTBOC). The new formulation allows for the derivation of closed form equations for the Auto-Correlation Function (ACF) and Power Spectral Density (PSD) containing, as special cases, the corresponding functions for GPS and Galileo signals. The analytical expressions are used to obtain new bounds on code tracking accuracy based on the Ziv-Zakai Bound (ZZB). Although the code tracking performance of GPS and Galileo signals is typically investigated using the Cramér-Rao Bound (CRB), the approach is heuristic. The CRB does not adequately describe the potential code tracking performance of weak or wideband signals and does not account for tracking biases. On the other hand, there are no such restrictions for Bayesian bounds such as the ZZB. However, because the CRB is easier to evaluate, it is advantageous to quantitatively identify when the CRB is a meaningful benchmark before having to resort to the ZZB. Therefore, thresholds on signal energy are provided to indicate necessary conditions for the use of the CRB. In agreement with information-theoretic developments, the thresholds reveal that a large signal bandwidth cannot reliably compensate for low signal energy in order to sustain code tracking performance.Un cadre unifié pour tous les signaux appartenant au système de positionnement global (GPS) et au système Galileo est présenté et appliqué afin de révéler la précision potentielle de la poursuite du code des signaux modernes de la radionavigation par satellite. Le cadre réconcilie, sous une formulation analytique, les modulations codées du type BOC, MBOC et ALTBOC (dites respectivement Binary Offset Carrier, Multiplexed Binary Offset Carrier et Alternative Binary Offset Carrier). La nouvelle formulation permet d'obtenir des équations fermées propres aux fonctions d'autocorrélation (ACF) et de densité spectrale de puissance (PSD) contenant, à titre de cas spéciaux, les expressions correspondantes pour les signaux GPS et Galileo. Ces expressions conduisent à de nouvelles limites pour la précision de la poursuite du code basées sur la borne de Ziv-Zakai (ZZB). Quoique la performance de la poursuite du code des signaux GPS et Galileo est ordinairement évaluée en utilisant la borne de Cramér-Rao (CRB), l'approche n'est pas rigoureuse. La CRB n'est pas adéquate pour des signaux faibles ou à large bande passante, et ne peut refléter le comportement d'une poursuite biaisée. D'autre part, ces restrictions ne s'appliquent pas aux bornes bayésiennes, telle la ZZB. Or, la CRB peut être évaluée plus aisément que la ZZB, ainsi il est avantageux d'identifier concrètement les conditions supportant son utilisation avant d'avoir recours à la ZZB. Pour délimiter la validité de la CRB, un seuil sur l'énergie des signaux est établi. Soutenu par des développements basés sur la théorie de l'information, ce seuil révèle qu'une large bande passante ne peut compenser avec fiabilité la piètre précision d'une poursuite de signaux faibles.
21
Flores, Alejandro Ignacio Allendes. "Towards fully computable error bounds for the incompressible Navier-Stokes equations." Thesis, University of Strathclyde, 2012. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=16939.
Full textAbstract:
We obtain fully computable constant free a posteriori error bounds on simplicial meshes for: a nonconforming finite element approximations for a Stokes problem and a low-order conform- ing and low-order stabilized conforming finite element approximations for Poisson, Stokes and Advection-Reaction-Diffusion problems. All the estimators are completely free of unknown con- stants and provide guaranteed numerical bounds on natural norms, in terms of a lower bound for the inf-sup constant of the underlying continuous problem in the Stokes case. These estimators are also shown to provide a lower bound for the natural norms of the error up to a constant and higher order data oscillation terms. In the Stokes problem, the adaptive selection of the stabilization parameter appears as an application. Numerical results are presented illustrating the theory and the performance of the error estimators.
22
Tremblay, Yannick. "Acquisition of haemoglobin-bound iron by Histophilus somni." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82441.
Full textAbstract:
Ovine (strains 9L and 3384Y) and bovine (strains 649, 2336 and 8025) isolates of Histophilus somni were investigated for their ability to acquire iron from haemoglobin (Hb). Bovine isolates were capable of utilizing bovine, but not ovine, porcine or human Hb as a source of iron. Ovine isolates could not obtain iron from Hb. Bovine isolates bound bovine, ovine, and human Hbs by means of the same iron-repressible receptor(s) and produced a ~120-kDa iron-repressible, outer membrane protein. Using PCR approaches, an iron-regulated operon containing hugX and hugZ homologues and a gene (hgbA) that encodes a TonB-dependent, Hb-binding proteins were identified in strains 649, 9L and 3384Y. In strains 9L and 3384Y, HgbA is truncated offering a possible explanation for their lack of utilization of Hb as an iron source. In strains 2336 and 8025, expression of HgbA was also subject to a form of phase variation.
23
Johnstone, Alexander C. "Placing a bound on the post-Newtonian parameter [alpha]₂." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=81345.
Full textAbstract:
A method for obtaining a smaller bound for the post-Newtonian parameter alpha 2 is outlined. alpha2 is a parameter in the post-Newtonian formalism associated with violation of Lorentz invariance. The current bound found by Nordvedt, alpha2 < 1.2 x 10 -7, was obtained using solar system data. We show that, by analysing millisecond pulsar profiles and limiting the amount of secular evolution, a smaller bound can be obtained.
24
Raymond, Jean-Francois 1974. "Private information retrieval : improved upper bound, extension and applications." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=30830.
Full textAbstract:
Private Information Retrieval (PIR), which allows users to query one (or many replicated) database(s) for the ith element, while keeping i private, has received a lot of attention in recent years. Indeed, since Chor et al. [31, 32] introduced this problem in 1995, many researchers have improved bounds and proposed extensions. The following pages continue along this path: pushing the techniques of [52] we obtain an improved upper bound and define and provide a solution to a new problem which we call private information retrieval with authentication. In addition, we motivate the study of PIRs by presenting new and useful real world applications.
25
Jappy, Alan. "A constitutively consistent lower bound, direct shakedown and ratchet method." Thesis, University of Strathclyde, 2014. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=23743.
Full textAbstract:
When a structure is subject to cyclic loads there is a possibility of it failing due to ratchet or incremental collapse. In many engineering structures the demonstration of non-ratcheting behaviour is a fundamental requirement of the design and assessment process. Whilst it is possible to use incremental finite element analysis to simulate the cyclic response for a given load case to demonstrate shakedown or ratchet, it does not yield any information on the safety factor. In addition, there are several practical problems in using this approach to determine whether or not a component has achieved shakedown. Consequently several direct methods which find the loads at the shakedown and ratchet boundaries have been developed in the past 3 decades. In general, lower bound methods are preferred for design and assessment methodologies. However, to date, the lower bound methods which have been proposed for shakedown and ratchet analysis have not been fully reliable and accurate. In this thesis a lower bound shakedown and ratchet method which is both reliable and accurate is proposed. Previously proposed elastic plastic lower bound ratchet methods are revisited and modified to understand the limitations in current methods. From this, Melan's theorem is reinterpreted in terms of plasticity modelling and shown to have the same form as a non-smooth multi yield surface plasticity model. A new shakedown method is then proposed based on the non-smooth multi yield surface plasticity model. The new shakedown method is extended using a two stage process to determine the ratchet boundary for cyclic loads in excess of the alternating plasticity boundary. Two simplified variants of the ratchet method are also proposed to decrease the computational expense of the proposed ratchet method. Through several common benchmark problems the proposed methods are shown to give excellent agreement with the current upper bound methods which have been demonstrated to be accurate. The flexibility of the shakedown method is demonstrated by extending the method to incorporate temperature dependent yield, hardening and simplified non-linear geometric effects.
26
Zariffa, Nohad. "Implementations and analysis of three parallel branch-and-bound algorithms for the vertex covering problem." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66011.
Full text
27
Bo, Chengyuan. "Role of growth factor receptor-bound protein7 (Grb7) in mammary tumour progression." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=107757.
Full textAbstract:
Gene amplification and elevated expression of ErbB2 receptor tyrosine kinase has been implicated in the development and progression of human breast cancer, and correlates to poor clinical outcomes. Transgenic mouse models provide a good tool to study ErbB2 mediated mammary tumourigenesis. In both human ErbB2 positive mammary tumour and ErbB2 knock-in mouse model derived mammary tumours, Grb7 is found to be co-amplified and co-expressed with ErbB2. Here we demonstrated ectopic expression of Grb7 in MDCK cells correlates to the loss of epithelial cell polarity, and this was also found true in primary mammary epithelial cells derived from transgenic mice overexpressing Grb7. Elevated expression of Grb7 in mouse mammary gland during developing stage can lead to incomplete mammary ductal outgrowth accompanied by mammary ducts with multiple epithelial layers and myoepithelial missing. NDL transgenic overexpressing Grb7 had longer tumour latency, and it was found that NDL tumours selectively down-regulated the induced-expression of Grb7.L'amplification génique et l'expression élevés de récepteur tyrosine kinase ErbB2 a été impliqués dans le développement et la progression du cancer du sein humain, et corrèle avec de mauvais résultats cliniques. Les modèles de souris transgéniques constituent un bon outil pour étudier la formation de tumeurs médiées par ErbB2 dans la glande mammaire. Dans le cancer mammairehumaines positif pour ErbB2 et le modèle de cancer mammaire de souris ErbB2 knock-in, Grb7 est co-amplifié et co-exprimé avec ErbB2. Ici, nous avons démontré que l'expression ectopique de Grb7 dans les cellules MDCK corrèle avec la perte de polarité des cellules épithéliales, et qui est aussi consistent dans les cellules épithéliales mammaires primaires dérivés de souris transgéniques surexprimant Grb7. Expression élevée de Grb7 dans la glande mammaire de souris pendant la phase de développement peut causer l‟incomplets excroissance canalaires mammaires accompagnés par des conduits mammaires avec de multiples couches épithéliales et myoépithéliales manquants. NDL transgéniques surexprimant Grb7 avait une plus longue délais avant formation de tumeur, et il a été constaté que les tumeurs NDL, de façon sélective, perde la capacité d`induirel`expression de Grb7.
28
Merkel-Keller, Jessica V. "Expectations and illness : depression as a culture-bound syndrome in North America." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=99354.
Full textAbstract:
Clinical depression has been unilaterally construed as a biochemical imbalance in serotonerigic systems. The over-simplification of disease reflects economic, political, and social forces that pathologize normal behaviors to manufacture illness. This paper considers evolutionary and dynamic systems biology to advance the idea that subclinical depression is an illness within culture that manifests biologically, as opposed to being organically created and sustained. The classic medical model underestimates psychosocial elements of depression. Patient narratives show the limitations of the medical model and suggest a need for a new depression paradigm, which is the biopsychosocial model. This paper is critical of both the biological etiology of depression and the social and cultural elements that create and sustain depressive episodes.
29
Tadsanaprasittipol, Amornphat. "Development of analytical methods for particulate-bound polycyclic aromatic hydrocarbons (PAHs) in Thailand." Thesis, University of Strathclyde, 2016. http://digitool.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=27549.
Full textAbstract:
This study developed analytical methods to quantify particulate-bound polycyclic aromatic hydrocarbons (pPAHs). The methods were used to characterise PAHs in house dust and particulate matter (PM10) samples, respectively, in two case studies. Dust samples were collected from rural households in Malawi to represent indoor particles from biomass fuel combustion. PM10 samples were collected from three sites in the Bangkok Metropolitan Administration (BMA), Thailand to represent air pollutants in roadside, industrial and urban background environments. PAHs were quantified using a gas chromatograph-mass spectrometer (GC-MS). Comprehensive two-dimensional gas chromatograph coupled with time-of-flight mass spectrometer(GCxGC TOFMS) was used for the screening of unknown air pollutants in PM10. Low molecular weight 2-ring and 3-ring PAHs were more abundant in dust samples collected in Malawi, while high molecular weight 4-ring to 6-ring PAHs were more abundant in PM10 samples collected in Thailand. Spatial and temporal variations in PM10 and pPAH concentrations were examined between and within the three sampling sites in Thailand. Annual average benzo[a]pyrene (BaP) concentrations were 0.47 ± 0.39 ng m-3, 0.35 ± 0.27 ng m-3 and 0.24 ± 0.19 ng m-3 at the roadside, industrial and urban background sites, respectively. Cancer risks associated with pPAHs were estimated using BaP and BaP toxic equivalency (BaP-TEQ) concentrations. The highest incremental lifetime cancer risk was found in the residential adult group at 4.2 x 10-7 at the industrial site. Although the highest PM10 and total PAHs concentrations were found at the roadside site, the highest carcinogenic potential of total PAH (in terms of BaP toxic equivalency concentration) was found at the industrial site. Thus, the cancer risk estimation relies more on the composition of pPAHs than its concentration. Estimated lifetime lung cancer risks associated with pPAHs in all three sites were in the ‘acceptable’ range of less than 1 x 10-6 defined by the United States Environmental Protection Agency.
30
Cocciardi, Robert Arthur. "Evaluation of single-bounce attenuated total reflectanceFourier transform infrared and two-dimensional correlation spectroscopy in quantitative analysis." Thesis, McGill University, 2003. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=19543.
Full textAbstract:
The utility of single-bounce attenuated total reflectance (SB-ATR) and heterospectral two-dimensional correlation spectroscopy (H2D-CS) in quantitative analysis by Fourier transform infrared (FTIR) spectroscopy was investigated by exploring several potential applications of these techniques. Enzymatic hydrolysis of lactose in milk was monitored by SB-ATR/FTIR spectroscopy, and changes in the concentrations of glucose, galactose and lactose during the process were successfully measured quantitatively. SB-ATR/FTIR spectroscopy was shown also to perform comparably to Fourier transform near-infrared (FT-NIR) spectroscopy for the determination of the alcohol content of distilled liquors and better than FT-NIR spectroscopy and comparably to transmission FTIR spectroscopy for the analysis of alcohol, total reducing sugar, total acidity and pH in wines. In addition, a set of 149 pre-analyzed wine samples was employed to develop and validate an SB-ATR/FTIR calibration for 11 different parameters and constituents in wines with the use of partial-least-squares (PLS) regression, demonstrating the potential utility of this method in the routine analysis of wines. The application of SB-ATR/FTIR spectroscopy and H2D-CS in the selection of wavelengths for multiple linear regression (MLR) calibration for FT-NIR analysis of ternary aqueous solutions of fructose, glucose and galactose was also investigated. NIR wavelengths were identified for the three sugars by H2D-CS of the SB-ATR/FTIR spectra of binary sugar solutions in relation to their FT-NIR spectra. An MLR calibration developed based on these wavelengths gave better results than PLS calibrations and comparable results to those obtained by MLR using wavelengths selected by examination of 1st and 2nd derivative spectra. H2D-CS was extended to include 2D correlations between high-pressure liquid chromatography (HPLC) and SB-ATR/FTIR data for the purpose of identifying HPLC peaks without the need to isolate the eluted compounds. The potential utility of this approach, termed spectroscopic/chromatographic 2D correlation (SC2D-C), was investigated by generating FTIR slice spectra corresponding to the HPLC peaks of wines spiked with sucrose, glucose and fructose and comparing them to 404 reference spectra in an IR spectral library. It was found that these constituents were correctly identified provided there was sufficient random variability of their concentrations in the samples analyzed.
31
Liu, Xuecheng 1963. "Nonparametric maximum likelihood estimation of the cumulative distribution function with multivariate interval censored data : computation, identifiability and bounds." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=79036.
Full textAbstract:
This thesis addresses nonparametric maximal likelihood (NPML) estimation of the cumulative distribution function (CDF) given multivariate interval censored data (MILD). The methodology consists in applying graph theory to the intersection graph of censored data. The maximal cliques of this graph and their real representations contain all the information needed to find NPML estimates (NPMLE). In this thesis, a new algorithm to determine the maximal cliques of an MICD set is introduced. The concepts of diameter and semi-diameter of the polytope formed by all NPMLEs are introduced and simulation to investigate the properties of the non-uniqueness polytope of the CDF NPMLEs for bivariate censored data is described. Also, an a priori bounding technique for the total mass attributed to a set of maximal cliques by a self-consistent estimate of the CDF (including the NPMLE) is presented.
32
Ku, Wen-Yang. "Lattice preconditioning for the real relaxation based branch and bound method for integer least squares problems." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106555.
Full textAbstract:
Lattice basis reduction is a powerful tool for solving complex problems both in pure mathematics and practical applications. In this thesis, we use lattice basis reduction as a preconditioning technique to accelerate the real relaxation based branch and bound (RRBB) method for solving integer least squares (ILS) problems. We give theoretical arguments and simulation results to show that applying lattice preconditioning to the RRBB method can greatly reduce the size of the RRBB tree for ordinary ILS problems, making the method more efficient. We then propose new reduction strategies, which are more effective than some typical existing reduction strategies for lattice preconditioning. Finally we extend the preconditioning techniques to the RRBB method for box-constrained and more general linear-inequality constrained ILS problems. Numerical test results indicate lattice preconditioning is also very effective to reduce the computation time of the RRBB method for these constrained problems.Les techniques de réduction de réseaux est un outil puissant pour résoudre des problèmes complexes tant en mathématiques pures et les applications pratiques. Dans cette thèse, nous utilisons reduction de réseaux comme une technique de préconditionnement pour accélérer la branche réelle détente et de base lié (RRBB) méthode pour résoudre les problèmes de moindres carrés en nombres entiers (ILS). Nous donnons des arguments théoriques et des résultats de simulation pour montrerque l'application de treillis de préconditionnement de la méthode RRBB peut réduire considérablement la taille de l'arbre RRBB pour des problèmes ILS ordinaires, cequi rend la méthode plus efficace. Nous proposons ensuite de nouvelles stratégies de réduction, qui sont plus efficaces que certaines stratégies de réduction de type existants pour le préconditionnement treillis. Enfin nous étendons les techniques de préconditionnement de la méthode RRBB pour la contrainte des boîtes et des contraintes linéaires-inégalité plus générales des problémes ILS. Les résultats des simulations numériques indiquent que le préconditionnement treillis est également très efficace pour réduire le temps de calcul de la méthode RRBB pour ces problèmes contraints.
33
Steadman, Shelly. "Investigation into methods for recovery and STR typing of limited quantity and membrane bound forensic samples." Thesis, University of Strathclyde, 2010. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=14436.
Full text
34
Ure, James Michael. "An advanced lower and upper bound shakedown analysis method to enhance the R5 high temperature assessment procedure." Thesis, University of Strathclyde, 2013. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=22547.
Full textAbstract:
A nuclear power station contains some of the most extreme environments and operating conditions seen by metallic components. In order to ensure the continued safe operation of these plant components rigorous structural integrity assessments are performed. Part of this structural assessment involves demonstrating that the component in question will not fail by ratcheting. In the UK the R5 procedure forms the cornerstone of these integrity assessments. The R5 rules for shakedown, whilst easily implemented, can give an overly pessimistic estimate of the shakedown status. This means that a computationally expensive nonlinear finite element analysis must be conducted. The Linear Matching Method (LMM) is one of the recently developed Direct Methods for shakedown analysis. This upper bound method has the ability to give more accurate shakedown limits than the simplified R5 route and with less computational expense than nonlinear finite element analysis. This thesis details the steps taken to take the LMM from being a research based method into a tool which can be used for regular integrity analyses within EDF. Firstly a conservative lower bound to the shakedown limit is derived and added to the LMM. The theoretical development and numerical implementation of this calculation is detailed. Convergence improvements are also investigated to improve the numerical difficulties often suffered by lower bound shakedown calculations. The LMM is implemented in Abaqus through user subroutines. To make the LMM suitable for regular use a user interface has been created via a plug-in for Abaqus. This plug-in automatically configures the model for the analysis, meaning that the user now has access to LMM analyses without having to carry out the code changes which were required with the research version of the method. The resulting analysis tool has been delivered to EDF so their engineers can now access accurate shakedown analyses through a convenient user-interface.
35
Li, Le. "Online stochastic algorithms." Thesis, Angers, 2018. http://www.theses.fr/2018ANGE0031.
Full textAbstract:
Cette thèse travaille principalement sur trois sujets. Le premier concentre sur le clustering en ligne dans lequel nous présentons un nouvel algorithme stochastique adaptatif pour regrouper des ensembles de données en ligne. Cet algorithme repose sur l'approche quasi-bayésienne, avec une estimation dynamique (i.e., dépendant du temps) du nombre de clusters. Nous prouvons que cet algorithme atteint une borne de regret de l'ordre et que cette borne est asymptotiquement minimax sous la contrainte sur le nombre de clusters. Nous proposons aussi une implémentation par RJMCMC. Le deuxième sujet est lié à l'apprentissage séquentiel des courbes principales qui cherche à résumer une séquence des données par une courbe continue. Pour ce faire, nous présentons une procédure basée sur une approche maximum a posteriori pour le quasi-posteriori de Gibbs. Nous montrons que la borne de regret de cet algorithme et celui de sa version adaptative est sous-linéaire en l'horizon temporel T. En outre, nous proposons une implémentation par un algorithme glouton local qui intègre des éléments de sleeping experts et de bandit à plusieurs bras. Le troisième concerne les travaux qui visent à accomplir des tâches pratiques au sein d'iAdvize, l'entreprise qui soutient cette thèse. Il inclut l'analyse des sentiments pour les messages textuels et l'implémentation de chatbot dans lesquels la première est réalisé par les méthodes classiques dans la fouille de textes et les statistiques et la seconde repose sur le traitement du langage naturel et les réseaux de neurones artificielsThis thesis works mainly on three subjects. The first one is online clustering in which we introduce a new and adaptive stochastic algorithm to cluster online dataset. It relies on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent) estimation of the (unknown and changing) number of clusters. We prove that this algorithm has a regret bound of the order of and is asymptotically minimax under the constraint on the number of clusters. A RJMCMC-flavored implementation is also proposed. The second subject is related to the sequential learning of principal curves which seeks to represent a sequence of data by a continuous polygonal curve. To this aim, we introduce a procedure based on the MAP of Gibbs-posterior that can give polygonal lines whose number of segments can be chosen automatically. We also show that our procedure is supported by regret bounds with sublinear remainder terms. In addition, a greedy local search implementation that incorporates both sleeping experts and multi-armed bandit ingredients is presented. The third one concerns about the work which aims to fulfilling practical tasks within iAdvize, the company which supports this thesis. It includes sentiment analysis for textual messages by using methods in both text mining and statistics, and implementation of chatbot based on nature language processing and neural networks
36
Oberst, Achim. "The bounds of being : existence - death - language : the existential-ontological connection of language and death in Heidegger's being and time : an exegetical approach to Heidegger's linguistic ontology." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=36783.
Full textAbstract:
The thesis of this dissertation can be summed up in a nutshell: Death forces language into being. When faced with the possibility of non-existence, humans are confronted with the reality of nothingness and respond (with speech) by filling the fathomless emptiness of the abyss with permanent meaning.Chapter I outlines this thesis in detail as grounded in Heidegger's existential analytic and provides examples of some of its manifold applications in both everyday life and literary experience.
The thesis is supported in three main steps. In Part A I explore the problem of human subjectivity in terms of Heidegger's existential ontology in particular with respect to the question of language and death. I show that the process of language evolution can be understood as an ongoing conflict resolution between the two fundamental modes of human selfhood. The gap between authenticity and inauthenticity is resolved in the dialogue of language. Death, which is nothing other than the nothingness of this yawning gap where one can easily lose oneself, thus appears to be a main factor of language origination, and, paradoxically, at the same time it finds its supersession in language.
In Part B I demonstrate that Heidegger has an answer to the question of language origins, and what his answer is. Both the "That" and the "What" lead to the further question of why language "exists" at all. The answer is simple. If Heidegger's phenomenological ontology can be understood as a linguistic ontology, as argued in Chapter I, the relationship between death and language follows. Death motivates the emergence of language, because it is the "existence" of language that can counteract the facticity of death.
In Part C I derive support for such a position from Hegel and Benjamin in order to demonstrate that the position is tenable also for other thinkers. In the concluding chapter on Parmenides I show that, with Heidegger, it is possible to see in Parmenides the originator of the thought that the "divine" ontological status of language constitutes, in its persistent thinking of being, a continued existence that defies the facticity of death.
37
Vopršálek, Radek. "Závislost výkonů ve vybraných atletických disciplínách žáků druhého stupně ZŠ." Master's thesis, 2016. http://www.nusl.cz/ntk/nusl-343198.
Full textAbstract:
NAME: Determine the dependence of performance in selected athletic disciplines students in primary schools AUTHOR: Radek Vopršálek DEPARTMENT: Katedra tělesné výchovy SUPERVISOR: PhDr. PaedDr. Ladislav Kašpar, Ph.D. ABSTRACT: The aim of this thesis is to explore the relationship and dependency between performances in chosen sports disciplines for pupils of primary school. The disciplines I have chosen to determine the relative performance are: long jump and 60 meters sprint. In the theoretical part there is a description and analysis of these sports disciplines. In the practical part there is a measurement of pupils' performances in that two sports disciplines and creating a dependency relationship between them. KEYWORDS: Long jump, Bounce, Run, Relationship.
38
Ansari, Faiyaz, and 安颯. "Study of Jump-Stay Sequence and Bound of MTTR in Heterogeneous Environment for Cognitive Radio Networks." Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5650013%22.&searchmode=basic.
Full textAbstract:
碩士國立中興大學
通訊工程研究所
107
In this thesis, the construction algorithm and structure of the jump-stay (JS) asynchronous-symmetric channel hopping (CH) sequences are studied. The JS algorithm is systematically rewritten in terms of shifted prime sequences. To generate CH sequences with different and optimized lengths, the JS algorithm is improved by changing the sequence parameters. The concept of shifted prime sequences is used to derive and formally prove the maximum-time-to-rendezvous (MTTR) bounds of the original and improved JS asynchronous-symmetric CH sequences under the homogeneous and heterogeneous environments in cognitive-radio networks. Finally, the MTTR and average TTR of the JS CH sequences are studied.