Увійти

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

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

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

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 травня 2022

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

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

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

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

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

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

1

Oflazer, K. "Error-tolerant retrieval of trees." IEEE Transactions on Pattern Analysis and Machine Intelligence 19, no. 12 (1997): 1376–80. http://dx.doi.org/10.1109/34.643897.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Wang, Tian-Yin, Xiao-Qiu Cai, and Rui-Ling Zhang. "Fault-tolerant symmetrically-private information retrieval." International Journal of Modern Physics B 30, no. 25 (September 28, 2016): 1650178. http://dx.doi.org/10.1142/s0217979216501782.

Повний текст джерела

Анотація:

We propose two symmetrically-private information retrieval protocols based on quantum key distribution, which provide a good degree of database and user privacy while being flexible, loss-resistant and easily generalized to a large database similar to the precedent works. Furthermore, one protocol is robust to a collective-dephasing noise, and the other is robust to a collective-rotation noise.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Mandl, T. "Tolerant Information Retrieval with Backpropagation Networks." Neural Computing & Applications 9, no. 4 (December 7, 2000): 280–89. http://dx.doi.org/10.1007/s005210070005.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Punithavathi. "A Fault Tolerant Mobile Agent Information Retrieval System." Journal of Computer Science 6, no. 5 (May 1, 2010): 553–56. http://dx.doi.org/10.3844/jcssp.2010.553.556.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Anastasiades, Carlos, Tobias Schmid, Jürg Weber, and Torsten Braun. "Information-centric content retrieval for delay-tolerant networks." Computer Networks 107 (October 2016): 194–207. http://dx.doi.org/10.1016/j.comnet.2016.03.006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Sai, K., A. Sandeep, and B. Tarakeswara. "Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks." International Journal of Computer Applications 132, no. 17 (December 17, 2015): 15–17. http://dx.doi.org/10.5120/ijca2015907683.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Srihari, B., K. V. G. N. Naidu, and P. Nirupama. "Protect Knowledge Retrieval for Localized Disruption Tolerant Military Networks." International Journal of Computer Trends and Technology 24, no. 3 (June 25, 2015): 108–12. http://dx.doi.org/10.14445/22312803/ijctt-v24p124.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Hur, Junbeom, and Kyungtae Kang. "Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks." IEEE/ACM Transactions on Networking 22, no. 1 (February 2014): 16–26. http://dx.doi.org/10.1109/tnet.2012.2210729.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Silva, Bruno M. C., Vasco N. G. J. Soares, and Joel J. P. C. Rodrigues. "Towards Intelligent Caching and Retrieval Mechanisms for Upcoming Proposals on Vehicular Delay-Tolerant Networks." Journal of Communications Software and Systems 7, no. 1 (March 22, 2011): 1. http://dx.doi.org/10.24138/jcomss.v7i1.181.

Повний текст джерела

Анотація:

Vehicular delay-tolerant networks (VDTNs) are opportunistic networks that enable connectivity in challenged scenarios with unstable links where end-to-end communications may not exist. VDTN architecture handles non-real timeapplications using vehicles to relay messages between network nodes. To address the problem of intermittent connectivity, network nodes store messages on their buffers, carrying them through the network while waiting for transfer opportunities. The storage capacity of the nodes affects directly the network performance. Therefore, it is important to incorporate suitable network protocols using self-contained messages to improve communication that supports store-carry-and-forward operation procedures. Clearly, such procedures motivate content cachingand retrieval. This paper surveys the state-of-the art on intelligent caching and retrieval mechanisms focusing on ad-hoc and delay tolerant networks (DTN). These approaches can offer important insights for upcoming proposals on intelligent caching and retrieval mechanisms for VDTNs.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Sok, Phearin, Sueng Hwan Lee, and Kee Cheon Kim. "DPRoPHET Routing in Delay Tolerant Network." Advanced Materials Research 684 (April 2013): 543–46. http://dx.doi.org/10.4028/www.scientific.net/amr.684.543.

Повний текст джерела

Анотація:

PRoPHET uses its delivery predictability of node encounters and transitivity to forward bundles to its neighbor node. Regardless of their distance, it faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability. To solve such consequences, we propose a Distance and Probabilistic Routing Protocol using History of Encounters and Transitivity (DPRoPHET) with the use of cross layer implementation for distance value retrieval. Our simulation results show that, by adding distance metric to the existing delivery predictability vector, DPRoPHET outperforms PRoPHET.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

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

1

Tran, Allen Quoc-Luan. "A network management facility for a fault-tolerant distributed information retrieval system." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0010/MQ53394.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Yang, Yunwen. "Software-implemented attack tolerance for critical information retrieval." Thesis, Durham University, 2004. http://etheses.dur.ac.uk/2838/.

Повний текст джерела

Анотація:

The fast-growing reliance of our daily life upon online information services often demands an appropriate level of privacy protection as well as highly available service provision. However, most existing solutions have attempted to address these problems separately. This thesis investigates and presents a solution that provides both privacy protection and fault tolerance for online information retrieval. A new approach to Attack-Tolerant Information Retrieval (ATIR) is developed based on an extension of existing theoretical results for Private Information Retrieval (PIR). ATIR uses replicated services to protect a user's privacy and to ensure service availability. In particular, ATIR can tolerate any collusion of up to t servers for privacy violation and up to ƒ faulty (either crashed or malicious) servers in a system with k replicated servers, provided that k ≥ t + ƒ + 1 where t ≥ 1 and ƒ ≤ t. In contrast to other related approaches, ATIR relies on neither enforced trust assumptions, such as the use of tanker-resistant hardware and trusted third parties, nor an increased number of replicated servers. While the best solution known so far requires k (≥ 3t + 1) replicated servers to cope with t malicious servers and any collusion of up to t servers with an O(n^*^) communication complexity, ATIR uses fewer servers with a much improved communication cost, O(n1/2)(where n is the size of a database managed by a server).The majority of current PIR research resides on a theoretical level. This thesis provides both theoretical schemes and their practical implementations with good performance results. In a LAN environment, it takes well under half a second to use an ATIR service for calculations over data sets with a size of up to 1MB. The performance of the ATIR systems remains at the same level even in the presence of server crashes and malicious attacks. Both analytical results and experimental evaluation show that ATIR offers an attractive and practical solution for ever-increasing online information applications.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Тодоріко, Ольга Олексіївна. "Моделі та методи очищення та інтеграції текстових даних в інформаційних системах". Thesis, Запорізький національний університет, 2016. http://repository.kpi.kharkov.ua/handle/KhPI-Press/21856.

Повний текст джерела

Анотація:

