The criminal nature of narcotics complicates the direct assessment of a drug community, while having a good understanding of the type of people drawn or currently using drugs is vital for finding effective intervening strategies. Especially for the Russian Federation this is of immediate concern given the dramatic increase it has seen in drug abuse since the fall of the Soviet Union in the earl...

In order to describe the lactation curves of milk yield (MY) and composition in buffaloes, seven non-linear mathematical equations (Wood, Dhanoa, Sikka, Nelder, Brody, Dijkstra and Rook) were used. Data were 116 117 test-day records for MY, fat (FP) and protein (PP) percentages of milk from the first three lactations of buffaloes which were collected from 893 herds in the period from 1992 to 20...

In this study, an approach for generating the shortest-distance passage plan a ship is proposed considering navigable area obtained based on automatic identification system data. The designated information from electronic navigational chart and by traffic density using Jenks natural breaks classification. shortest-path algorithms used in our experiment are Dijkstra, A*, improved A*. Then, Dougl...

This correspondence concerns a recent publication in by Liu et al. Cancer Cell who analyzed a long noncoding RNA (lncRNA) that they designated “ ”. NKILA Liu et al. found that (1) is upregulated by immunostimulants, (2) has a NKILA promoter with an NF-ĸB binding motif, (3) can bind to the p65 protein of the NF-ĸB transcription factor and then interfere with phosphorylation of IĸBα, and (4) nega...

We are given a directed graph G = (V,E) with n vertices and m edges, with positive weights on the edges, and a parameter k > 0. We show how to compute, for every vertex v ∈ V , its k nearest-neighbors. The algorithm runs in O(k(n log n + m)) time, and follows by a somewhat careful modification of Dijkstra’s shortest path algorithm. This result is probably folklore, but we were unable to find a ...

We present a technique for reducing the number of edge scans performed by Dijkstra’s algorithm for computing all pairs shortest paths. The main idea is to restrict path scanning only to locally shortest paths, i.e., paths whose proper subpaths are shortest paths. On a directed graph with n vertices and m edges, the technique we discuss allows it to reduce the number of edge scans from O(mn) to ...

Penetration testing (pentesting) is a well established method for identifying security weaknesses, by conducting friendly attacks. Simulated pentesting automates this process, through designing a model of the system at hand, and using modelbased attack planning to generate the attacks. Classical planning variants of this idea are being used commercially by the pentesting industry since 2010. Su...

Combining scenario construction with the characteristics of individual emergency behavior is necessary for route planning major chemical accidents. We investigated this challenging decision problem and constructed a multi-indicator risk assessment method that considers evacuation speed different population types health consequences caused by various components. also designed modified Dijkstra a...