What is the translation of " RANDOM SEQUENCE " in Slovenian?

• naključnega zaporedja
• naključno zaporedje

Examples of using Random sequence in English and their translations into Slovenian

It's pretty difficult to consciously pick a random sequence.
Zelo težko je zavestno izbrati naključno zaporedje.

After all, any particular random sequence of 41 outcomes is also highly improbable.
Ne nazadnje je vsako določeno naključno zaporedje 41 izidov tudi zelo malo verjetno.

We're up against 64-bit encryption. A password that's a random sequence of 12 symbols.
Opravka imamo s 64-bitnim kodiranjem, ter geslom, ki je sestavljeno iz 12 naključnih znakov.

People will rate random sequences they have heard on repeated loop as more musical than a random sequence they have only heard once.
Ljudje so ocenili naključne sekvence, ki se ponavljajo, kot bolj muzikalične od naključnih sekvenc, ki so jih slišali enkrat.

A similar effect happens with random sequences of sound.
Podoben učinek se zgodi z naključnimi sekvencami zvoka.

Superstition, it's bringing a… A probabilistic framework and projecting meaning onto a completely random sequence.
Praznoverje vnaša verjetnostni okvir in projicira smisel v naključno zaporedje.

Random sequences also contain little information, because there are many possible random sequences(so Ω1 is almost as large as Ω0).
Tudi naključna zaporedja vsebujejo malo informacij, ker obstajajo številna možna naključna zaporedja(tako je Ω1 skoraj tako velika kot Ω0).

Enter passphrase for %1: Passphrase should include non alphanumeric characters and random sequences.
Vnesite šifrirno frazo za% 1: Šifrirna fraza naj vsebuje ne- alfanumerične znake in naključne nize.

Denjoy's probabilistic argument for the Riemann hypothesis(Edwards 1974) is based on the observation that if μ(x) is a random sequence of"1"s and"- 1"s then, for every εgt; 0, the partial sums.
Denjoyev verjetnostni argument za Riemannovo domnevo[15] temelji na opažanju, da, če je μ(x) naključno zaporedje števil»1« in»- 1«, potem so za vsak εgt; 0 delne vsote:.

There are also controls for changing the way the sequencer plays notes, allowing you to create sequences from back to front or trigger a random sequence.
Obstajajo tudi kontrolnike za spreminjanje poti na sekvencer igra opombe, ki omogoča ustvarjanje zaporedja iz nazaj v prednji ali sproži naključnem zaporedju.

They take the information in the block, and apply a mathematical formula to it, turning it into a far shorter, seemingly random sequence of letters and numbers known as a hash.
Da vzamejo podatke iz bloka ter uporabijo matematično formulo za to, da jih spremenijo v nekaj drugega, in sicer v veliko krajše, na videz naključno zaporedje črk in številk.

This ensures that items or numbers in the sequence can never be predicted, making the sequence indistinguishable from a truly random sequence.
To zagotavlja, da številk v zaporedju nikoli ni mogoče predvideti, kar omogoča, da je zaporedje nemogoče ločiti od dejanskega naključnega zaporedja.

It is an open question, and one central to the theory and practice of cryptography, whether there is any way to distinguish the output of a high-quality PRNG from a truly random sequence, knowing the algorithms used, but not the state with which it was initialized.
Odprto vprašanje je in zelo pomembno za teorijo in prakso kriptografije, ali obstaja kakšna pot za razlikovanje izhoda zelo kakovostnega generatorja iz resnično naključnega zaporedja brez da bi se poznal algoritem ali algoritmi, ter začetno stanje.

A requirement for a CSPRNG is that an adversary not knowing the seed has the only negligible advantage in distinguishing the generator's output sequence from a random sequence.
Zahteva za kriptografsko varen generator je, da ima nasprotnik, ki ne pozna semena, nepomembno prednost pri razločevanju generatorjevega izhodnega zaporedja od naključnega zaporedja.

It is an open question, and one central to the theory and practice of[[cryptography]], whether there is any way to distinguish the output of a high-quality PRNG from a truly random sequence, knowing the algorithms used, but not the state with which it was initialized.
Večina algoritmov generatorjev psevdonaključnih števil daje zaporedja, ki so enakomerno porazdeljena glede na različne teste. Odprto vprašanje je in zelo pomembno za teorijo in prakso kriptografije, ali obstaja kakšna pot za razlikovanje izhoda zelo kakovostnega generatorja iz resnično naključnega zaporedja brez da bi se poznal algoritem ali algoritmi, ter začetno stanje.

The security of most cryptographic algorithms and protocols using PRNGs is based on the assumption that it is infeasible to distinguish use of a suitable PRNG from use of a truly random sequence.
Varnost večine kriptografskih algoritmov in protokolov, ki rabijo generatorje psevdonaključnih števil, temelji na predpostavki, da ni mogoče razlikovati med rabo primernega generatorja psevdonaključnih števil in resnično naključnega zaporedja.

Distances between where certain values occur are distributed differently from those in a random sequence distribution.
Razdalje med določenimi vrednostmi, ki se pojavijo, so porazdeljene različno od tistih pri porazdelitvi z naključnim zaporedjem.

These include: Shorter than expected periods for some seed states(such seed states may be called'weak' in this context); Lack of uniformity of distribution for large quantities of generated numbers; Correlation of successive values; Poor dimensional distribution of the output sequence; The distances between where certain values occur are distributed differently from those in a random sequence distribution.
V tem smislu se lahko takšna stanja semen imenujejo'šibka', pomanjkanje enoličnosti porazdelitve za velike količine tvorjenih števil, korelacija zaporednih vrednosti, slaba razsežnostna porazdelitev izhodnega zaporedja, razdalje med določenimi vrednostmi, ki se pojavijo, so porazdeljene različno od tistih pri porazdelitvi z naključnim zaporedjem.

An example of this is one-time pad cryptography, where every cleartext bit has a corresponding key from a truly random sequence of key bits.
Primer za to je one-time pad kriptografija, kjer ima vsak čistopis ustrezen ključ iz naključnega zaporedja ključnih bitov.

In other words, the Riemann hypothesis is in some sense equivalent to saying that μ(x) behaves like a random sequence of coin tosses.
IZ drugimi besedami je v nekem smislu Riemannova domneva enakovredna izjavi, da se μ(x) obnaša kot naključno zaporedje metanja kovancev.

In the case of a police investigation of an accident or vehicle-related crime, witnesses usually remember the initial area code letters- it is then quite simple to narrow down suspect vehicles to a much smaller number by checking the authority's database without having to know the full number.[16] The scheme should have sufficient numbers to run until 31 August 2050, assuming there are enough 3 letter random sequences for every combination of area code and age identifier.
Če se zgodi nesreča ali kriminal, povezan z vozilom, si očividci po navadi zapomnijo začetne oznake območja- tako lahko policisti takoj zmanjšajo osumljena vozila na veliko manjše število s preverjanjem podatkovne baze brez celotne številke.[1] Ta shema bi morala imeti dovolj kombinacij lokalnih oznak in določevalcev starosti ter naključnih črk, da bi delovala do 31. avgusta 2050.

A sequence of random numbers has a high probability of containing no identical consecutive elements.
K1- zaporedje naključnih števil z majhno verjetnostjo vsebovanja enakih zaporednih elementov.

K1- A sequence of random numbers with a low probability of containing identical consecutive elements.
K1- zaporedje naključnih števil z majhno verjetnostjo vsebovanja enakih zaporednih elementov.

A mutation is a random change in a sequence of nucleotides.
Mutacija je naključna sprememba v nukleotidnem zaporedju.

People expect that a sequence of events generated by a random process will represent the essential characteristics of that process even when the sequence is short.
Napačno razumevanje naključnosti- ljudje pričakujejo, da bo zaporedje dogodkov, ki ga ustvari naključen proces, reprezentiral temeljne značilnosti tega procesa, tudi če je zaporedje kratko.

Iii misconceptions of chance(it is expected that a sequence of events generated by random process will represent the essential characteristics of that process even when the sequence is short.).
Napačno razumevanje naključnosti- ljudje pričakujejo, da bo zaporedje dogodkov, ki ga ustvari naključen proces, reprezentiral temeljne značilnosti tega procesa, tudi če je zaporedje kratko.

The Misconception of Chance which is described as‘people expect that a sequence of events generated by a random process will represent the essential characteristics of that process even when the sequence is short'2.
Napačno razumevanje naključnosti- ljudje pričakujejo, da bo zaporedje dogodkov, ki ga ustvari naključen proces, reprezentiral temeljne značilnosti tega procesa, tudi če je zaporedje kratko.

Model-based statistics are from a mixed effects linear model using CFA-72h as the response variable, fixed effect factors for treatment, period and treatment sequence, and subject within treatment sequence as a random effect.
Statistični podatki na podlagi modela izhajajo iz linearnega modela mešanih učinkov, kjer je bil koeficient CFA- 72h uporabljen kot spremenljivka odziva, zdravljenje, obdobje in zaporedje zdravljenja kot stalni učinki ter preskušanec v zaporedju zdravljenja kot slučajni učinek.