Дисертація на здобуття наукового ступеня кандидата технічних наук за спеціальністю 05.13.06 – інформаційні технології. – Національний технічний університет "Харківський політехнічний інститут", Харків, 2016. У дисертаційній роботі вирішена актуальна науково-практична задача підвищення ефективності та якості технології очищення та інтеграції текстових даних в довідкових і пошукових інформаційних системах за рахунок використання моделей словозмінної парадигми та методу побудови лексемного індексу при організації пошуку за схожістю. Розроблено моделі словозмінної парадигми, що включають представлення слів та обчислення приблизної міри схожості між ними. Розроблено метод побудови лексемного індексу, що базується на запропонованих моделях словозмінної парадигми та дозволяє відобразити слово і всі його словоформи в один запис індексу. Удосконалено метод пошуку за схожістю за рахунок покращення етапу попередньої фільтрації завдяки використанню розробленої моделі словозмінної парадигми та лексемного індексу. Виконана експериментальна оцінка ефективності вказує на високу точність та 99 0,5 % повноту. Удосконалено інформаційну технологію очищення та інтеграції даних за рахунок розроблених моделей та методів. Розроблено програмну реалізацію, яка на базі запропонованих моделей та методів виконує пошук за схожістю, очищення та інтеграцію наборів даних. Одержані в роботі теоретичні та практичні результати впроваджено у виробничий процес документообігу приймальної комісії та навчальний процес математичного факультету Державного вищого навчального закладу "Запорізький національний університет".
The thesis for the candidate degree in technical sciences, speciality 05.13.06 – Information Technologies. – National Technical University "Kharkiv Polytechnic Institute", Kharkiv, 2016. In the thesis the actual scientific and practical problem of increasing the efficiency and quality of cleaning and integration of data in information reference system and information retrieval system is solved. The improvement of information technology of cleaning and integration of data is achieved by reduction of quantity of mistakes in text information by means of use of model of an inflectional paradigm, methods of creation of a lexeme index, advanced methods of tolerant retrieval. The developed model of an inflectional paradigm includes a representation of words as an ordered collection of signatures and an approximate measure of similarity between two representations. The model differs in method of dealing with forms of words and character positions. It provides the basis for the implementation of improved methods of tolerant retrieval, cleaning and integration of datasets. The method of creation of the lexeme index which is based on the offered model of an inflectional paradigm is developed, and it allows mapping a word and all its forms to a record of the index. The method of tolerant retrieval is improved at preliminary filtration stage thanks to the developed model of an inflectional paradigm and the lexeme index. The experimental efficiency evaluation indicates high precision and 99  0,5 % recall. The information technology of cleaning and integration of data is improved using the developed models and methods. The software which on the basis of the developed models and methods carries out tolerant retrieval, cleaning and integration of data sets was developed. Theoretical and practical results of the thesis are introduced in production of document flow of an entrance committee and educational process of mathematical faculty of the State institution of higher education "Zaporizhzhya National University".

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Тодоріко, Ольга Олексіївна. "Моделі та методи очищення та інтеграції текстових даних в інформаційних системах". Thesis, НТУ "ХПІ", 2016. http://repository.kpi.kharkov.ua/handle/KhPI-Press/21853.

Повний текст джерела

Анотація:

Дисертація на здобуття наукового ступеня кандидата технічних наук за спеціальністю 05.13.06 – інформаційні технології. – Національний технічний університет «Харківський політехнічний інститут», Харків, 2016. У дисертаційній роботі вирішена актуальна науково-практична задача підвищення ефективності та якості технології очищення та інтеграції текстових даних в довідкових і пошукових інформаційних системах за рахунок використання моделей словозмінної парадигми та методу побудови лексемного індексу при організації пошуку за схожістю. Розроблено моделі словозмінної парадигми, що включають представлення слів та обчислення приблизної міри схожості між ними. Розроблено метод побудови лексемного індексу, що базується на запропонованих моделях словозмінної парадигми та дозволяє відобразити слово і всі його словоформи в один запис індексу. Удосконалено метод пошуку за схожістю за рахунок покращення етапу попередньої фільтрації завдяки використанню розробленої моделі словозмінної парадигми та лексемного індексу. Виконана експериментальна оцінка ефективності вказує на високу точність та 99 0,5 % повноту. Удосконалено інформаційну технологію очищення та інтеграції даних за рахунок розроблених моделей та методів. Розроблено програмну реалізацію, яка на базі запропонованих моделей та методів виконує пошук за схожістю, очищення та інтеграцію наборів даних. Одержані в роботі теоретичні та практичні результати впроваджено у виробничий процес документообігу приймальної комісії та навчальний процес математичного факультету Державного вищого навчального закладу «Запорізький національний університет».
The thesis for the candidate degree in technical sciences, speciality 05.13.06 – Information Technologies. – National Technical University «Kharkiv Polytechnic Institute», Kharkiv, 2016. In the thesis the actual scientific and practical problem of increasing the efficiency and quality of cleaning and integration of data in information reference system and information retrieval system is solved. The improvement of information technology of cleaning and integration of data is achieved by reduction of quantity of mistakes in text information by means of use of model of an inflectional paradigm, methods of creation of a lexeme index, advanced methods of tolerant retrieval. The developed model of an inflectional paradigm includes a representation of words as an ordered collection of signatures and an approximate measure of similarity between two representations. The model differs in method of dealing with forms of words and character positions. It provides the basis for the implementation of improved methods of tolerant retrieval, cleaning and integration of datasets. The method of creation of the lexeme index which is based on the offered model of an inflectional paradigm is developed, and it allows mapping a word and all its forms to a record of the index. The method of tolerant retrieval is improved at preliminary filtration stage thanks to the developed model of an inflectional paradigm and the lexeme index. The experimental efficiency evaluation indicates high precision and 99  0,5 % recall. The information technology of cleaning and integration of data is improved using the developed models and methods. The software which on the basis of the developed models and methods carries out tolerant retrieval, cleaning and integration of data sets was developed. Theoretical and practical results of the thesis are introduced in production of document flow of an entrance committee and educational process of mathematical faculty of the State institution of higher education «Zaporizhzhya National University».

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Mandl, Thomas [Verfasser], and Christa [Akademischer Betreuer] Womser-Hacker. "Tolerantes Information Retrieval : neuronale Netze zur Erhöhung der Adaptivität und Flexibilität bei der Informationssuche / Thomas Mandl. Betreuer: Christa Womser-Hacker." Hildesheim : Universitätsbibliothek Hildesheim, 2011. http://d-nb.info/1023791528/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Subbiah, Arun. "Efficient Proactive Security for Sensitive Data Storage." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19719.

Повний текст джерела

Анотація:

Fault tolerant and secure distributed data storage systems typically require that only up to a threshold of storage nodes can ever be compromised or fail. In proactively-secure systems, this requirement is modified to hold only in a time interval (also called epoch), resulting in increased security. An attacker or adversary could compromise distinct sets of nodes in any two time intervals. This attack model is also called the mobile adversary model. Proactively-secure systems require all nodes to "refresh" themselves periodically to a clean state to maintain the availability, integrity, and confidentiality properties of the data storage service. This dissertation investigates the design of a proactively-secure distributed data storage system. Data can be stored at storage servers using encoding schemes called secret sharing, or encryption-with-replication. The primary challenge is that the protocols that the servers run periodically to maintain integrity and confidentiality must scale with large amounts of stored data. Determining how much data can be proactively-secured in practical settings is an important objective of this dissertation. The protocol for maintain the confidentiality of stored data is developed in the context of data storage using secret sharing. We propose a new technique called the GridSharing framework that uses a combination of XOR secret sharing and replication for storing data efficiently. We experimentally show that the algorithm can secure several hundred GBs of data. We give distributed protocols run periodically by the servers for maintaining the integrity of replicated data under the mobile adversary model. This protocol is integrated into a document repository to make it proactively-secure. The proactively-secure document repository is implemented and evaluated on the Emulab cluster (http://www.emulab.net). The experimental evaluation shows that several 100 GBs of data can be proactively-secured. This dissertation also includes work on fault and intrusion detection - a necessary component in any secure system. We give a novel Byzantine-fault detection algorithm for quorum systems, and experimentally evaluate its performance using simulations and by deploying it in the AgileFS distributed file system.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

REIS, JUNIOR JOSE S. B. "Métodos e softwares para análise da produção científica e detecção de frentes emergentes de pesquisa." reponame:Repositório Institucional do IPEN, 2015. http://repositorio.ipen.br:8080/xmlui/handle/123456789/26929.

Повний текст джерела

Анотація:

Submitted by Marco Antonio Oliveira da Silva (maosilva@ipen.br) on 2016-12-21T15:07:24Z No. of bitstreams: 0
Made available in DSpace on 2016-12-21T15:07:24Z (GMT). No. of bitstreams: 0
O progresso de projetos anteriores salientou a necessidade de tratar o problema dos softwares para detecção, a partir de bases de dados de publicações científicas, de tendências emergentes de pesquisa e desenvolvimento. Evidenciou-se a carência de aplicações computacionais eficientes dedicadas a este propósito, que são artigos de grande utilidade para um melhor planejamento de programas de pesquisa e desenvolvimento em instituições. Foi realizada, então, uma revisão dos softwares atualmente disponíveis, para poder-se delinear claramente a oportunidade de desenvolver novas ferramentas. Como resultado, implementou-se um aplicativo chamado Citesnake, projetado especialmente para auxiliar a detecção e o estudo de tendências emergentes a partir da análise de redes de vários tipos, extraídas das bases de dados científicas. Através desta ferramenta computacional robusta e eficaz, foram conduzidas análises de frentes emergentes de pesquisa e desenvolvimento na área de Sistemas Geradores de Energia Nuclear de Geração IV, de forma que se pudesse evidenciar, dentre os tipos de reatores selecionados como os mais promissores pelo GIF - Generation IV International Forum, aqueles que mais se desenvolveram nos últimos dez anos e que se apresentam, atualmente, como os mais capazes de cumprir as promessas realizadas sobre os seus conceitos inovadores.
Dissertação (Mestrado em Tecnologia Nuclear)
IPEN/D
Instituto de Pesquisas Energéticas e Nucleares - IPEN-CNEN/SP

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Huang, Chien-Chi, and 黃健錡. "The enhancement of fault tolerant music retrieval." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/70102734312018594699.

Повний текст джерела

Анотація:

碩士
朝陽科技大學
資訊管理系碩士班
99
In the researches of music content-based retrievals, the researchers extract the features, such as melodies, rhythms and chords, from the music data and develop indices that will help to retrieve the relevant music quickly. The query by example (QBE) is widely used for multimedia content-based retrieval. Since users are not all expert in music, we cannot expect users to be able to precisely specify music query examples. Therefore, certain errors in music query examples, such as dropout notes, insertion notes, and transposition notes, should be allowed for users’ queries. That is, the fault tolerance ability in approximate search is needed for music query. However, there is still room for improvement in approximate music searching. In this research, we will investigate the ability of existing similar string matching techniques for performing the approximate music search. Thereafter, a new approach will be developed to enhance the fault tolerant music query.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Silva, Bruno Miguel Correia. "Content storage and retrieval mechanisms for vehicular delay-tolerant networks." Master's thesis, 2010. http://hdl.handle.net/10400.6/3725.

Повний текст джерела

Анотація:

Vehicular delay-tolerant networks (VDTNs) were proposed as a novel disruptive network concept based on the delay tolerant networking (DTN) paradigm. VDTN architecture uses vehicles to relay messages, enabling network connectivity in challenging scenarios. Due to intermittent connectivity, network nodes carry messages in their buffers, relaying them only when a proper contact opportunity occurs. Thus, the storage capacity and message retrieving of intermediate nodes directly affects the network performance. Therefore, efficient and robust caching and forwarding mechanisms are needed. This dissertation proposes a content storage and retrieval (CSR) solution for VDTN networks. This solution consists on storage and retrieval control labels, attached to every data bundle of aggregated network traffic. These labels define cacheable contents, and apply cachecontrol and forwarding restrictions on data bundles. The presented mechanisms gathered several contributions from cache based technologies such as Web cache schemes, ad-hoc and DTN networks. This solution is fully automated, providing a fast, safe, and reliable data transfer and storage management, while improves the applicability and performance of VDTN networks significantly. This work presents the performance evaluation and validation of CSR mechanisms through a VDTN testbed. Furthermore it presents several network performance evaluations and results using the well-known DTN routing protocols, Epidemic and Spray and Wait (including its binary variant). The comparison of the network behavior and performance on both protocols, with and without CSR mechanisms, proves that CSR mechanisms improve significantly the overall network performance.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Cheng, Kung-Wei, and 鄭功偉. "An Error-Tolerant Sign Retrieval Mechanism for Sign Language to Chinese Translation." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/4m6kd2.

Повний текст джерела

Анотація:

碩士
國立成功大學
資訊工程學系碩博士班
90
People with hearing/speech impairments usually have communication problems in daily activities, education and vocation leading to incapable of getting into the mainstream of society. These dysfunctions often affect and limit the language learning and expression seriously. Presently, there are few of Augmentative and Alternative Communication (AAC) technology and devices as well as the associated education-training system available in Taiwan. Besides, Taiwanese Sign Language (TSL) and written Chinese have several structural differences in linguistics. Deaf students usually make ill-formed sentences from the viewpoint of written Chinese. The purpose of this thesis is to develop an innovative TSL AAC system to provide communication aids in daily activities and language learning. More specifically, the study focuses on: 1) developing an effective TSL virtual keyboard for more intuitional selection input, 2) developing an error tolerant sign cue retrieval mechanism for word prediction and 3) integrating the predictive sentence template language model (PST) with path branching between equivalence classes for robust sentence generation. In order to evaluate the performance of our approach, 1881 frequently used signs and 2000 Chinese sentences, in which the mean length of utterance is 6.24 words, were selected as the training and testing database. The trained PST language model includes 461 sentence templates. The retrieval enhancement using word prediction, hand-shape deletion and movement deletion achieved 99.73%, 77.9% and 97.07%, respectively. For the assessment of practical communication aid, 8 profoundly deaf students were asked to conduct the experiments. After training, adaptation and evaluation phases, the accuracy of sentence generation achieved 80%. This proposed system aims to improve speech communication ability and activities of daily life for communication-impaired people.

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Tolerant retrieval"

