نتایج جستجو برای: semi weak

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

2005
Xiaoyun Wu Xiaoping Liang Hongmei Liu Jiwu Huang Guoping Qiu

Semi-fragile image authentication based on watermarking has drawn extensive attention. However, conventional watermarking techniques introduce irreversible distortions to the host signals and thus may not be allowable in some applications such as medical and military imaging. Though some reversible fragile authentication algorithms had been developed, reversible semi-fragile authentication pres...

2012
Ondrej Majer

In the paper I suggested that for many predicates P, the 'P-er than' relation is a strict weak order. Ondrej Majer asks why I assume that, given that I concentrate myself later in the paper on semi-orders. Well, in case the ordering relation can be made more precise by means of measurement phrases, there is no choice but to use a strict weak order. In fact, speaker's intuitions about a relation...

2016
Yan Yan Zhongwen Xu Ivor W. Tsang Guodong Long Yi Yang

Semi-supervised learning is proposed to exploit both labeled and unlabeled data. However, as the scale of data in real world applications increases significantly, conventional semisupervised algorithms usually lead to massive computational cost and cannot be applied to large scale datasets. In addition, label noise is usually present in the practical applications due to human annotation, which ...

Journal: :Studies in health technology and informatics 2013
Jing Zhang Monte S. Buchsbaum Kingwai Chu Erin A. Hazlett

This study is a method comparison of three region-of-interest (ROI) tracing approaches. fMRI images acquired during an event-related frequency discrimination task were used in this study. Three [(1) manual, (2) semi-automated, (3) automated] approaches were applied to generate the ROI in the caudate nucleus and extract fMRI hemodynamic response (HR) from the ROI. Less activation with weak and d...

2007
Damien Woods Turlough Neary

We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 symbols, and 2 states and 13 symbols, respectively. These machines are semi-weakly universal which means that on one side of the input they have an infinitely repeated word, and on the other side there is the usual infinitely repeated blank symbol. This work can be regarded as a continuation of ear...

Journal: :categories and general algebraic structures with applications 2015
camell kachour

we start this article by rebuilding higher operads of weak higher transformations, and correct those in cite{cambat}. as in cite{cambat} we propose an operadic approach for weak higher $n$-transformations, for each $ninmathbb{n}$, where such weak higher $n$-transformations are seen as algebras for specific contractible higher operads. the last chapter of this article asserts that, up to precise...

2010
David J. Starling P. Ben Dixon Andrew N. Jordan John C. Howell

We demonstrate an experiment which utilizes a Sagnac interferometer to measure a change in optical frequency of 129 ± 7 kHz/√Hz with only 2 mW of continuous-wave, single-mode input power. We describe the measurement of a weak value and show how even higher-frequency sensitivities may be obtained over a bandwidth of several nanometers. This technique has many possible applications, such as preci...

Journal: :categories and general algebraic structures with applications 2013
wei he

semi-regular locales are extensions of the classical semiregularspaces. we investigate the conditions such that semi-regularizationis a functor. we also investigate the conditions such that semi-regularizationis a reflection or coreflection.

2017
FEDOR SUKOCHEV

This paper studies the relationship between the singular trace of a weak trace class operator and the asymptotic behaviour of its ζ-function at its leading singularity. For Dixmier measurable and universally measurable operators we describe their measurability in terms of the behaviour of the ζ-function. We use recent advances in singular trace theory and a new approach based on Tauberian theor...

Journal: :J. Comput. Syst. Sci. 1997
Pascal Koiran

We propose a weak version of the Blum Shub Smale model of computation over the real numbers. In this weak model only a ``moderate'' usage of multiplications and divisions is allowed. The class of boolean languages recognizable in polynomial time is shown to be the complexity class P poly. The main tool is a result on the existence of small rational points in semi-algebraic sets which is of inde...

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

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