检索结果-内蒙古大学图书馆

2015 IEEE International Conference on Computational Intelligence & Communication Technology (CICT 2015)

作者： Rahmani, Md Khalid Imam Ansari, M. A. Goel, Amit Kumar Mewar Univ Dept Comp Sci & Engn Chittaurgarh Rajasthan India Int Islamic Univ Fac Engn Madinah Saudi Arabia EIT Dept Comp Sci & Engn Faridabad Haryana India

ISBN: (纸本)9781479960224

Due to the continuous development of high quality multimedia technologies and rapid growth in the computational power along with availability of huge sized storage devices, digital image archives of very large size are being created day by day on the ever growing WWW through many commercial, research & development and academic web sites. The bulk of digitized images over the Internet are attracting significant research efforts for the development of tools to manage the visual data with their fast and effective retrieval. Towards the beginning of the previous decade, the breakthrough techniques called content based image retrieval has emerged in image retrieval field. This technique uses the contents of the image data for segmenting, indexing, retrieval and searching of relevant images from image repository. This paper mainly concentrates on the indexing phase of the image retrieval system for development of an efficient indexing algorithm of CBIR systems.

关键词： Image indexing indexing algorithm Image Retrieval CBIR

来源：评论

学校读者我要写书评

暂无评论

Smash: Flexible, Fast, and Resource-efficient Placement and Lookup of Distributed Storage

引用

PROCEEDINGS OF THE ACM ON MEASUREMENT AND ANALYSIS OF COMPUTING SYSTEMS 2023年第2期7卷 1-22页

作者： Liu, Yi Shi, Shouqian Xie, Minghao Litz, Heiner Qian, Chen Univ Calif Santa Cruz Santa Cruz CA 95064 USA

Large-scale distributed storage systems, such as object stores, usually apply hashing-based placement and lookup methods to achieve scalability and resource efficiency. However, when object locations are determined by hash values, placement becomes inflexible, failing to optimize or satisfy application requirements such as load balance, failure tolerance, parallelism, and network/system performance. This work presents a novel solution to achieve the best of two worlds: flexibility while maintaining cost-effectiveness and scalability. The proposed method Smash is an object placement and lookup method that achieves full placement flexibility, balanced load, low resource cost, and short latency. Smash utilizes a recent space-efficient data structure and applies it to object-location lookups. We implement Smash as a prototype system and evaluate it in a public cloud. The analysis and experimental results show that Smash achieves full placement flexibility, fast storage operations, fast recovery from node dynamics, and lower DRAM cost (<60%) compared to existing hash-based solutions such as Ceph and MapX.

关键词： Distributed storage indexing algorithm Ludo hashing

来源：评论

学校读者我要写书评

暂无评论

A reference-based multi-lattice indexing method integrating prior information correction and iterative refinement in protein crystallography

引用

ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES 2021年第4期77卷 277-288页

作者： Zhou, Qiang Gao, Zeng-Qiang Dong, Zheng Jiang, Yu-Meng She, Zhun Geng, Zhi Dong, Yu-Hui Chinese Acad Sci Inst High Energy Phys Beijing Synchrotron Radiat Facil Beijing 100049 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China

A new multi-lattice indexing method based on the principle of whole-pattern matching given cell dimensions and space-group symmetry is presented for macromolecular crystallography. The proposed method, termed the multi-crystal data processing suite (MCDPS), features a local correction for prior information accompanied by iterative refinement of experimental parameters, both of which are numerically and experimentally demonstrated to be critical for accurately identifying multiple crystal lattices. Further analysis of data reduction and structure determination with conventional single-crystal programs reveals that the processed multi-lattice data sets are comparable in quality to typical single-crystal ones in terms of crystallographic metrics. Importantly, it is confirmed that careful exclusion of overlapping reflections prior to scaling is necessary to guarantee an accurate data reduction result. The potential for multi-lattice indexing in solving the general macroscopic twinning problem is also explored.