1

Tran, Allen Quoc-Luan. A network management facility for a fault-tolerant distributed information retrieval system. Ottawa: National Library of Canada, 2000.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Shin, Kang G. Study on Advanced Information Processing System. [Washington, DC]: National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Office, General Accounting. Department of Energy: Solar and Renewable Resources Technologies Program : report to the Chairman, Subcommittee on Energy and Water Development, Committee on Appropriations, House of Representatives. Washington, D.C: The Office, 1997.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Office, General Accounting. Department of Energy: Problems and progress in managing plutonium : report to the chairman, Subcommittee on Energy and Power, Committee on Commerce, House of Representatives. Washington, D.C. (P.O. Box 37050, Washington, D.C. 20013): The Office, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Office, General Accounting. Department of Energy: DOE needs to improve controls over foreign visitors to weapons laboratories : report to the Committee on National Security, House of Representatives. Washington, D.C. (P.O. Box 37050, Washington, D.C. 20013): The Office, 1997.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Office, General Accounting. Department of Energy: National priorities needed for meeting environmental agreements : report to the Secretary of Energy. Washington, D.C: U.S. General Accounting Office, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Office, General Accounting. Department of Energy: Management and oversight of cleanup activities at Fernald : report to the congressional requesters. Washington, D.C: The Office, 1997.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Office, General Accounting. Department of Energy: Clear strategy on external regulation needed for worker and nuclear facility safety : report to the Committee on Science, House of Representatives. Washington, D.C. (P.O. Box 37050, Washington, D.C. 20013): The Office, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Office, General Accounting. Department of Energy: Accelerated closure of Rocky Flats : status and obstacles : report to the Chairman, Committee on Armed Services, U.S. Senate. [Washington, D.C.]: The Office, 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Office, General Accounting. Department of Energy: A framework for restructuring DOE and its missions : report to the Congress. Washington, D.C: The Office, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

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

