نتایج جستجو برای: lastly
تعداد نتایج: 19265 فیلتر نتایج به سال:
Good Morning! It is a great pleasure to participate in this meeting. My remarks will focus on four aspects. First, the Chinese economic development against the backdrop of globalization; second, challenges associated with WTO accession facing the Chinese industries; third, our strategies to cope with these challenges; and lastly, prospects of Sino-Latin economic and trade relations. I will also...
The first objective of this paper is to prove the existence and uniqueness of global solutions for a Kirchhoff-type wave equation with nonlinear dissipation of the form Ku'' + M(|A (1/2) u|(2))Au + g(u') = 0 under suitable assumptions on K, A, M(·), and g(·). Next, we derive decay estimates of the energy under some growth conditions on the nonlinear dissipation g. Lastly, numerical simulations ...
Given an aperiodic random walk on a finite graph, an expression will be derived for the hitting times in terms of the eigenvalues of the transition matrix. The process of diagonalizing the transition matrix and its associated fundamental matrix will be discussed. These results will then be applied to a random walk on a rook graph. Lastly, a cover time bound depending on the hitting times will b...
The current status of ligand gated ion channel P2X and G protein-coupled P2Y receptor subtypes is described. This is followed by a summary of what is known of the distribution and roles of these receptor subtypes. Potential therapeutic targets of purinoceptors are considered, including those involved in cardiovascular, nervous, respiratory, urinogenital, gastrointestinal, musculo-skeletal and s...
We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, δ ≤ Z(G) where δ is the minimum degree, in the triangle-free case. In particular, we show that 2δ− 2 ≤ Z(G) for graphs with girth of at least 5, and this can be further improved when G has a small cut set. Lastly, we make a conjecture that the lower bound for Z(G) increases as a function of the g...
Non-monotonic reasoning typically deals with three kinds of knowledge. Facts are meant to describe immutable statements of the environment. Rules define relationships among elements. Lastly, an ordering among the rules, in the form of a superiority relation, establishes the relative strength of rules. To revise a non-monotonic theory, we can change either one of these three elements. We prove t...
Non –crossing set partitions are counted by the Catalan numbers and have been extensively studied in mathematics. We introduce the concept of a non-crossing tree partition and then use generating functions to count the number non-crossing tree partitions in Ordered and Binary Phylogenetic trees. In addition, we explore the connection between convexity, tree partitions and independent sets. Last...
This paper surveys three classes of haptic interface devices that were developed at McGill University since 1993. One class covers devices which output planar forces and explore various ways in which the human hand can input data. Another kind of device is meant to reproduce with fidelity the tasks corresponding to the manipulation of small tools in three dimensions. Lastly, we investigated a n...
Also, the power-handling capacity of a transmission line is maximum when it is "flat", i.e., operating at low SWR. Lastly, it is important to be able to interconnect a number of different components into a system, and the only way that can be done reliably and predictably is by constraining the reflection coefficients of the various interfaces through impedance matching. Multiple reflections ca...
I describe in this paper a solution to the Sleeping Beauty problem. I begin with the consensual emerald case and I also discuss Bostrom's Incubator gedanken. I address then the Sleeping Beauty problem. I argue that the root cause of the flaw in the argument for 1/3 is an erroneous assimilation with a repeated experiment. Lastly, I present an informative variant of the original Sleeping Beauty e...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید