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

Global multi-scale grid integer coding and spatial indexing: A novel approach for big earth observation data

ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING 2020年 163卷 202-213页

作者： Lei, Yi Tong, Xiaochong Zhang, Yongsheng Qiu, Chunping Wu, Xiangyu Lai, Guangling Li, He Guo, Congzhou Zhang, Yong Informat Engn Univ Zhengzhou 450001 Peoples R China Zhengzhou Zhonghe Jingxuan Informat Technol Co Lt Zhengzhou 450001 Peoples R China

With the exponentially growing earth observation data of specific sensor-determined resolutions and update frequencies, earth observation has irreversibly arrived in the Big Data era, enabling new insights in science and engineering. With great opportunity comes great challenges regarding efficient and effective data management because earth observation data is of different scales and characterized by complexity in spatial relationships related to the real world. To overcome the challenges is crucial for, for instance, data mining, land surveying, and especially emergency mapping for disaster response. To improve the querying efficiency of big earth observation data, we proposed a novel data management approach: Global Multi-scale Grid integer coding and Spatial Indexing. Among our contributions are: (1) proposing Global Multi-scale Grid integer coding Model (GMGICM), which presents clustering property in both the scale dimension and spatial dimension, and theoretically facilitates an efficient querying;(2) deliberately applying GMGICM on multi-scale earth observation data spatial indexing, which results in one-dimensional data index, which can be queried using simple B-tree, inversion, and other one-dimensional indexes;(3) designing a strategy to assure the completeness of spatial querying, which is not well solved by existing grid-based coding models. The advantages of our proposed approach have been demonstrated with both simulated and real remote sensing data, with spatial operation 20 times as fast as Geohash and spatial querying 10 times as fast as Oracle Spatial on average. The proposed approach can be easily adapted for three or higher-dimensional earth observation data and bring potential benefit to all big earth observation data analytic projects.

关键词： Multi-scale grid integer coding Clustering property Data management Big earth observation data Spatial indexing and querying

来源：评论

学校读者我要写书评

暂无评论

A Novel integer coding Scheme for Geometrically Distributed Low-Entropy Sources 30

A Novel Integer Coding Scheme for Geometrically Distributed ...

引用

30th IEEE Signal Processing and Communications Applications Conference (SIU)

作者： Ozbey, Can Huawei Turkey R&D Ctr Intelligent Applicat Dept TR-34768 Istanbul Turkey

ISBN: (数字)9781665450928

ISBN: (纸本)9781665450928

In this paper, a novel encoding scheme for low-entropy monotonic sources producing geometrically distributed integers is proposed. The approach is based on consecutively transferring the most probable integer onto the unary codes of certain capacity that represent other integers in a canonical way. The length of the codes, which directly determines their capacity, is adjusted according to the properties of the source distribution. In this respect, the proposed method can also be considered an extension of Golomb-Rice coding where the Golomb parameter may become a positive proper fraction. Here, we not only provide the encoding and decoding procedures with a parameter selection mechanism, but also empirically investigate as to how much redundancy occurs for different probabilities of source distribution in comparison to a similar approach in the literature.

关键词： source coding integer coding geometric distribution low-entropy source dense unary codes

来源：评论

学校读者我要写书评

暂无评论

An integer coding Based Optimization Model for Queen Problems

引用

American Journal of Computational Mathematics 2016年第1期6卷 32-36页

作者： Nengfa Hu Department of Computer Science and Engineering Hanshan Normal University Chaozhou China

Queen problems are unstructured problems, whose solution scheme can be applied in the actual job scheduling. As for the n-queen problem, backtracking algorithm is considered as an effective approach when the value of n is small. However, in case the value of n is large, the phenomenon of combination explosion is expected to occur. In order to solve the aforementioned problem, queen problems are firstly converted into the problem of function optimization with constraints, and then the corresponding mathematical model is established. Afterwards, the n-queen problem is solved by constructing the genetic operators and adaption functions using the integer coding based on the population search technology of the evolutionary computation. The experimental results demonstrate that the proposed algorithm is endowed with rapid calculation speed and high efficiency, and the model presents simple structure and is readily implemented.