1

Heo, Sung-Phil, Motoyuki Suzuki, Akinori Ito, Shozo Makino, and Hyun-Yeol Chung. "Error Tolerant Melody Matching Method in Music Information Retrieval." In Adaptive Multimedia Retrieval, 212–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25981-7_15.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Chatterjee, Siddhartha, Mauparna Nandan, Ahona Ghosh, and Swarnali Banik. "DTNMA: Identifying Routing Attacks in Delay-Tolerant Network." In Cyber Intelligence and Information Retrieval, 3–15. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-4284-5_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Karvonen, Mikko, Mika Laitinen, Kjell Lemström, and Juho Vikman. "Error-Tolerant Content-Based Music-Retrieval with Mathematical Morphology." In Exploring Music Contents, 321–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23126-1_20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Frosini, Patrizio, and Claudia Landi. "Persistent Betti Numbers for a Noise Tolerant Shape-Based Approach to Image Retrieval." In Computer Analysis of Images and Patterns, 294–301. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23672-3_36.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Esser, Wolfram M. "Fault-Tolerant Fulltext Information Retrieval in Digital Multilingual Encyclopedias with Weighted Pattern Morphing." In Lecture Notes in Computer Science, 338–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24752-4_25.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Kóczy, László, and Tamás Gedeon. "A Model of Intelligent Information Retrieval Using Fuzzy Tolerance Relations Based on Hierarchical Co-Occurrence of Words." In Soft Computing in Information Retrieval, 48–74. Heidelberg: Physica-Verlag HD, 2000. http://dx.doi.org/10.1007/978-3-7908-1849-9_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Vila, Katia, Josval Díaz, Antonio Fernández, and Antonio Ferrández. "An Approach for Adding Noise-Tolerance to Restricted-Domain Information Retrieval." In Natural Language Processing and Information Systems, 1–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13881-2_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Virginia, Gloria, and Hung Son Nguyen. "A Semantic Text Retrieval for Indonesian Using Tolerance Rough Sets Models." In Transactions on Rough Sets XIX, 138–224. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47815-8_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Ho, Tu Bao, Saori Kawasaki, and Ngoc Binh Nguyen. "Documents Clustering Using Tolerance Rough Set Model and Its Application to Information Retrieval." In Intelligent Exploration of the Web, 181–96. Heidelberg: Physica-Verlag HD, 2003. http://dx.doi.org/10.1007/978-3-7908-1772-0_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Kang, Jaeho, Hyunju Ahn, Sung-Won Jung, Kwang Ryel Ryu, Hyuk-Chul Kwon, and Sang-Hwa Chung. "Improving Load Balance and Fault Tolerance for PC Cluster-Based Parallel Information Retrieval." In Parallel Processing and Applied Mathematics, 682–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24669-5_89.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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

