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

Approximate spatio-temporal retrieval

ACM TRANSACTIONS ON INFORMATION SYSTEMS 2001年第1期19卷 53-96页

作者： Papadias, D Mamoulis, N Delis, V Hong Kong Univ Sci & Technol Dept Comp Sci Hong Kong Hong Kong Peoples R China CWI NL-1090 GB Amsterdam Netherlands Univ Patras Comp Engn & Informat Dept GR-26110 Patras Greece Univ Patras Inst Comp Technol GR-26110 Patras Greece

This paper proposes a framework for the handling of spatio-temporal queries with inexact matches, using the concept of relation similarity. We initially describe a binary string encoding for 1D relations that permits the automatic derivation of similarity measures. We then extend this model to various granularity levels and many dimensions, and show that reasoning on spatio-temporal structure is significantly facilitated in the new framework. Finally, we provide algorithms and optimization methods for four types of queries: (i) object retrieval based on some spatio-temporal relations with respect to a reference object, (ii) spatial joins, i.e., retrieval of object pairs that satisfy some input relation, (iii) structural queries, which retrieve configurations matching a particular spatio-temporal structure, and (iv) special cases of motion queries. Considering the current large availability of multidimensional data and the increasing need for flexible query-answering mechanisms, our techniques can be used as the core of spatio-temporal query processors.

关键词： .permits similarity measures optimization methods multidimensional data spatio-temporal queries object retrieval spatial joins Approximate Spatio-Temporal Retrieval binary string spatio-temporal structure reference object object pairs motion queries ACM Press

来源：评论

学校读者我要写书评

暂无评论

Solving Two-dimensional Density Classification Problem with Two Probabilistic Cellular Automata

引用

JOURNAL OF CELLULAR AUTOMATA 2015年第1-2期10卷 149-160页

作者： Fuks, Henryk Brock Univ Dept Math & Stat St Catharines ON L2S 3A1 Canada

The density classification problem is one of the simplest yet non-trivial computing tasks which seem to be ideally suitable for cellular automata (CA). Unfortunately, there exists no one-dimensional two-state CA which classifies binary strings according to their densities. If, however, in place of simple cells one uses agents which change their behaviour from one rule to another after a fixed number of iterations, the classification can be performed by the traffic rule 184 and the majority rule 232. This two-rule solution cannot be easily generalized to two (or higher) dimensions, because it critically depends on a kinetic phase transition occurring in the rule 184. No rule exhibiting analogous transition is known in two dimensions, most likely because no such rule exists. We propose, therefore, to approach this problem form a slightly different angle, namely by introducing a stochastic component into each of the two rules. If one precedes each iteration of rule 184 by the stochastic "lane changing rule", and each iteration of rule 232 by the stochastic "crowd avoidance" rule, in the limit of infinitely many iterations the classification can be performed correctly with probability 1. This solution can be described either in the language of CA, or using the paradigm of agents which move and proliferate on the 2D lattice, following probabilistic rules.

关键词： Rule Agents binary string Cellular automata Stochastic Phase transtormations iterative methods

来源：评论

学校读者我要写书评

暂无评论

Stability of Properties of Kolmogorov Complexity under Relativization

引用

PROBLEMS OF INFORMATION TRANSMISSION 2010年第1期46卷 38-61页

作者： Muchnik, An. A. Romashchenko, A. E. RAS Kharkevich Inst Informat Transmiss Problems Moscow 117901 Russia

Assume that a tuple of binary strings (a) over bar = has negligible mutual information with another string b. Does this mean that properties of the Kolmogorov complexity of (a) over bar do not change significantly if... 详细信息

Assume that a tuple of binary strings (a) over bar = < a(1), ..., a(n)> has negligible mutual information with another string b. Does this mean that properties of the Kolmogorov complexity of (a) over bar do not change significantly if we relativize them to b? This question becomes very nontrivial when we try to formalize it. In this paper we investigate this problem for a special class of properties (for properties that can be expressed by an there exists-formula). In particular, we show that a random (conditional on (a) over bar) oracle b does not help to extract common information from the strings a(i).

关键词： binary string tuple Information retrieval systems-Teletext and videotex Kolmogorov complexity Cosmic strings

来源：评论

学校读者我要写书评

暂无评论

A study of the Cu clusters using gray-coded genetic algorithms and differential evolution

引用

JOURNAL OF PHASE EQUILIBRIA AND DIFFUSION 2004年第1期25卷 16-21页

作者： Chakraborti, N Mishra, P Erkoç, S Indian Inst Technol Dept Met & Mat Engn Kharagpur 721302 W Bengal India Middle E Tech Univ Dept Phys TR-06531 Ankara Turkey

Energy minimization studies were carried out for a number of Cu clusters using binary and Gray-coded genetic algorithms along with real coded differential evolution, and their optimized ground state geometries are presented. The potential energy function is constructed using a two-body interaction methodology, involving both attractive and repulsive pair-potential terms. The results obtained through the evolutionary algorithms are compared against those obtained earlier using a Monte Carlo technique.

关键词： binary string Differential Evolution Genetic Algorithm Gray Code Potential Energy Function

来源：评论

学校读者我要写书评

暂无评论

Working in binary protects the repetends of 1/3^h: Comment on Colussi's 'The convergence classes of Collatz function'

引用

THEORETICAL COMPUTER SCIENCE 2016年 618卷 135-141页

作者： Hew, Patrick Chisan Def Sci & Technol Grp Dept Def Australia HMAS Stirling Garden Isl WA 6168 Australia