关键词： Queen Problem Function Optimization Mathematical Model Evolutionary Computation integer coding

来源：评论

学校读者我要写书评

暂无评论

Polygonal approximation using integer particle swarm optimization

引用

INFORMATION SCIENCES 2014年 278卷 311-326页

作者： Wang, Bin Brown, Douglas Zhang, Xiaozheng Li, Hanxi Gao, Yongsheng Cao, Jie Nanjing Univ Finance & Econ Key Lab Elect Business Nanjing 210046 Jiangsu Peoples R China Griffith Univ Sch Engn Nathan Qld 4111 Australia

Polygonal approximation is an effective yet challenging digital curve representation for image analysis, pattern recognition and computer vision. This paper proposes a novel approach, integer particle swarm optimization (iPSO), for polygonal approximation. When compared to the traditional binary version of particle swarm optimization (bPSO), the new iPSO directly uses an integer vector to represent the candidate solution and provides a more efficient and convenient means for solution processing. The velocity and position updating mechanisms in iPSO not only have clear physical meaning, but also guarantee the optimality of the solutions. The method is suitable for polygonal approximation which could otherwise be an intractable optimization problem. The proposed method has been tested on commonly used synthesized shapes and lake contours extracted from the maps of four famous lakes in the world. The experimental results show that the proposed iPSO has better solution quality and computational efficiency than the bPSO-based methods and better solution quality than the other state-of-the-art methods. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Polygonal approximation Particle swarm optimization Genetic algorithms Binary version of PSO integer coding

来源：评论

学校读者我要写书评

暂无评论

On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第8期67卷 5104-5115页

作者： Wei, Hengjia Wang, Xin Schwartz, Moshe Ben Gurion Univ Negev Sch Elect & Comp Engn IL-8410501 Beer Sheva Israel Soochow Univ Dept Math Suzhou 215006 Peoples R China

We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions attain an asymptotic packing/covering density that is constant. The results are obtained via various methods, including the use of codes in the Hamming metric, modular B-t-sequences, 2-fold Sidon sets, and sets avoiding arithmetic progression.

关键词： integer coding packing covering tiling lattices limited-magnitude errors

来源：评论

学校读者我要写书评

暂无评论

Extended Golomb code for integer representation

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2007年第2期9卷 239-246页

作者： Somasundaram, K. Domnic, S. Gandhigram Rural Inst Dept Comp Sci & Appl Gandhigram 624302 India

In this paper, we have proposed two methods to represent nonnegative integers based on the principle used in Golomb code (GC). In both methods, the given integer is successively divided with a divisor, the quotient and the remainders are then used to represent the integer. One of our methods is best suited for representing short integers and gives bit length comparable to that of Elias root code which is best for representing short-range integers. Another of our methods is best suited for representing both short and long integers and gives a bit length comparable to that of Fibonacci code which is best for representing long integers. Application of our methods as a final stage encoder of the Burrows-Wheeler Transform Compressor shows that our codes give a better compression rate than the Elias, Fibonacci, Punctured, and GC codes.

关键词： Burrows-Wheeler compression Eilas root code Fibonacci code Golomb code Huffman code integer coding Punctured Elias code

来源：评论

学校读者我要写书评

暂无评论

Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2023年第2期69卷 951-962页

作者： Wei, Hengjia Schwartz, Moshe Peng Cheng Lab Shenzhen 518000 Peoples R China Ben Gurion Univ Negev Sch Elect & Comp Engn IL-8410501 Beer Sheva Israel

