Provision of historical information based on geographical location represents a new scope of connecting the present of a certain location or landmark with its history through a timescape panorama. This may be achieved by exploring a linear timeline of photos for certain areas and landmarks that have both historic and modern photos. Matching modern to historical images requires a special effort ...

let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.

To facilitate the damping matching of dampers for vehicle passive suspensions, this paper proposes an analytical matching method of the optimal piecewise linear damping characteristics curve. Based on the vehicle vibration model, taking the suspension dynamic deflection as the constraint, by the vibration acceleration and the wheel dynamic load, an objective function about the relative damping ...

Matching is a classic problem with a rich history and a significant impact, both on the theory of algorithms and in practice. Recently there has been a surge of interest in the online version of matching and its generalizations, due to the important new application domain of Internet advertising. The theory of online matching and allocation has played a critical role in designing algorithms for...

template matching is a widely used technique in many of image processing and machine vision applications. in this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to rotation, scale, translation and brightness (rstb) changes. for this purpose, we adopt the idea of ring projection transform (rpt) of image. in the proposed algorithm, two novel s...

The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...