نتایج جستجو برای: unmatched count technique

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

Journal: :Science 2005
Michel Thiebaut de Schotten Marika Urbanski Hugues Duffau Emmanuelle Volle Richard Lévy Bruno Dubois Paolo Bartolomeo

Intraoperative electrical stimulation, which temporarily inactivates restricted regions during brain surgery, can map cognitive functions in humans with spatiotemporal resolution unmatched by other methods. Using this technique, we found that stimulation of the right inferior parietal lobule or the caudal superior temporal gyrus, but not of its rostral portion, determined rightward deviations o...

2008
Keiji Yasuda Ruiqiang Zhang Hirofumi Yamamoto Eiichiro Sumita

Target task matched parallel corpora are required for statistical translation model training. However, training corpora sometimes include both target task matched and unmatched sentences. In such a case, training set selection can reduce the size of the translation model. In this paper, we propose a training set selection method for translation model training using linear translation model inte...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان خراسان رضوی - دانشکده علوم پایه 1390

تغییرات غلظت گاز رادون درون آبهای زیرزمینی، یکی از پیش نشانگرهای شناخته شده زلزله می باشد. در گذشته روش های متعددی جهت اندازه گیری غلظت رادون درون آب ارائه شده است. در این پایان نامه با استفاده از کد mcnpx امکان اندازه گیری مستقیم تغییرات گاز رادون درون آب با استفاده از آشکارساز گایگر مولر مورد بررسی قرار گرفته است. برای این منظور یک آشکارساز گایگر مولر قرار گرفته در استوانه ای تفلونی که در آب ...

Journal: :Microprocessors and Microsystems - Embedded Hardware Design 2014
Asim Datta Dipankar Mukherjee Hiranmay Saha

This paper presents a novel digital sinusoidal pulse-width modulation (SPWM) technique based on immediate calculation of duty cycle count (DCC) values of pulses with high speed Harvard architecture based RISC controllers. The DCC values are calculated with the multiplication of an instant modulation index count (MIC) and a preloaded sine count value (SCV) table in the program memory of the cont...

2006
P. Revesz

We present novel Max-Count, Threshold-Range, Threshold-Count, Threshold-Sum, ThresholdAverage and Count-Range estimation algorithms for d dimensions based on a new spatiotemporal index. Each query runs in constant time and is based on a skew aware indexing technique with static size buckets. This allows constant time inserts, deletes and updates for highly dynamic spatiotemporal databases. The ...

Journal: :Kybernetika 2000
A. Jafari Koshkouei Alan Solon Ivor Zinober

This paper presents sufficient conditions for the sliding mode control of a system with disturbance input. The behaviour of the sliding dynamics in the presence of unmatched uncertainty is also studied. When a certain sufficient condition on the gain feedback matrix of the discontinuous controller and the disturbance bound holds, then the disturbance does not affect the sliding system. The desi...

2010
Mike C. Parent John B. Williamson

Predoctoral internship represents an important capstone in the training of clinical and counseling psychologists. However, in the past decade there has been growing concern over the number of applicants to internship who have not been matched to an internship site. We investigated the scope of the internship match problem by assessing program-level contributions to the number of unmatched inter...

Journal: :Vision Research 2005
Hiroyuki Mitsudo Sachio Nakamizo Hiroshi Ono

A visual search task was used to investigate the spatially parallel coding of depth from binocular disparity and from binocularly unmatched features. Experiment 1, using disparity noise, showed that detectability is higher for illusory phantom targets defined by unmatched features than for disparity-defined targets, although the two targets were equated as to theoretically minimum depth. Experi...

Journal: :Social Choice and Welfare 2016
Keisuke Bando Kenzo Imamura

We consider an allocation problem with indivisible goods, and characterize weak Maskin monotonic allocation rules based on the robustness to group manipulation. Specifically, we introduce a new condition called unimprovement property of unmatched agents which means that unmatched agents cannot be strictly better off through any group manipulation. We show that a non-wasteful allocation rule sat...

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

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