finite-source queueing model - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

finite-source queueing model - перевод на русский

Source Filter Model of Speech Production; Source-filter model of speech production; Source–filter model of speech production; Source-filter model; Source/filter model; Source/filter theory; Source–filter theory; Source-filter theory
  • One possible combination of source and filter in the human vocal tract.
Найдено результатов: 2180
finite-source queueing model      
ТМО модель с конечным источником требований
source program         
  •  url-status = dead}}</ref><!-- See http://cm.bell-labs.com/cm/cs/who/dmr/ctut.pdf for original.-->
COLLECTION OF COMPUTER INSTRUCTIONS WRITTEN USING SOME HUMAN-READABLE COMPUTER LANGUAGE
Sourcecode; Source-code; Source file; Source program; Source tree; Yuanma; Source form; Source files
исходная программа
source program         
  •  url-status = dead}}</ref><!-- See http://cm.bell-labs.com/cm/cs/who/dmr/ctut.pdf for original.-->
COLLECTION OF COMPUTER INSTRUCTIONS WRITTEN USING SOME HUMAN-READABLE COMPUTER LANGUAGE
Sourcecode; Source-code; Source file; Source program; Source tree; Yuanma; Source form; Source files

общая лексика

исходная программа

accepting state         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

математика

поглощающее состояние

voltage source         
ELECTRICAL ELEMENT WHICH MAINTAINS A FIXED VOLTAGE ACROSS ITS TWO TERMINALS, REGARDLESS OF CURRENT
Rubber zener; Ideal voltage source; Controlled voltage source; Constant-voltage power supply; Dependent voltage source; Constant voltage source

общая лексика

источник напряжения

finite element analysis         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis

строительное дело

расчёт методом конечных элементов

first-come-first-served         
  • A birth–death process. The values in the circles represent the state of the system, which evolves based on arrival rates ''λ<sub>i</sub>'' and departure rates ''μ<sub>i</sub>''.
  • A black box. Jobs arrive to, and depart from, the queue.
  • First in first out (FIFO) queue example
  • A queueing node with 3 servers. Server '''a''' is idle, and thus an arrival is given to it to process. Server '''b''' is currently busy and will take some time before it can complete service of its job. Server '''c''' has just completed service of a job and thus will be next to receive an arriving job.
MATHEMATICAL STUDY OF WAITING LINES, OR QUEUES
Queuing theory; Queuing Theory; First come, first served; Queue theory; Teletraffic queuing theory; Teletraffic Queuing Theory; First-come, first-served; First-come, first-serve; First come, first serve; FCFS; First-come-first-served; Queueing model; Queueing models; Queue (mathematics); Queueing Theory; Queuing model; First-come first-serve; First-come first-served; First come first served; Queuing systems; Arrival rate; Queueing system; Queueing network; QUEUEING THEORY; First come first serve; Stochastic network; Queue Theory; Waiting line theory; Theory of queuing; First Come - First Serve; Reversible queueing system
finite state machine         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

общая лексика

конечный автомат, КА

вычислительная модель, описывающая автомат с конечным числом состояний. Одно из них называется "начальным состоянием". Автомат переходит из одного состояния в другое под влиянием "управления", зависящего от внешних воздействий: получаемых сигналов или данных. Назначением каждого состояния является запоминание определённого момента истории системы. По типу управления КА делятся на детерминированные (находящиеся в каждый момент времени только в одном состоянии) и недетерминированные (могут одновременно находиться в нескольких состояниях). КА широко применяются в программировании, например в лексических анализаторах компиляторов

синоним

finite-state machine; FSM

Смотрите также

cumulative throughflow; fractional throughflow

finite element method         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis

строительное дело

метод конечных элементов

finite element method         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis
[матем.] метод конечных элементов

Википедия

Source–filter model

The source–filter model represents speech as a combination of a sound source, such as the vocal cords, and a linear acoustic filter, the vocal tract. While only an approximation, the model is widely used in a number of applications such as speech synthesis and speech analysis because of its relative simplicity. It is also related to linear prediction. The development of the model is due, in large part, to the early work of Gunnar Fant, although others, notably Ken Stevens, have also contributed substantially to the models underlying acoustic analysis of speech and speech synthesis. Fant built off the work of Tsutomu Chiba and Masato Kajiyama, who first showed the relationship between a vowel's acoustic properties and the shape of the vocal tract.

An important assumption that is often made in the use of the source–filter model is the independence of source and filter. In such cases, the model should more accurately be referred to as the "independent source–filter model".

Как переводится finite-source queueing model на Русский язык