The task of identifying similar regions within and between cities is an important aspect urban data science as well applied domains such real estate, tourism, planning. Regional similarity typically assessed through comparing socio-demographic variables, resource availability, or infrastructure. An essential dimension, often overlooked for this task, the spatiotemporal mobility patterns people ...

Decision matrix in group decision making problems depends on a lot of criteria. It is essential to know the necessity ofweight or coefficient of each criterion. Accurate and precise selection of weight will help to achieve the intended goal.The aim of this article is to introduce a linear programming model for recognizing the importance of each criterion inmulti criteria group decision making w...

We consider algorithms with access to an unknown matrix M ε F n×d via matrix-vector products , namely, the algorithm chooses vectors v 1 ⃛ q and observes Mv . Here i can be randomized as well chosen adaptively a function of i-1 Motivated by applications sketching in distributed computation, linear algebra, streaming models, connections areas such communication complexity property testing, we ini...

A large number of algorithms have been developed to identify population structure from genetic data. Recent results show that the information used by both model-based clustering methods and Principal Components Analysis can be summarised by a matrix of pairwise similarity measures between individuals. Similarity matrices have been constructed in a number of ways, usually treating markers as ind...

SinR is a transcription factor which controls expression of stress tolerance sin genes related to alternate development processes under stress condition. Identification of genome wide SinR-box motif and their regulated genes has not been worked out yet in Bradyrhizobium japonicum. For this, a weight matrix of 9 bp was developed from the known promoter sequences of Bacillus subtilis, which was t...

Dot-matrix sequence similarity searches can be greatly speeded up through use of a table listing all locations of short oligomers in one of the sequences to find potential similarities with a second sequence. The algorithm described finds similarities between two sequences of lengths M and N, comparing L residues at a time, with an efficiency of L X M X N/(SK) where S is the alphabet size, and ...