We present short proofs on the mistake bounds of the 1-nearest neighbor algorithm on an online prediction problem of path labels. The algorithm is one of key ingredients in the algorithm by Herbster, Lever, and Pontil for general graphs. Our proofs are combinatorial and naturally show that the algorithm works when the set of labels is not binary.

the dogleg severity is one of the most important parameters in directional drilling. improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...

With the ease of appending new nodes without re-installing whole network, Internet Things (IoT) builds several smart applications on Wireless Mesh Network (WMN). One important aspects integrating WMN and IoT is to provide an energy-efficient reliable routing protocol. Seeking communication route that delivers high-quality stream quickly over issue, but maximum utilization a single path leads po...

In this work, one and two-dimensional lattices are studied theoretically by a statistical mechanical approach. The nearest and next-nearest neighbor interactions are both taken into account, and the approximate thermodynamic properties of the lattices are calculated. The results of our calculations show that: (1) even though the next-nearest neighbor interaction may have an insignificant ef...

We present a machine learning technique that recognizes patterns of normal movement, using GPS data and time stamps, to gain the ability to detect regions of time containing abnormal movement. We argue people move throughout regions of time in established patterns, and a person’s normal movement can be learned by machines. We use intelligent features extracted from raw GPS data with time stamps...

The unmanned aerial vehicle (UAV) path planning problem is primarily concerned with avoiding collision obstacles while determining the best flight to target position. This paper first establishes a cost function transform UAV route issue into an optimization that meets UAV’s feasible requirements and safety constraints. Then, this introduces modified Mayfly Algorithm (modMA), which employs expo...

We propose new approach to numerical study of quantum spin systems. Our method is based on a fact that one can use any set of states for the path integral as long as it is complete. We apply our method to one-dimensional quantum spin system with next-to-nearest neighbor interactions. We found remarkable improvement in negative sign problem.

Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges to an unpleasant distance function on the underlying space whose properties are...

In this paper, we study some functional inequalities (such as Poincaré inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy inequalities) for reversible nearest-neighbor Markov processes on a connected finite graph by means of (random) path method. We provide estimates of the involved c...