关键词： multi-crystal diffraction indexing algorithm multi-crystal data processing suite MCDPS protein crystallography data reduction

来源：评论

学校读者我要写书评

暂无评论

A light-touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2021年第5期28卷 2334-2358页

作者： Petroianu, Larissa P. G. Zabinsky, Zelda B. Zameer, Mariam Chu, Yi Muteia, Mamiza M. Resende, Mauricio G. C. Coelho, Aida L. Wei, Jiarui Purty, Turam Draiva, Abel Lopes, Alvaro Univ Washington Dept Ind & Syst Engn Seattle WA 98195 USA VillageReach 2900 Eastlake Ave ESuite 230 Seattle WA 98102 USA VillageReach Mozamb Off Rua Rosas 105Sommerschield 2 Maputo Mozambique Univ Washington Informat Sch Seattle WA 98195 USA

Planning vaccine distribution in rural and urban poor communities is challenging, due in part to inadequate vehicles, limited cold storage, road availability, and weather conditions. The University of Washington and VillageReach jointly developed and tested a user-friendly, Excel spreadsheet based optimization tool for routing and scheduling to efficiently distribute vaccines and other medical commodities to health centers across Mozambique. This paper describes the tool and the process used to define the problem and obtain feedback from users during the development. The distribution and routing tool, named route optimization tool (RoOT), uses an indexing algorithm to optimize the routes under constrained resources. Numerical results are presented using five datasets, three realistic and two artificial datasets. RoOT can be used in routine or emergency situations, and may be easily adapted to include other products, regions, or logistic problems.

关键词： humanitarian logistics vehicle routing vaccine distribution medical supplies distribution routing tool indexing algorithm route optimization

来源：评论

学校读者我要写书评

暂无评论

SPIND-TC: an indexing method for two-color X-ray diffraction data

引用

ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES 2020年第PT 3期76卷 369-375页

作者： Li, Xuanxuan Li, Chufeng Liu, Haiguang Tsinghua Univ Dept Engn Phys Beijing 100084 Peoples R China Beijing Computat Sci Res Ctr Complex Syst Div ZPk 2 Beijing 100193 Peoples R China Arizona State Univ Dept Phys Tempe AZ 85287 USA DESY Ctr Free Electron Laser Sci Notkestr 85 Hamburg 22607 Germany

Recent developments of two-color operation modes at X-ray free-electron laser facilities provide new research opportunities, such as X-ray pump/X-ray probe experiments and multiple-wavelength anomalous dispersion phasing methods. However, most existing indexing methods were developed for indexing diffraction data from monochromatic X-ray beams. Here, a new algorithm is presented for indexing two-color diffraction data, as an extension of the sparse-pattern indexing algorithm SPIND, which has been demonstrated to be capable of indexing diffraction patterns with as few as five peaks. The principle and implementation of the two-color indexing method, SPIND-TC, are reported in this paper. The algorithm was tested on both simulated and experimental data of protein crystals. The results show that the diffraction data can be accurately indexed in both cases. Source codes are publicly available at https://***/lixx11/SPIND-TC.

关键词： serial crystallography two-color diffraction indexing algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization and Improvement of Lucene Index algorithm

Optimization and Improvement of Lucene Index Algorithm

引用

International Conference on Cyber Security Intelligence and Analytics (CSIA)

作者： Su, Ya Tao Bozhou Coll Bozhou Anhui Peoples R China

ISBN: (纸本)9783030152352;9783030152345

Lucene has a wide range of applications in text retrieval and search. The similarity scoring algorithm is one of the core parts of its search engine. In the question and answer system, the retrieval function is also used. The similarity scoring algorithm is also one of its core parts. This paper introduces the analysis of Lucene's system structure, and proposes a search engine optimization method and index algorithm improvement.

关键词： Lucene indexing algorithm Search engine optimization Improvement

来源：评论

学校读者我要写书评