Motivated by applications to DNA-storage, flash memory, and magnetic recording, we study perfect burst-correcting codes for the limited-magnitude error channel. These codes are lattices that tile the integer grid with the appropriate error ball. We construct two classes of such perfect codes correcting a single burst of length 2, where each error affects the corresponding position by increasing it by one, both for cyclic and non-cyclic bursts. We also present a generic construction that requires a primitive element in a finite field with specific properties. We then show that in various parameter regimes such primitive elements exist, and hence, infinitely many perfect burst-correcting codes exist.

关键词： Codes Lattices Finite element analysis Additives Magnetic recording Galois fields Redundancy integer coding perfect codes burst-correcting codes lattices limited-magnitude errors

来源：评论

学校读者我要写书评

暂无评论

MULTI-FREQUENCY APPROACH TO FAULT DICTIONARY OF LINEAR ANALOG FAULT DIAGNOSIS

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2008年第5期17卷 905-928页

作者： Babu, N. Sarat Chandra Prasad, V. C. Rao, S. P. Venu Madhava Kishore, K. Lal C DAC Delta Chambers Hyderabad Andhra Pradesh India Multimedia Univ Selangor Malaysia Keshav Mem Inst Technol Hyderabad Andhra Pradesh India JNTU Hyderabad Andhra Pradesh India

An efficient method to eliminate redundant frequencies present in one of the existing multi-frequency methods for analog fault diagnosis is proposed in this paper. First the two-dimensional fault dictionary is constructed where entries are gain signatures of all faults and frequencies. The faults belonging to the same quantization levels are numbered sequentially and a frequency that has an ambiguity set with the highest number faults is eliminated after verifying that there are no repetitions after the deletion of this frequency. In this manner, all frequencies are examined for deletion. Finally the test frequencies, which cannot be deleted, remain resulting in a minimal set of test frequencies of a network to isolate a given set of faults. Another method proposes a technique, which generates more number of frequencies to isolate all the faults, if the test frequencies generated using the existing methods are not sufficient.

关键词： Analog fault diagnosis fault dictionary multi-frequency test frequencies integer coding frequency response poles zeros

来源：评论

学校读者我要写书评

暂无评论

A bi-objective function optimization approach for multiple sequence alignment using genetic algorithm

引用

SOFT COMPUTING 2020年第20期24卷 15871-15888页

作者： Chowdhury, Biswanath Garai, Gautam Univ Calcutta Dept Biophys Mol Biol & Bioinformat Kolkata India Saha Inst Nucl Phys Comp Sect Kolkata India

Multiple sequence alignment (MSA) is characterized as a very high computational complex problem. Therefore, MSA problem cannot be solved by exhaustive methods. Nowadays, MSA is being solved by optimizing more than one objective simultaneously. In this paper, we propose a new genetic algorithm based alignment technique, named bi-objective sequence alignment using genetic algorithm (BSAGA). The novelty of this approach is its selection process. One part of the population is selected based on the Sum of Pair, and rest is selected based on Total Conserve Columns. We applied integer-based chromosomal coding to represent only the gap positions in an alignment. Such representation improves the search technique to reach an optimum even for longer sequences. We tested and compared the alignment score of BSAGA with other relevant alignment techniques on BAliBASE and SABmark. The BSAGA shows better performance than others do, which was further proved by the Wilcoxon sign test.

关键词： Multiple sequence alignment Genetic algorithm integer coding Selection Wilcoxon sign test Experimental comparison Bi-objective function

来源：评论

学校读者我要写书评

暂无评论

Inverted index compression using word-aligned binary codes

引用

INFORMATION RETRIEVAL 2005年第1期8卷 151-166页

作者： Anh, VN Moffat, A Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic 3010 Australia

We examine index representation techniques for document-based inverted files, and present a mechanism for compressing them using word-aligned binary codes. The new approach allows extremely fast decoding of inverted lists during query processing, while providing compression rates better than other high-throughput representations. Results are given for several large text collections in support of these claims, both for compression effectiveness and query efficiency.

关键词： index compression integer coding index representation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：