log-path

См. также в других словарях:

• log — log·an; log·a·rithm; log·a·rith·mic; log; log·ger; log·ger·head; log·ger·head·ed; log·gets; log·gia; log·gish; log·i·cal; log·i·cal·i·ty; log·i·cal·iza·tion; log·i·cal·ize; log·i·cism; log·i·cize; log·ic·less; log·i·co ; log·ics; log·man;… …   English syllables

• path´o|log´i|cal|ly — path|o|log|i|cal «PATH uh LOJ uh kuhl», adjective. 1. of pathology; dealing with diseases or concerned with diseases: »pathological studies. 2. due to disease or accompanying disease: »a pathological condition of the eye. SYNONYM(S): morbid.… …   Useful english dictionary

• path|o|log|i|cal — «PATH uh LOJ uh kuhl», adjective. 1. of pathology; dealing with diseases or concerned with diseases: »pathological studies. 2. due to disease or accompanying disease: »a pathological condition of the eye. SYNONYM(S): morbid. –path´o|log´i|cal|ly …   Useful english dictionary

• path|o|log|ic — «PATH uh LOJ ihk», adjective. = pathological. (Cf. ↑pathological) …   Useful english dictionary

• path|o|phys|i|o|log|i|cal — «PATH uh FIHZ ee uh LOJ uh kuhl», adjective. of or having to do with pathophysiology …   Useful english dictionary

• Log-distance path loss model — The log distance path loss model is a radio propagation model that predicts the path loss a encounters inside a building or densely populated areas over distance.Applicable to / Under conditionsThe model is applicable to indoor propagation… …   Wikipedia

• Log-normal distribution — Probability distribution name =Log normal type =density pdf μ=0 cdf μ=0 parameters =sigma > 0 infty < mu < infty support = [0,+infty)! pdf =frac{1}{xsigmasqrt{2piexpleft [ frac{left(ln(x) mu ight)^2}{2sigma^2} ight] cdf =frac{1}{2}+frac{1}{2}… …   Wikipedia

• Log boom — A log boom was a barrier placed in a river, designed to collect and or contain floating logs timbered from nearby forests sometimes called a fence or bag. The term is also used as a place where logs were collected into booms, as at the mouth of a …   Wikipedia

• Path loss — Die Artikel Pfadverlust und Dämpfung überschneiden sich thematisch. Hilf mit, die Artikel besser voneinander abzugrenzen oder zu vereinigen. Beteilige dich dazu an der Diskussion über diese Überschneidungen. Bitte entferne diesen Baustein erst… …   Deutsch Wikipedia

• path·o·log·i·cal — …   Useful english dictionary

• Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… …   Wikipedia