Глоссарий





Новости переводов

16 мая, 2024

Translating UMI-CMS based website

19 апреля, 2024

Translations in furniture production

07 февраля, 2024

Ghostwriting vs. Copywriting

30 января, 2024

Preparing a scientific article for publication in an electronic (online) journal

20 декабря, 2023

Translation and editing of drawings in CAD systems

10 декабря, 2023

About automatic speech recognition

30 ноября, 2023

Translation services for tunneling shields and tunnel construction technologies



Глоссарии и словари бюро переводов Фларус

Поиск в глоссариях:  

Markov tree

Глоссарий по искусственному интеллекту
    A markov tree representation of a graphical net is required to apply the fusion and propagation algorithm to that net. a tree is a markov tree if its nodes are labeled with sets of variables and the tree has the property that for every subset of variables that are on the tree, the subtree constructed from nodes containing those variables is also connected. see also: belief net, cluster tree, junction tree.




Markov chain, английский
  1. Цепь маркова

  2. A model describing state transitions, where each state has a set of possible successor states and an associated probability distribution. the probability distribution depends only on the current state, and not on the history or path of states that were traversed to reach the current state. it can be represented by either its state graph, a directed graph with arcs showing permissible transitions or a transition matrix. in the example below, the transition matrix describes a three-state system. if the system is in the first state, it stays there with probability 0.5, or moves to either of the other two states with probability 0.25. if the system is in the second state, it will stay there with probability 0.3, move to the first state with the same probability, or to the third state with probability 0.4. when the system is in the third state, it stays in that state with probability 0.7 or moves to the second with probability 0.3. it will never move to state one from state three. the transition matrix forms a conditional in the probabilistic expert system sense. table m.2 — a 3 state transition matrix


Markov chain monte carlo, английский

Markov condition, английский
    If an attribute y is not an effect of x, then x and y are conditionally independent given the direct causes of x. markov decision problem (mdp) a repeated decision problem against "nature" where the decision maker has complete information and strategic certainty, where nature`s next action depends probabilistically on its current state and the action chosen.


Markov editing, английский
    Редактирование


Markov grammar, английский
    A markov grammar is an alternative to traditional statistical parsers. rather than storing a series of explicit parsing rules and their associated probabilities, a markov grammer stores transition probabilities that allow it to create rules on the fly.


Markov process, английский

Markov random field, английский
    A markov random field is a general graphical model for the dependency of a set of variables represented as nodes. it has the property that the distribution of a particular node is only a function of its immediate neighbors, and the global distribution is a product of the clique potentials. for the example graph given under the factor graph entry, the global distribution can be written as p(a, b, c, d) = p(a)p(b | a)p(c | a, b)p(d | c). see also: belief net, factor graph.


Markov source, английский
    Марковский источник


Markovian dependence, английский
    The condition where observations in a time series are dependent on previous observations in the near term. markovian dependence dies quickly, while long-memory effects like hurst dependence, decay over very long time periods.


Markovian machine, английский
    Марковская машина


Markovian process, английский
    Марковский процесс


Markovnikovite, английский

Markov`s inequality, английский
    For lists: if a list contains no negative numbers, the fraction of numbers in the list at least as large as any given constant a>0 is no larger than the arithmetic mean of the list, divided by a.


Tree, английский
  1. A plant having a permanently woody main stem or trunk, ordinarily growing to a considerable height, and usually developing branches at some distance from the ground

  2. Woody plant that usually grows to at least 20 feet in height at maturity, typically having a single trunk with no branches within 3 feet of the ground (11).

  3. A network architecture in which transmission routes branch out from a central point.

  4. A partially ordered set where each object is either a parent or child of other objects, and no object is a parent to any of its ancestors. the parent/child/ancestors terms are metaphors for a simple ordering relationship. if object a precedes object b then object a is the "parent" of b and b is "a child of" b. a is an ancestor of b as is any ancestor of a. figure t.2 —

  5. Transit radiation effects on electronic equipment


Tree, английский

Tree, английский

Tree agate, английский

Tree bark, английский
    A term describing the rippled or wavy effect sometimes seen when a bonded fabric is stretched in the horizontal (widthwise) direction. this defect is caused by bias tensions present when two distorted or skewed fabrics are bonded.


Tree belt, английский
    A strip between the sidewalk and curb of a road, planted with grass and sometimes with shade trees. tree-dozer an attachment for the front of a tractor consisting of metal bars and a cutting blade; used in clearing land of small trees, bushes, and the like.


Tree cap, английский
    Колпак фонтанной арматуры


Representation, английский
  1. N репрезента- ция, представление knowledge ~ представление знаний internal ~ псхл. внутреннее представление mental ~ ментальная репрезентация

  2. A collateral statement of such facts not inserted on the policy of insurance, as may give the underwriters a just estimate of the risk of the adventure. (see warranty.)

  3. A representation is a set of conventions about how to describe a class of things. representation will generally consist of four parts: 1. a lexicon that determines which symbols are in it vocabulary; 2. a structural part that describes the constraints on the symbols; 3. a collection of methods or procedures that allow the symbols to be manipulated and queried; and 4. a semantics that specifies the meaning of the symbols and their relationships. re-ranking in handwriting and text recognition systems, the task of re-ranking allows the candidate interpretations developed by the recognizer to be ranked or scored according to the language model. see also: word n-gram re-ranking, word-tag model.

  4. If something stands in place of or is chosen to substitute for something else, the former is considered a representation of the latter. e.g., representation of constituencies in government, linguistic representation of an event (->symbol). the 66 belief that all knowledge is a representation of the properties of the real world is as unacceptable as the insistence that all descriptions or messages are about something else.


Propagation, английский
  1. Прохождение, распространение (напр, радиоволн)

  2. An act of causing something to spread or multiply

  3. Распространение; размножение; продвижение; передача

  4. Распространение

  5. The process of distributing an index from a content index server to one or more web servers for the purposes of providing search.

  6. Advancement of a wave through a medium.

  7. Advancement of energy or a crack through a medium. see also brittle crack propagation; ductile crack propagation; fatigue crack propagation.

  8. Movement of a wave through a medium.7,21


Constructed, английский
    Построенный


Containing, английский

Markov random field, английский
    A markov random field is a general graphical model for the dependency of a set of variables represented as nodes. it has the property that the distribution of a particular node is only a function of its immediate neighbors, and the global distribution is a product of the clique potentials. for the example graph given under the factor graph entry, the global distribution can be written as p(a, b, c, d) = p(a)p(b | a)p(c | a, b)p(d | c). see also: belief net, factor graph.


Boltzman machine, английский
    A massively parallel computer that uses simple binary units to compute. all of the memory of the computer is stored as connection weights between the multiple units. it changes states probabilistically.