نتایج جستجو برای: automatically bounded and w w continuous

تعداد نتایج: 16932728  

2010
BRIAN JEFFERIES

Abstract. Let A1, A2 be bounded linear operators acting on a Banach space E. A pair (μ1, μ2) of continuous probability measures on [0, 1] determines a functional calculus f 7−→ fμ1,μ2(A1, A2) for analytic functions f by weighting all possible orderings of operator products of A1 and A2 via the probability measures μ1 and μ2. For example, f 7−→ fμ,μ(A1, A2) is the Weyl functional calculus with e...

Journal: :bulletin of the iranian mathematical society 0
y. ding department of mathematics‎, ‎east china university of science and technology‎, ‎shanghai‎, ‎china. y. mao department of mathematics‎, ‎qinghai normal university‎, ‎xining‎, ‎qinghai 810008‎, ‎china.

‎let $mathcal{a}$ be a unital banach algebra‎, ‎$mathcal{m}$ be a left $mathcal{a}$-module‎, ‎and $w$ in $mathcal{z}(mathcal{a})$ be a left separating point of $mathcal{m}$‎. ‎we show that if $mathcal{m}$ is a unital left $mathcal{a}$-module and $delta$ is a linear mapping from $mathcal{a}$ into $mathcal{m}$‎, ‎then the following four conditions are equivalent‎: ‎(i) $delta$ is a jordan left de...

2012
Roland Schäfer Felix Bildhauer

Over the last decade, methods of web corpus construction and the evaluation of web corpora have been actively researched. Prominently, the WaCky initiative has provided both theoretical results and a set of web corpora for selected European languages. We present a software toolkit for web corpus construction and a set of siginificantly larger corpora (up to over 9 billion tokens) built using th...

Journal: :CoRR 2014
Hossein Azgomi Masumeh Ghasemi Mahsayeh Masoud Mohammadi Milad Moradi

A basic topic in mining of massive dataset is finding similar items. As an example, finding similar documents can be recommended. In this case many methods are existed. For example, Shingling method and length based filtering are one of them. In Shingling method, from each document, substrings have been selected with symbol name and, they are placed on one set. For finding similar documents, th...

Journal: :Synthese 2010
Anna-Sofia Maurin

Trope theory is the view that the world is a world of abstract particular qualities. But if all there is are tropes, how do we account for the truth of propositions ostensibly made true by some concrete particular? A common answer is that concrete particulars are nothing but tropes in compresence. This answer seems vulnerable to an argument (first presented by F. H. Bradley) according to which ...

2013
BRADLEY DEAN WINTERS Matasha Dhar Yan Dong

by Bradley Dean Winters, Ph.D. Washington State University December 2012

1998
Clark F. Olson Larry H. Matthies

This paper describes marimunl likelihood estirncr-tion techniques for performirlg rover localizatio?t in natural terrain by matching range ntaps. An OCCUpancy map of the local terrain isgertef'ated usirigstcreo visiou. The positioa of the rover rvith respect to a previously generated occupancy map M then computed by comparing the maps using a probabdistic formulation of [[ausdoz-ff matching iec...

2015
Lindsey K. Albertson Leonard S. Sklar Bradley J. Cardinale

Rennie on “A mechanistic model linking insect (Hydropsychidae) silk nets to incipient sediment motion in gravel-bedded streams” Lindsey K. Albertson, Leonard S. Sklar, and Bradley J. Cardinale Stroud Water Research Center, Avondale, Pennsylvania, USA, Earth and Climate Sciences, San Francisco State University, San Francisco, California, USA, School of Natural Resources and Environment, Universi...

Journal: :Electr. J. Comb. 2008
Khodabakhsh Hessami Pilehrood Tatiana Hessami Pilehrood

Using WZ-pairs we present simpler proofs of Koecher, Leshchiner and BaileyBorwein-Bradley’s identities for generating functions of the sequences {ζ(2n+2)}n≥0 and {ζ(2n + 3)}n≥0. By the same method, we give several new representations for these generating functions yielding faster convergent series for values of the Riemann zeta function.

Journal: :Discussiones Mathematicae Graph Theory 2004
Chandrashekar Adiga H. N. Ramaswamy D. D. Somashekara

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید