Готові списки джерел за темами / Fast retrieval

Добірка наукової літератури з теми "Fast retrieval"

Автор: Grafiati
Опубліковано: 3 вересня 2022
Оновлено: 18 вересня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Fast retrieval".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Книги
  4. Частини книг
  5. Тези доповідей конференцій
  6. Звіти організацій

Статті в журналах з теми "Fast retrieval":

1

Fournier, N., P. Stammes, M. de Graaf, R. van der A, A. Piters, M. Grzegorski, and A. Kokhanovsky. "Improving cloud information over deserts from SCIAMACHY Oxygen A-band measurements." Atmospheric Chemistry and Physics 6, no. 1 (January 25, 2006): 163–72. http://dx.doi.org/10.5194/acp-6-163-2006.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Abstract. The retrieval of column densities and concentration profiles of atmospheric trace gas species from satellites is sensitive to light scattered by clouds. The SCanning Imaging Absorption SpectroMeter for Atmospheric CHartographY (SCIAMACHY) instrument on the Envisat satellite, principally designed to retrieve trace gases in the atmosphere, is also capable of detecting clouds. FRESCO (Fast Retrieval Scheme for Clouds from the Oxygen A-band) is a fast and robust algorithm providing cloud information from the O2 A-band for cloud correction of ozone. FRESCO provides a consistent set of cloud products by retrieving simultaneously effective cloud fraction and cloud top pressure. The FRESCO retrieved values are compared with the SCIAMACHY Level 2 operational cloud fraction of OCRA (Optical Cloud Recognition Algorithm) but, also, with cloud information from HICRU (Heidelberg Iterative Cloud Retrieval Utilities), SACURA (SemiAnalytical CloUd Retrieval Algorithm) and the MODIS (Moderate Resolution Imaging Spectroradiometer) instrument. The results correlate well, but FRESCO overestimates cloud fraction over deserts. Thus, to improve retrievals at these locations, the FRESCO surface albedo databases are decontaminated from the presence of desert dust aerosols. This is achieved by using the GOME Absorbing Aerosol Index. It is shown that this approach succeeds well in producing more accurate cloud information over the Sahara.
2

Geigle, Gregor, Jonas Pfeiffer, Nils Reimers, Ivan Vulić, and Iryna Gurevych. "Retrieve Fast, Rerank Smart: Cooperative and Joint Approaches for Improved Cross-Modal Retrieval." Transactions of the Association for Computational Linguistics 10 (2022): 503–21. http://dx.doi.org/10.1162/tacl_a_00473.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Abstract Current state-of-the-art approaches to cross- modal retrieval process text and visual input jointly, relying on Transformer-based architectures with cross-attention mechanisms that attend over all words and objects in an image. While offering unmatched retrieval performance, such models: 1) are typically pretrained from scratch and thus less scalable, 2) suffer from huge retrieval latency and inefficiency issues, which makes them impractical in realistic applications. To address these crucial gaps towards both improved and efficient cross- modal retrieval, we propose a novel fine-tuning framework that turns any pretrained text-image multi-modal model into an efficient retrieval model. The framework is based on a cooperative retrieve-and-rerank approach that combines: 1) twin networks (i.e., a bi-encoder) to separately encode all items of a corpus, enabling efficient initial retrieval, and 2) a cross-encoder component for a more nuanced (i.e., smarter) ranking of the retrieved small set of items. We also propose to jointly fine- tune the two components with shared weights, yielding a more parameter-efficient model. Our experiments on a series of standard cross-modal retrieval benchmarks in monolingual, multilingual, and zero-shot setups, demonstrate improved accuracy and huge efficiency benefits over the state-of-the-art cross- encoders.1
3

Desmons, Marine, Ping Wang, Piet Stammes, and L. Gijsbert Tilstra. "FRESCO-B: a fast cloud retrieval algorithm using oxygen B-band measurements from GOME-2." Atmospheric Measurement Techniques 12, no. 4 (April 23, 2019): 2485–98. http://dx.doi.org/10.5194/amt-12-2485-2019.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Abstract. The FRESCO (Fast Retrieval Scheme for Clouds from the Oxygen A band) algorithm is a simple, fast and robust algorithm used to retrieve cloud information in operational satellite data processing. It has been applied to GOME-1 (Global Ozone Monitoring Experiment), SCIAMACHY (Scanning Imaging Absorption Spectrometer for Atmospheric Chartography), GOME-2 and more recently to TROPOMI (Tropospheric Monitoring Instrument). FRESCO retrieves effective cloud fraction and cloud pressure from measurements in the oxygen A band around 761 nm. In this paper, we propose a new version of the algorithm, called FRESCO-B, which is based on measurements in the oxygen B band around 687 nm. Such a method is interesting for vegetated surfaces where the surface albedo is much lower in the B band than in the A band, which limits the ground contribution to the top-of-atmosphere reflectances. In this study we first perform retrieval simulations. These show that the retrieved cloud pressures from FRESCO-B and FRESCO differ only between −10 and +10 hPa, except for high, thin clouds over vegetation where the difference is larger (about +15 to +30 hPa), with FRESCO-B yielding higher pressure. Next, inter-comparison between FRESCO-B and FRESCO retrievals over 1 month of GOME-2B data reveals that the effective cloud fractions retrieved in the O2 A and B bands are very similar (mean difference of 0.003), while the cloud pressures show a mean difference of 11.5 hPa, with FRESCO-B retrieving higher pressures than FRESCO. This agrees with the simulations and is partly due to deeper photon penetrations of the O2 B band in clouds compared to the O2 A-band photons and partly due to the surface albedo bias in FRESCO. Finally, validation with ground-based measurements shows that the FRESCO-B cloud pressure represents an altitude within the cloud boundaries for clouds that are not too far from the Lambertian reflector model, which occurs in about 50 % of the cases.
4

Jonkheid, B. J., R. A. Roebeling, and E. van Meijgaard. "A fast SEVIRI simulator for quantifying retrieval uncertainties in the CM SAF cloud physical property algorithm." Atmospheric Chemistry and Physics 12, no. 22 (November 20, 2012): 10957–69. http://dx.doi.org/10.5194/acp-12-10957-2012.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Abstract. The uncertainties in the cloud physical properties derived from satellite observations make it difficult to interpret model evaluation studies. In this paper, the uncertainties in the cloud water path (CWP) retrievals derived with the cloud physical properties retrieval algorithm (CPP) of the climate monitoring satellite application facility (CM SAF) are investigated. To this end, a numerical simulator of MSG-SEVIRI observations has been developed that calculates the reflectances at 0.64 and 1.63 μm for a wide range of cloud parameter values, satellite viewing geometries and surface albedos using a plane-parallel radiative transfer model. The reflectances thus obtained are used as input to CPP, and the retrieved values of CWP are compared to the original input of the simulator. Cloud parameters considered in this paper refer to e.g. sub-pixel broken clouds and the simultaneous occurrence of ice and liquid water clouds within one pixel. These configurations are not represented in the CPP algorithm and as such the associated retrieval uncertainties are potentially substantial. It is shown that the CWP retrievals are very sensitive to the assumptions made in the CPP code. The CWP retrieval errors are generally small for unbroken single-layer clouds with COT > 10, with retrieval errors of ~3% for liquid water clouds to ~10% for ice clouds. In a multi-layer cloud, when both liquid water and ice clouds are present in a pixel, the CWP retrieval errors increase dramatically; depending on the cloud, this can lead to uncertainties of 40–80%. CWP retrievals also become more uncertain when the cloud does not cover the entire pixel, leading to errors of ~50% for cloud fractions of 0.75 and even larger errors for smaller cloud fractions. Thus, the satellite retrieval of cloud physical properties of broken clouds as well as multi-layer clouds is complicated by inherent difficulties, and the proper interpretation of such retrievals requires extra care.
5

Masiello, Guido, Carmine Serio, Sara Venafra, Laurent Poutier, and Frank-M. Göttsche. "SEVIRI Hyper-Fast Forward Model with Application to Emissivity Retrieval." Sensors 19, no. 7 (March 29, 2019): 1532. http://dx.doi.org/10.3390/s19071532.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Timely processing of observations from multi-spectral imagers, such as SEVIRI (Spinning Enhanced Visible and Infrared Imager), largely depends on fast radiative transfer calculations. This paper mostly concerns the development and implementation of a new forward model for SEVIRI to be applied to real time processing of infrared radiances. The new radiative transfer model improves computational time by a factor of ≈7 compared to the previous versions and makes it possible to process SEVIRI data at nearly real time. The new forward model has been applied for the retrieval of surface parameters. Although the scheme can be applied for the simultaneous retrieval of temperature and emissivity, the paper mostly focuses on emissivity. The inverse scheme relies on a Kalman filter approach, which allows us to exploit a sequential processing of SEVIRI observations. Based on the new forward model, the paper also presents a validation retrieval performed with in situ observations acquired during a field experiment carried out in 2017 at Gobabeb (Namib desert) validation station. Furthermore, a comparison with IASI (Infrared Atmospheric Sounder Interferometer) emissivity retrievals has been performed as well. It has been found that the retrieved emissivities are in good agreement with each other and with in situ observations, i.e., average differences are generally well below 0.01.
6

Fournier, N., P. Stammes, M. de Graaf, R. van der A, A. Piters, R. Koelemeijer, and A. Kokhanovsky. "Improving cloud information over deserts from SCIAMACHY O<sub>2</sub> A-band." Atmospheric Chemistry and Physics Discussions 5, no. 4 (August 16, 2005): 6013–39. http://dx.doi.org/10.5194/acpd-5-6013-2005.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Abstract. The retrieval of column densities and concentration profiles of atmospheric trace gas species from satellites is sensitive to light scattered by clouds. The SCanning Imaging Absorption SpectroMeter for Atmospheric CHartographY (SCIAMACHY) instrument on the Envisat satellite, principally designed to retrieve trace gases in the atmosphere, is also capable of detecting clouds. FRESCO (Fast Retrieval Scheme for Clouds from the Oxygen A-band) is a fast and robust algorithm providing cloud information from the O2 A-band for cloud correction of ozone. FRESCO provides a consistent set of cloud products by retrieving simultaneously effective cloud fraction and cloud top pressure. The FRESCO retrieved values are compared with both the SCIAMACHY Level 2 operational cloud fraction of OCRA (Optical Cloud Recognition Algorithm) and cloud information deduced from the MODIS instrument. The results correlate well, but FRESCO overestimates cloud fraction over deserts. Thus, to improve retrievals at these locations, the FRESCO surface albedo databases are decontaminated from the presence of desert dust aerosols. This is achieved by using a GOME Absorbing Aerosol Index. It is shown that this approach succeeds well in producing more accurate cloud information over the Sahara.
7

Smith, William L., Elisabeth Weisz, Stanislav V. Kireev, Daniel K. Zhou, Zhenglong Li, and Eva E. Borbas. "Dual-Regression Retrieval Algorithm for Real-Time Processing of Satellite Ultraspectral Radiances." Journal of Applied Meteorology and Climatology 51, no. 8 (August 2012): 1455–76. http://dx.doi.org/10.1175/jamc-d-11-0173.1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
AbstractA fast physically based dual-regression (DR) method is developed to produce, in real time, accurate profile and surface- and cloud-property retrievals from satellite ultraspectral radiances observed for both clear- and cloudy-sky conditions. The DR relies on using empirical orthogonal function (EOF) regression “clear trained” and “cloud trained” retrievals of surface skin temperature, surface-emissivity EOF coefficients, carbon dioxide concentration, cloud-top altitude, effective cloud optical depth, and atmospheric temperature, moisture, and ozone profiles above the cloud and below thin or broken cloud. The cloud-trained retrieval is obtained using cloud-height-classified statistical datasets. The result is a retrieval with an accuracy that is much higher than that associated with the retrieval produced by the unclassified regression method currently used in the International Moderate Resolution Imaging Spectroradiometer/Atmospheric Infrared Sounder (MODIS/AIRS) Processing Package (IMAPP) retrieval system. The improvement results from the fact that the nonlinear dependence of spectral radiance on the atmospheric variables, which is due to cloud altitude and associated atmospheric moisture concentration variations, is minimized as a result of the cloud-height-classification process. The detailed method and results from example applications of the DR retrieval algorithm are presented. The new DR method will be used to retrieve atmospheric profiles from Aqua AIRS, MetOp Infrared Atmospheric Sounding Interferometer, and the forthcoming Joint Polar Satellite System ultraspectral radiance data.
8

Sun, Jian Fei, Zhi Yi Qu, and Kun Yu Wang. "Fast Image Retrieval Based Weighted Color AutoCorrelogram and LSH Indexing." Applied Mechanics and Materials 667 (October 2014): 208–12. http://dx.doi.org/10.4028/www.scientific.net/amm.667.208.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
With the Rapid Development of Internet, Image Retrieval is more and more Important,For Image Retrieval, it Requires Not only a Real-Time Retrieval Speed but also the Accuracy of the Results.The Method Described in this Article: Firstly,We should Quantify the HSV Color Space of the Image Non-Uniformly,and then Extract the Weighted Color Autocorrelogram ,and Finally Build an Indexing Library Based Locality-Sensitive Hashing.The Method Successfully Solves the Problem of Dimension Disaster.With Different Scales Image Datasets，the Experimental Results Show that the Method can Retrieve Similar Images Quickly with the Suitable Parameters Selected.
9

Papadias, D., M. Mantzourogiannis, and I. Ahmad. "Fast retrieval of similar configurations." IEEE Transactions on Multimedia 5, no. 2 (June 2003): 210–22. http://dx.doi.org/10.1109/tmm.2003.811629.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Swanson, Mitchell D. "Fast progressively refined image retrieval." Journal of Electronic Imaging 7, no. 3 (July 1, 1998): 443. http://dx.doi.org/10.1117/1.482611.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел
Також вас можуть зацікавити розширені добірки на тему "Fast retrieval" для конкретних типів джерел:
Статті в журналах Дисертації Книги

Дисертації з теми "Fast retrieval":

1

Pesavento, Marius. "Fast algorithms for multidimensional harmonic retrieval." [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=975415328.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Cao, Hui, Noboru Ohnishi, Yoshinori Takeuchi, Tetsuya Matsumoto, and Hiroaki Kudo. "FAST HUMAN POSE RETRIEVAL USING APPROXIMATE CHAMFER DISTANCE." INTELLIGENT MEDIA INTEGRATION NAGOYA UNIVERSITY / COE, 2006. http://hdl.handle.net/2237/10437.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Perry, S. T. "Fast interactive object delineation in images for content based retrieval and navigation." Thesis, University of Southampton, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286748.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Kuan, Joseph. "Image texture analysis and fast similarity search for content based retrieval and navigation." Thesis, University of Southampton, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287321.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Lardeux, Florian. "Robust Modelling and Efficient Recognition of Quasi-Flat Objects — Application to Ancient Coins." Thesis, La Rochelle, 2022. http://www.theses.fr/2022LAROS002.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Les objets quasi-plans sont obtenus à partir d’une matrice qui définit des caractéristiques spécifiques observables dans leur gravure. Les exemples de ce type d’objets incluent les timbres à sec, les timbres amphoriques ou encore les pièces de monnaies anciennes. Les objetsquasi-plans sont par conséquent des formes très plates sur lesquelles un relief caractéristique est inscrit. Reconnaître de tels objets est une tâche compliquée car de nombreux verrous entrent en jeu. Le relief d’objets quasi-plans est sujet à des déformations non rigides et les conditions lumineuses influencent la façon dont ils sont perçus. De plus, ces objets ont pu subir diverses détériorations menant à l’occlusion de certaines parties de leur relief. Dans cette dissertation, nous adressons le problème de la reconnaissance d’objets quasi-plans. Cette thèse est articulée autour de trois grands axes. Le premier axe vise à créer un modèle adapté pour représenter l’objet en exposant ces caractéristiques et en prenant en compte les divers verrous précités. Dans ce but, le concept de carte d’énergie lumineuse est introduit. Les deuxième et troisième axes introduisent des stratégies de reconnaissance. D’un côté, nous proposons l’utilisation de contours de l’objet en tant que données caractéristiques. Ceux-ci sont représentés via un modèle de signature à partir duquel sont calculés des descripteurs. Afin de stocker, retrouver et comparer ces descripteurs, une structure de donnée basée sur des tableaux associatifs, les LACS, est présentée ; elle permet une reconnaissance rapide de contours similaires. D’un autre côté, l’utilisation de textures comme descripteurs de l’objet est envisagée. Dans cette partie, l’étude est centrée sur l’emploi de régions 2D et leur description comme moyen de reconnaissance. Un angle similaire est adopté pour stocker et retrouver l’information ; une structure de donnée proche de celle précédemment décrite, mais plus complexe, est introduite
Quasi-flat objects are obtained from a matrix which defines specific features observable in their engraving. Some examples of these are dry stamps, amphora stamps or ancient coins. Quasi-flat objects are subsequently understood as very flat shapes onto which a characteristic relief is inscribed. Recognizing such objects is not an easy feat as many barriers come into play. The relief of quasi-flat objects is prone to non-rigid deformations and the illumination conditions influence the perception of the object’s relief. Furthermore, these items may have undergone various deteriorations, leading to the occlusion of some parts of their relief. In this thesis, we tackle the issue of recognizing quasi-flat objects. This work is articulated around three major axes. The first one aims at creating a model to represent the objects both by highlighting their main characteristics and taking into account the afore mentioned barriers. To this aim, the concept of multi-light energy map is introduced. The second and third axes introduce strategies for the recognition. On the one hand, we propose the use of contours as main features. Contours are described via a signature model from which specific descriptors are calculated. In order to store, retrieve and match those features, a data structure based on associative arrays, the LACS system, is introduced, which enables a fast retrieval of similar contours. On the other hand, the use of textures is investigated. The scope here is centered on the use of specific 2D regions and their description in order to perform the recognition. A similar angle is taken to store and retrieve the information as a similar, yet a more complex data structure is introduced
6

au, n. jackson@murdoch edu, and Natalie Deanne Jackson. "Simple arithmetic processing : fact retrieval mechanisms and the influence of individual difference, surface from, problem type and split on processing." Murdoch University, 2006. http://wwwlib.murdoch.edu.au/adt/browse/view/adt-MU20070717.114439.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Current theorising in the area of cognitive arithmetic suggests that simple arithmetic knowledge is stored in memory and accessed in the same way as word knowledge i.e., it is stored in a network of associations, with simple facts retrieved automatically from memory. However, to date, the main methodologies that have been employed to investigate automaticity in simple arithmetic processing (e.g., production and verification) have produced a wide variety of difficulties in interpretation. In an attempt to address this, the present series of investigations utilised a numerical variant of the well established single word semantic priming paradigm that involved the presentation of problems as primes (e.g., 2 + 3) and solutions as targets (e.g., 5), as they would occur in a natural setting. Adult university students were exposed to both addition and multiplication problems in each of three main prime target relationship conditions, including congruent (e.g., 2 + 3 and 5), incongruent (e.g., 2 + 3 and 13), and neutral conditions (X + Y and 5). When combined with a naming task and the use of short stimulus onset asynchronies (SOAs), this procedure enabled a more valid and reliable investigation into automaticity and the cognitive mechanisms underlying simple arithmetic processing. The first investigation in the present series addressed the question of automaticity in arithmetic fact retrieval, whilst the remaining investigations examined the main factors thought to influence simple arithmetic processing i.e., skill level, surface form, problem type and split. All factors, except for problem type, were found to influence processing in the arithmetic priming paradigm. For example, the results of all five investigations were consistent in revealing significant facilitation in naming congruent targets for skilled participants, following exposure to Arabic digit primes at the short SOA. Accordingly, the facilitation was explained in terms of the operation of an automatic spreading activation mechanism. Additionally, significant inhibitory effects in incongruent target naming were identified in skilled performance in all of the studies in the present series of investigations. Throughout the course of these investigations, these effects were found to vary with operation, surface form and SOA, and in the final investigation, the level of inhibition was found to vary with the split between the correct solution and the incongruent target. Consequently, a number of explanations were put forward to account for these effects. In the first two investigations, it was suggested that the inhibitory effects resulted from the use of a response validity checking mechanism, whilst in the final investigation, the results were more consistent with the activation of magnitude representations in memory (this can be likened to Dehaene’s, 1997, ‘number sense’). In contrast, the results of the third investigation led to the proposal that for number word primes, inhibition in processing results from the activation of phonological representations in memory, via a reading based mechanism. The present series of investigations demonstrated the utility of the numerical variant of the single word semantic priming paradigm for the investigation of simple arithmetic processing. Given its capacity to uncover the fundamental cognitive mechanisms at work in simple arithmetic operations, this methodology has many applications in future research.
7

Jackson, Natalie Deanne. "Simple arithmetic processing: fact retrieval mechanisms and the influence of individual difference, surface form, problem type and split on processing." Jackson, Natalie Deanne (2007) Simple arithmetic processing: fact retrieval mechanisms and the influence of individual difference, surface form, problem type and split on processing. PhD thesis, Murdoch University, 2007. http://researchrepository.murdoch.edu.au/108/.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Current theorising in the area of cognitive arithmetic suggests that simple arithmetic knowledge is stored in memory and accessed in the same way as word knowledge i.e., it is stored in a network of associations, with simple facts retrieved automatically from memory. However, to date, the main methodologies that have been employed to investigate automaticity in simple arithmetic processing (e.g., production and verification) have produced a wide variety of difficulties in interpretation. In an attempt to address this, the present series of investigations utilised a numerical variant of the well established single word semantic priming paradigm that involved the presentation of problems as primes (e.g., 2 + 3) and solutions as targets (e.g., 5), as they would occur in a natural setting. Adult university students were exposed to both addition and multiplication problems in each of three main prime target relationship conditions, including congruent (e.g., 2 + 3 and 5), incongruent (e.g., 2 + 3 and 13), and neutral conditions (X + Y and 5). When combined with a naming task and the use of short stimulus onset asynchronies (SOAs), this procedure enabled a more valid and reliable investigation into automaticity and the cognitive mechanisms underlying simple arithmetic processing. The first investigation in the present series addressed the question of automaticity in arithmetic fact retrieval, whilst the remaining investigations examined the main factors thought to influence simple arithmetic processing i.e., skill level, surface form, problem type and split. All factors, except for problem type, were found to influence processing in the arithmetic priming paradigm. For example, the results of all five investigations were consistent in revealing significant facilitation in naming congruent targets for skilled participants, following exposure to Arabic digit primes at the short SOA. Accordingly, the facilitation was explained in terms of the operation of an automatic spreading activation mechanism. Additionally, significant inhibitory effects in incongruent target naming were identified in skilled performance in all of the studies in the present series of investigations. Throughout the course of these investigations, these effects were found to vary with operation, surface form and SOA, and in the final investigation, the level of inhibition was found to vary with the split between the correct solution and the incongruent target. Consequently, a number of explanations were put forward to account for these effects. In the first two investigations, it was suggested that the inhibitory effects resulted from the use of a response validity checking mechanism, whilst in the final investigation, the results were more consistent with the activation of magnitude representations in memory (this can be likened to Dehaene's, 1997, 'number sense'). In contrast, the results of the third investigation led to the proposal that for number word primes, inhibition in processing results from the activation of phonological representations in memory, via a reading based mechanism. The present series of investigations demonstrated the utility of the numerical variant of the single word semantic priming paradigm for the investigation of simple arithmetic processing. Given its capacity to uncover the fundamental cognitive mechanisms at work in simple arithmetic operations, this methodology has many applications in future research.
8

Pinheiro, Josiane Melchiori. "A influência das folksonomias na eficiência da fase inicial de modelagem conceitual." Universidade Tecnológica Federal do Paraná, 2016. http://repositorio.utfpr.edu.br/jspui/handle/1/2831.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Fundação Araucária
Este estudo examina a hipótese que usar folksonomias induzidas dos sistemas de tagging colaborativo em modelagem conceitual deve reduzir o número de divergências entre os atores envolvidos no processo quando eles elicitam termos para serem usados no modelo, usando-se como baseline os termos extraídos de páginas Web baseados na frequência de termos. Usa como medida de eficiência o número de divergências, pois quanto menor o número de divergências, menor o tempo e o esforço necessários para criar o modelo conceitual. Descreve os experimentos controlados de modelagem conceitual que foram realizados com grupos experimentais que receberam a folksonomia e com grupos de controle que receberam termos extraídos de páginas Web. Os resultados descritos mostram que grupos experimentais e de controle obtiveram números similares de divergências. Outras medidas de eficiências, assim como o reuso dos termos nos artefatos da modelagem e a facilidade percebida ao realizar a tarefa de modelagem confirmaram os resultados obtidos pelo número de divergências, com uma eficiência ligeiramente maior entre os grupos experimentais.
This study examines the hypothesis that using folksonomies induced from collaborative tagging systems in conceptual modeling should reduce the number of divergences between actors when they elicit terms to be used in a model, using as baseline terms extracted from webpages based on term frequency. It uses as efficiency measure the number of divergences, because the fewer the divergences, the less time and effort required to create a conceptual model. It describes the controlled conceptual modeling experiments that were performed using experimental groups that received a folksonomy and control groups that received terms extracted from webpages. The results show that the experimental and control groups obtained similar numbers of divergences. Other efficiency measures, such as reuse of terms in the phases of conceptual modeling and perceived ease of performing the modeling task, confirmed the results obtained by the number of divergences, with slightly greater efficiency among the experimental groups.
9

Ho, Chia-Lin, and 何佳霖. "Compression and Fast Retrieval for Digital Waveform." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/73261928713281426620.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
碩士
國立臺灣大學
資訊工程學研究所
90
Among VLSI circuit design, functional verification has become an important part due to rapid extension of circuits functionalities in many consumer and industry products. During simulation for digital circuits, the waveforms are stored on disk for future investigation and will finally fill up huge amounts of disk space. Beside of disk consumption, browsing the waveform becomes difficult because the required data is distributed over a large file space. Hence, We developed a set of algorithms and techniques that can be used to compress digital waveform, and we also define a new waveform data format that provides random access to improve the retrievable speed. Experimental result show that the retrievable time can be increased above 100 times and we could almost achieve 10%~35% compression ration comparing to the size of traditional VCD format waveform.
10

Shieh, Wann-Yun, and 謝萬雲. "Fast Information Retrieval in Incremental Web Databases." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/92235606317310550552.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
博士
國立交通大學
資訊工程系
92
This dissertation proposes methodologies to (1) speedup information retrieval, (2) perform most-correlated-document-first retrieval, and (3) perform incremental index-update, for dynamically growing Web databases. This dissertation focuses on the indexing structure refinements by dealing with a most-widely-used one, called the inverted file. First, to speedup information retrieval, the dissertation deals with the inverted file by index compression, query-result caching. The objective is to minimize the query response time for database scale and current user behavior. Second, to perform most-correlated-document-first retrieval, the dissertation deals with the inverted file by tree-based index structuring. The objective is to retrieve the most correlated documents for user queries as soon as possible. Finally, to provide incremental index-update, the dissertation deals with the inverted file by spare-space allocation. The objective is to best guarantee that the index has sufficient reserved space to amortize update costs, and also to keep high space efficiency. Research topics in the dissertation are (1) Inverted file compression through document identifier reassignment The first topic is to propose a document identifier reassignment algorithm to compress the ever-increasing inverted files. Conventionally, the d-gap technique is used in the inverted file compression by replacing document identifiers with usually much smaller gap values. The objective of this topic is to reassign document identifiers, based on the document similarity evaluation, to smoothen and reduce the gap values in an inverted file. A Web database can take benefits from it in terms of the saved storage space, and fast file look-up time. (2) Inverted file caching for fast information retrieval The second topic is to propose an inverted file caching mechanism to exploit the locality of user queries in a Web database. In this mechanism, we enhance the indexing speed by a linked-list-based probing process, and enhance memory efficiency by a chunk-based space management. A Web database can take benefits from it in terms of the fast popular data’s response. (3) Tree-based inverted file structuring for most-correlated-document-first retrieval The third topic is to propose an n-key-heap posting-tree structure to preserve the identifier numerical orders and ranking information simultaneously in an index file. The objective of this topic is to reconstruct an inverted file to store important and most-correlated data efficiently such that they can be retrieved without time-consuming ranking or sorting. A Web database can take benefits from it in terms of the fast most-correlated-data’s response. (4) Statistics-based spare-space allocation for incremental inverted file updates The fourth topic is to propose a statistics-based approach to allocate the free space in an inverted file for future updates. The approach estimates the space requirements for an inverted file by collecting only a little most-recent statistical data. The objective is to incrementally update an inverted file without complex file reorganization or expensive free-space management, as the database expands. A Web database can take benefits from it in terms of the fast index updates. The results of this dissertation include: (1)For inverted file compression, the proposed approach improves the compression rate by 18%, and improves the query response time by 15% on average. (2)For inverted file caching, the proposed approach takes only about 7% additional space costs to outperform the conventional caching mechanisms by 20% indexing speed improvements on average. (3)For tree-based inverted file structuring, the time to retrieve the most-correlated documents is improved by 8%~45%, compared with the conventional link-list-based index structure. (4)For incremental inverted file updates, the proposed approach outperforms the conventional approaches by 16% space utilization improvements, and 15% index-updating speed improvements on average.
Більше джерел

Книги з теми "Fast retrieval":

1

Scherer, Rafał. Computer Vision Methods for Fast Image Classification and Retrieval. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-12195-2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Ness, Dan. Fast facts online: Search strategies for finding business information. Homewood, Ill: D. Jones-Irwin, 1986.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Heinström, Jannica. Fast surfers, broad scanners, and deep divers: Personality and information-seeking behaviour. Åbo [Finland]: Åbo Akademis förlag, 2002.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Berkman, Robert I. Find it fast: How to uncover expert information on any subject. 3rd ed. New York: HarperPerennial, 1994.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Berkman, Robert I. Find it fast: How to uncover expert information on any subject. New York: Perennial Library, 1990.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Berkman, Robert I. Find it fast: How to uncover expert information on any subject. New York: Harper & Row, 1987.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Berkman, Robert I. Find it fast: How to uncover expert information on any subject. 4th ed. New York: HarperPerennial, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Barthe, Gilles. Formal Aspects of Security and Trust: 8th International Workshop, FAST 2011, Leuven, Belgium, September 12-14, 2011. Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Berkman, Robert I. Find it fast: How to uncover expert information on any subject online or in print. 5th ed. New York, NY: HarperResource, 2000.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Degano, Pierpaolo. Formal Aspects of Security and Trust: 7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Fast retrieval":

1

Trotman, Andrew, Xiang-Fei Jia, and Shlomo Geva. "Fast and Effective Focused Retrieval." In Focused Retrieval and Evaluation, 229–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14556-8_24.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Belazzougui, Djamal, Paolo Boldi, and Sebastiano Vigna. "Dynamic Z-Fast Tries." In String Processing and Information Retrieval, 159–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16321-0_15.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Song, Siwoo, Cheol Ryu, Simone Faro, Thierry Lecroq, and Kunsoo Park. "Fast Cartesian Tree Matching." In String Processing and Information Retrieval, 124–37. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32686-9_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Mozgovoy, Maxim, Kimmo Fredriksson, Daniel White, Mike Joy, and Erkki Sutinen. "Fast Plagiarism Detection System." In String Processing and Information Retrieval, 267–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11575832_30.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Munro, J. Ian, Yakov Nekrich, and Jeffrey S. Vitter. "Fast Construction of Wavelet Trees." In String Processing and Information Retrieval, 101–10. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11918-2_10.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Karch, Daniel, Dennis Luxen, and Peter Sanders. "Improved Fast Similarity Search in Dictionaries." In String Processing and Information Retrieval, 173–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16321-0_16.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Kaneta, Yusaku. "Fast Wavelet Tree Construction in Practice." In String Processing and Information Retrieval, 218–32. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00479-8_18.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Broß, Jan, Simon Gog, Matthias Hauck, and Marcus Paradies. "Fast Construction of Compressed Web Graphs." In String Processing and Information Retrieval, 116–28. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67428-5_11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Belazzougui, Djamal, and Fabio Cunial. "Fast Label Extraction in the CDAWG." In String Processing and Information Retrieval, 161–75. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67428-5_14.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Yamazaki, Tomohiro, Hisashi Koga, and Takahisa Toda. "Fast Exact Algorithm to Solve Continuous Similarity Search for Evolving Queries." In Information Retrieval Technology, 84–96. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70145-5_7.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Fast retrieval":

1

Chen, Yong-Fan, and Ite A. Yu. "Manipulate retrieval of stored light pulses." In Slow and Fast Light. Washington, D.C.: OSA, 2008. http://dx.doi.org/10.1364/sl.2008.sma6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Hahn, J., and B. S. Ham. "Enhanced Echo Retrieval Efficiency Using Ultraslow Light." In Slow and Fast Light. Washington, D.C.: OSA, 2011. http://dx.doi.org/10.1364/sl.2011.slmc7.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Edmundson, David, and Gerald Schaefer. "Flickr Retriever -- Fast Retrieval of Flickr Photos." In 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT). IEEE, 2012. http://dx.doi.org/10.1109/wi-iat.2012.234.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Vudyasetu, P. K., R. M. Camacho, and J. C. Howell. "Storage and retrieval of images in hot atomic Rubidium vapor." In Slow and Fast Light. Washington, D.C.: OSA, 2008. http://dx.doi.org/10.1364/sl.2008.swd4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Edmundson, David, and Gerald Schaefer. "Fast mobile image retrieval." In 2013 IEEE International Conference on Multimedia and Expo Workshops (ICMEW). IEEE, 2013. http://dx.doi.org/10.1109/icmew.2013.6618399.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Viswanathan, Aditya, and Mark Iwen. "Fast compressive phase retrieval." In 2015 49th Asilomar Conference on Signals, Systems and Computers. IEEE, 2015. http://dx.doi.org/10.1109/acssc.2015.7421436.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Gao, Junyu, and Changsheng Xu. "Fast Video Moment Retrieval." In 2021 IEEE/CVF International Conference on Computer Vision (ICCV). IEEE, 2021. http://dx.doi.org/10.1109/iccv48922.2021.00155.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Wehrmann, Jonatas, Mauricio A. Lopes, Martin D. More, and Rodrigo C. Barros. "Fast Self-Attentive Multimodal Retrieval." In 2018 IEEE Winter Conference on Applications of Computer Vision (WACV). IEEE, 2018. http://dx.doi.org/10.1109/wacv.2018.00207.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Kamel, Ibrahim. "Fast retrieval of cursive handwriting." In the fifth international conference. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/238355.238447.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Dimov, Dimo. "Fast, shape based image retrieval." In the 4th international conference conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/973620.973669.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Fast retrieval":

1

Guan, Ziqiao, and Esther H. Tsai. PtychoNet: Fast and High Quality Phase Retrieval for Ptychography. Office of Scientific and Technical Information (OSTI), September 2019. http://dx.doi.org/10.2172/1599580.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Das, M., B. A. Draper, W. J. Lim, R. Manmatha, and E. M. Riseman. A Fast, Background-Independent Retrieval Strategy for Color Image Databases. Fort Belvoir, VA: Defense Technical Information Center, November 1996. http://dx.doi.org/10.21236/ada477660.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Karypis, George, and Euihong Han. Concept Indexing: A Fast Dimensionality Reduction Algorithm With Applications to Document Retrieval and Categorization. Fort Belvoir, VA: Defense Technical Information Center, March 2000. http://dx.doi.org/10.21236/ada439511.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Poole, Paula M., Marcie S. Kronberg, and Debra Meyers. Automated Airdrop Information Retrieval System-Human Fact ors Database (AAIRS-HFD) (Users Manual). Fort Belvoir, VA: Defense Technical Information Center, September 1994. http://dx.doi.org/10.21236/ada285571.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

До бібліографії