By combinatorial arguments, we prove that the number of self-avoiding walks on the strip {0, 1} × Z is 8Fn − 4 when n is odd and is 8Fn − n when n is even. Also, when backwards moves are prohibited, we derive simple expressions for the number of length n self-avoiding walks on {0, 1} × Z, Z× Z, the triangular lattice, and the cubic lattice.

A block in a linear order is an equivalence class when factored by the block relationB(x, y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense collection of blocks) but no infinite, strongly η-like interval (i.e. with all blocks of size less than some fixed, finite k) has a computable copy with the non-block...

This chapter contrasts two different kinds of account of our knowledge of our own thoughts. According to standard theories, self-knowledge of at least a subset of thoughts is direct and noninterpretive. According to the alternative, which will be elaborated and defended here, self-knowledge results from turning our mindreading capacities on ourselves, relying on the same sensory channels that w...

The Review Opinion Diversification (Revopid-2017) shared task (Singh et al., 2017b) focuses on selecting top-k reviews from a set of reviews for a particular product based on a specific criteria. In this paper, we describe our approaches and results for modeling the ranking of reviews based on their usefulness score, this being the first of the three subtasks under this shared task. Instead of ...

In this paper, we proposed a modified D-S decision-making approach. Firstly, the definition of drop-falling distance was given and the dropfalling similarity was derived, based on which the credence was obtained. Then, the uncertainties were considered since they reflect the reasonableness of possibility distributions. Finally, a binary linear weight function was derived with respect to the cre...

This paper introduces “class-aware similarity hashes” or “classprints,” which are an outgrowth of recent work on similarity hashing. The approach builds on the notion of context-based hashing to create a framework for identifying data types based on content and for building characteristic similarity hashes for individual data items that can be used for correlation. The principal benefits are th...

We divide the class of infinite computable trees into three types. For the first and second types, 0 computes a nontrivial self-embedding while for the third type 0 computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial selfembeddings of infinite computable trees considered up to isomorphism. We show that every infin...

t his paper presents a new feature selection approach for automatically extracting   ms lesions in 3d mr images. presented method is applicable to different types of ms lesions. in this method, t1, t2 and flair images are firstly preprocessed. in the next phase, effective features to extract ms lesions are selected by using a genetic algorithm. the fitness function of the genetic algorithm is t...