暂无评论

indexing of Information Systems Using Intuitionistic Rough Fuzzy Groups with Intuitionistic Fuzzy Decision Attributes 1st

Indexing of Information Systems Using Intuitionistic Rough F...

引用

1st International Conference on Smart Trends for Information Technology and Computer Communications (SmartCom)

作者： Krishnaveni, B. Chandrika, S. Ganesan, G. Aditya Engn Coll Dept Humanities & Basic Sci Surampalem Andhra Pradesh India Adikavi Nannaya Univ Dept Math Rajahmundry Andhra Pradesh India

ISBN: (纸本)9789811034336;9789811034329

A naive approach in rough computing under fuzziness and intuitionistic fuzziness through thresholds was given by G. Ganesan in 2005. Later in 2013, B. Krishnaveni and G. Ganesan had derived a procedure of characterizing information systems using intuitionistic fuzzy decision attributes through intuitionistic rough fuzzy groups. Using this, G. Ganesan and B. Krishnaveni in 2014 introduced the indexing procedure in characterization obtained using fuzzy decision attributes. In present paper, let us apply this procedure under intuitionistic fuzzy decision attributes.

关键词： Intuitionistic rough fuzzy groups Information system indexing algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallelization Issues of Domain Specific Question Answering System on Cell BE Processors

引用

2nd International Conference on Contemporary Computing

作者： Kumar, Tarun Mittal, Ankush Sondhi, Parikshit Indian Inst Technol Dept Elect & Comp Engn Roorkee Uttar Pradesh India Univ Illinois Dept Comp Sci Urbana IL USA

ISBN: (纸本)9783642035463

A question answering system is an information retrieval application which allows users to directly obtain appropriate answers to a question. In order to deal with an explosive growth of information over internet and increased number of processing stages in answer retrieval, time and processing hardware required by question answering system has increased. The need of hardware is currently served by connecting thousands of computers in cluster. But faster and less complex alternatives can be found as a multi-core processor. This paper presents a pioneer work by identifying major issues involved in porting a general question answering framework on a cell processor and their possible solutions. The work is evaluated by porting the indexing algorithm of our biomedical question answering system, INDOC (Internet Doctor) on cell processors.

关键词： Biomedical Question Answering system indexing algorithm Cell Broadband Engine Processor

来源：评论

学校读者我要写书评

暂无评论

X-Cell:: a novel indexing algorithm for routine tasks and difficult cases

引用

JOURNAL OF APPLIED CRYSTALLOGRAPHY 2003年第2期36卷 356-365页

作者： Neumann, MA Accelrys Ltd Cambridge CB4 0WN England

X-Cell is a novel indexing algorithm that makes explicit use of systematic absences to search for possible indexing solutions from cells with low numbers of calculated reflections to cells with high numbers of reflections. Space groups with the same pattern of systematic absences are grouped together in powder extinction classes, and for a given peak number range an independent search is carried out in each powder extinction class. The method has the advantage that the correct cell is likely to be found before the rapid increase of possible solutions slows down the search significantly. A successive dichotomy approach is used to establish a complete list of all possible indexing solutions. The dichotomy procedure is combined with a search for the zero-point shift of the diffraction pattern, and impurity peaks can be dealt with by allowing for a user-defined portion of unindexed reflections. To rank indexing solutions with varying numbers of unindexed reflections, a new figure of merit is introduced that takes into account the highest level of agreement typically obtained for completely incorrect unit cells. The indexing of long and flat unit cells is facilitated by the possibility to search for rows or zones in reciprocal space first and then to use the lattice parameters of the dominant row or zone in the unit-cell search. The main advantages of X-Cell are robustness and completeness, as demonstrated by a validation study on a variety of compounds. The dominant phase of phase mixtures can be indexed in the presence of up to 50% of impurity peaks if high-quality synchrotron data are available.

关键词： indexing algorithm profile analysis computer programs.

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：