1

Lu, You, Mario Gerla, Tuan Le, Vince Rabsatt, and Haik Kalantarian. "Community aware content retrieval in disruption-tolerant networks." In 2014 13th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET). IEEE, 2014. http://dx.doi.org/10.1109/medhocnet.2014.6849121.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Gao, Kai, and Yong-jun Miao. "Tolerant Retrieval and Query Processing in Search Engine." In 2008 International Conference on Computer Science and Software Engineering. IEEE, 2008. http://dx.doi.org/10.1109/csse.2008.504.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Huang, Ying, Yan Gao, Klara Nahrstedt, and Wenbo He. "Optimizing File Retrieval in Delay-Tolerant Content Distribution Community." In 2009 29th IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, 2009. http://dx.doi.org/10.1109/icdcs.2009.63.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Zhongzhi Shi. "Nonstructured information retrieval based on Tolerant Granular Space Model." In 2008 IEEE International Conference on Granular Computing (GrC-2008). IEEE, 2008. http://dx.doi.org/10.1109/grc.2008.4664806.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Mekonnen, Andargachew. "Development of an Amharic spelling corrector for tolerant-retrieval." In the International Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2457276.2457281.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Le, Tuan, You Lu, and Mario Gerla. "Social caching and content retrieval in Disruption Tolerant Networks (DTNs)." In 2015 International Conference on Computing, Networking and Communications (ICNC). IEEE, 2015. http://dx.doi.org/10.1109/iccnc.2015.7069467.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Bayati, F., and N. Kazemi. "Noise-Tolerant Sparse Spike Deconvolution Based on Convolutional Phase Retrieval." In 82nd EAGE Annual Conference & Exhibition. European Association of Geoscientists & Engineers, 2020. http://dx.doi.org/10.3997/2214-4609.202011831.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Tuan Le, Haik Kalantarian, and Mario Gerla. "Socially-aware content retrieval using random walks in Disruption Tolerant Networks." In 2015 IEEE 16th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM). IEEE, 2015. http://dx.doi.org/10.1109/wowmom.2015.7158191.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Rathna, G. Praisy, and S. Senthilmurugan. "Retrieval of secured data for decentralized disruption tolerant network in military environment." In 2016 International Conference on Information Communication and Embedded Systems (ICICES). IEEE, 2016. http://dx.doi.org/10.1109/icices.2016.7518936.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Chan, Colin Y. M., and Mehul Motani. "An Integrated Energy Efficient Data Retrieval Protocol for Underwater Delay Tolerant Networks." In OCEANS 2007 - Europe. IEEE, 2007. http://dx.doi.org/10.1109/oceanse.2007.4302341.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!