The Collatz function can be stated as 'for any odd positive integer x, calculate 3x + 1 and then divide by 2 until the result is odd'. Colussi (2011) discovered and proved that if x attains 1 on the kth iteration of the Collatz function, then its binary representation can be written as the concatenation of strings SkSk-1 ... s(1) where each s(h) is a finite and contiguous extract from the representation of We provide an elementary confirmation of Colussi's finding, and comment on how working in binary 'protects' the repetends of 1/3(h) as formed into each sh. Crown Copyright (C) 2016 Published by Elsevier B.V. All rights reserved.

关键词： Collatz conjecture 3n+1 problem binary string

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for topological characteristics of kinematic chains

引用

JOURNAL OF MECHANICAL DESIGN 2000年第2期122卷 228-231页

作者： Rao, AC Koneru Lakshmaiah Coll Engn Tadepalli Mandal 522502 Andhra Pradesh India

A genetic algorithm for testing isomorphism among kinematic chains and to select the best frame and input links is presented. The computational effort involved is minimum and the method is unique as it satisfies bath the necessary aid sufficient requirements. Fitness of a binary string corresponding to a link is indicative of its design parameters. Consequently the Jit,less of a chain indicates the number of design parameters active in motion generation. Chains are compared for function generation on the basis of the 'fitness' of first generation nod second generation 'fitness,' etc., in that order. [S1050-0472(00)00801-1].

关键词： design parameter binary string health input link kinematics Genetic Algorithm (GA) Kinematic chain

来源：评论

学校读者我要写书评

暂无评论

A COMPUTABLE ANALYSIS OF VARIABLE WORDS THEOREMS

引用

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY 2019年第2期147卷 823-834页

作者： Liu, Lu Monin, Benoit Patey, Ludovic Cent S Univ Dept Math Changsha 410083 Hunan Peoples R China LACL Fac Sci & Technol Dept Informat 61 Ave Gen Gaulle F-94010 Creteil France Univ Claude Bernard Lyon 1 Inst Camille Jordan 43 Blvd 11 Novembre 1918 F-69622 Villeurbanne France

The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite sequence with infinitely many variables such that for every valuation, some specific set of initial segments is homogeneous. Friedman, Simpson, and Montalban asked about its reverse mathematical strength. We study the computability-theoretic properties and the reverse mathematics of this statement, and relate it to the finite union theorem. In particular, we prove the Ordered Variable word for binary strings in ACA(0).

关键词： Continuously variable reversing binary string Proof Theorem Cosmic strings

来源：评论

学校读者我要写书评

暂无评论

DEVIATIONS FROM UNIFORMITY IN RANDOM stringS

引用

PROBABILITY THEORY AND RELATED FIELDS 1988年第1期80卷 139-150页

作者： FLAJOLET, P KIRSCHENHOFER, P TICHY, RF VIENNA TECH UNIV A-1040 VIENNAAUSTRIA

We show that almost all binary strings of length n contain all blocks of size (1-ε)log2 n a close to uniform number of times. From this, we derive tight bounds on the discrepancy of random infinite strings. Our resul... 详细信息

We show that almost all binary strings of length n contain all blocks of size (1-ε)log₂ n a close to uniform number of times. From this, we derive tight bounds on the discrepancy of random infinite strings. Our results are obtained through explicit generating function expressions and contour integration estimates.

关键词： Generating functions Deviation binary string Uniformity Random Cosmic strings

来源：评论

学校读者我要写书评

暂无评论

Bipartite Steinhaus graphs

引用

TAIWANESE JOURNAL OF MATHEMATICS 1999年第3期3卷 303-310页

作者： Lee, YS Chang, GJ Natl Chiao Tung Univ Dept Appl Math Hsinchu 30050 Taiwan

A Steinhaus matrix is a symmetric 0-1 matrix [a(i,j)](nxn) such that a(i,i) = 0 for 0 less than or equal to i less than or equal to n - 1 and a(i,j) = (a(i-1,j-1) + a(i-1,j)) (mod 2) for 1 less than or equal to i < j less than or equal to n-1. A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper, we present a new characterization of bipartite Steinhaus graphs.

关键词： Steinhaus graph Steinhaus triangle binary string adjacency matrix

来源：评论

学校读者我要写书评

暂无评论

An analysis on equal width quantization and linearly separable subcode encoding-based discretization and its performance resemblances

引用

EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING 2011年第1期2011卷 1-14页

作者： Lim, Meng-Hui Teoh, Andrew Beng Jin Toh, Kar-Ann Yonsei Univ Sch Elect & Elect Engn Coll Engn Seoul 120749 South Korea

Biometric discretization extracts a binary string from a set of real-valued features per user. This representative string can be used as a cryptographic key in many security applications upon error correction. Discretization performance should not degrade from the actual continuous features-based classification performance significantly. However, numerous discretization approaches based on ineffective encoding schemes have been put forward. Therefore, the correlation between such discretization and classification has never been made clear. In this article, we aim to bridge the gap between continuous and Hamming domains, and provide a revelation upon how discretization based on equal-width quantization and linearly separable subcode encoding could affect the classification performance in the Hamming domain. We further illustrate how such discretization can be applied in order to obtain a highly resembled classification performance under the general Lp distance and the inner product metrics. Finally, empirical studies conducted on two benchmark face datasets vindicate our analysis results.

关键词： subcode Quantization Discretization binary string Separable secret key

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：