Information theory - тест
A) Seismic exploration B) Bioinformatics C) Gambling D) Cryptographic use
A) Integrated neural clusters B) Random seeds external to the software C) Analog processing methods D) High Shannon entropy
A) Via digital noise B) Through Shannon entropy C) Via extractors D) By using semiotic signs
A) Effective information B) Min-entropy C) Free energy D) Dynamic core hypothesis
A) Algorithmic entropy B) Rényi entropy C) Thermal entropy D) Conditional entropy
A) In semiotic code control B) In minimizing free energy C) In evaluating randomness in cryptographic systems D) In seismic oil exploration
A) No B) Yes C) Only for pseudorandom numbers D) Only in cryptographic systems
A) Black hole analysis B) Seismic oil exploration C) Bioinformatics D) Search for extraterrestrial intelligence
A) Minimize free energy in the brain B) Strip off and separate unwanted noise from the desired seismic signal C) Decode dominant social messages D) Generate secure pseudorandom numbers
A) Information theory and digital signal processing B) Free energy principles C) Cryptographically secure pseudorandom number generators D) Extractors and Rényi entropy
A) Umberto Eco and Ferruccio Rossi-Landi B) Doede Nauta and Winfried Nöth C) Gerald Edelman and Giulio Tononi D) Karl J. Friston and Andrey Kolmogorov
A) The separation of unwanted noise from seismic signals B) The minimization of free energy in a self-organized system C) The study of the internal processes of coding, filtering, and information processing D) The measurement of sufficient randomness in extractors
A) C.E. Shannon and R.V.L. Hartley B) Gerald Edelman and Karl J. Friston C) Doede Nauta and Winfried Nöth D) Umberto Eco and Ferruccio Rossi-Landi
A) Through digital signal processing of seismic signals B) By using signs that exhibit a high degree of redundancy C) By utilizing cryptographically secure pseudorandom seeds D) By applying the free energy principle
A) To extract random numbers for cryptography B) To explore seismic oil deposits C) To study black holes and bioinformatics D) To analyze the integrated process organization of neural information
A) The issue of seismic noise filtering B) The binding problem in cognitive neuroscience C) The problem of algorithmic complexity D) The paradox of extraterrestrial intelligence
A) Doede Nauta and Winfried Nöth B) R.V.L. Hartley and C.E. Shannon C) Gerald Edelman and Giulio Tononi D) Umberto Eco and Ferruccio Rossi-Landi
A) Effective information B) Seismic signal processing C) Shannon entropy D) Min-entropy
A) External cryptographic random seeds B) Analog methods of data transmission C) A high degree of redundancy in signs D) A reentrant process organization
A) The coding and filtering processes studied in semiotics B) The generation of pseudorandom numbers using extractors C) The filtering of unwanted noise from desired seismic signals D) The synchronization of neurophysiological activity between groups of neuronal populations
A) Charles Sanders Peirce B) Giulio Tononi C) Karl J. Friston D) Gerald Edelman
A) An analog seismic receiver B) A cryptographic random number generator C) A dominant social class D) A self-organized system
A) The Bayesian brain hypothesis B) The semiotic information theory C) The integrated information theory D) The dynamic core hypothesis
A) Search for extraterrestrial intelligence B) Phrenology C) Astrology D) Alchemy
A) Tectonic plates B) Neural clusters C) Seismic waves D) Black holes
A) Bioinformatics B) Biophysics C) Biomechanics D) Biochemistry
A) Crosswords B) Gambling C) Chess D) Cipher creation
A) R.V.L. Hartley B) Doede Nauta C) Umberto Eco D) Gerald Edelman
A) Ferruccio Rossi-Landi B) C.E. Shannon C) Giulio Tononi D) Winfried Nöth
A) Karl J. Friston B) Charles Sanders Peirce C) Andrey Kolmogorov D) Winfried Nöth
A) Dynamic core hypothesis B) Integrated information theory C) History of information theory D) Free energy principle
A) A single organ B) A block cipher C) A network D) A brute force attack
A) Unicity distances B) Symmetric keys C) Distinct physiological states D) Information theory units
A) Why brute force attacks succeed B) Why it ceases permanently C) How it occurs D) How encryption keys are generated
A) Cryptographic interactions B) Enigma machine interactions C) One-time pad interactions D) Cardio-respiratory interactions
A) Cryogenic laboratory environments B) Extreme environments C) Underground bunker environments D) Simulated virtual environments
A) The ban B) The byte C) The bit D) The shannon
A) The Unicity project B) The Venona project C) The Enigma project D) The Ultra project
A) One-time pad code B) Lorenz cipher code C) Symmetric key code D) Enigma machine code
A) It is extremely easy using symmetric keys B) It requires no computational effort C) It is much more difficult than it might first appear D) It is completely impossible under any circumstances
A) A conditional mutual attack B) A network physiology attack C) A brute force attack D) An information-theoretic attack
A) Secret key algorithms B) Unicity distance algorithms C) One-time pads D) Asymmetric algorithms
A) Block ciphers B) Bans C) Transfer entropy D) One-time pads
A) Care B) Transfer entropy C) Block ciphers D) Brute force
A) The Network Physiology project B) The Enigma project C) The Venona project D) The Ultra project
A) Channel coding B) Rate-distortion theory C) Lossless data compression D) Lossy data compression
A) Source-channel separation theorems B) Rate-distortion theory C) Channel resolvability D) Pragmatic information
A) Bits B) Distortion functions C) Bytes D) Entropy
A) The broadcast channel B) The relay channel C) The multiple-access channel D) The wiretap channel
A) The multiple-access channel B) The broadcast channel C) The relay channel D) The wiretap channel
A) The broadcast channel B) The relay channel C) The wiretap channel D) The multiple-access channel
A) Conditional entropy B) Mutual information C) Kullback-Leibler divergence D) Cross-entropy
A) Product space B) Metric space C) Euclidean space D) Vector space
A) -log2(pi) B) -ln(pi) C) 1 / pi D) log2(pi)
A) The geometric mean B) The median C) The weighted average D) The maximum value
A) No information B) 1 shannon C) 2000 bits D) 1000 shannons
A) 1948 B) 1960 C) 1939 D) 1952
A) 1930s B) 1920s C) 1940s D) 1950s
A) Quantum computing B) Molecular biology C) Artificial intelligence D) Telecommunication
A) 2 bits B) Zero C) 0.5 bits D) 1 bit
A) DSL B) ZIP files C) Voyager missions D) Compact discs
A) Artificial intelligence B) ZIP files C) Mobile phones D) DSL
A) Curiosity rover B) Hubble telescope C) Voyager missions D) Apollo missions
A) Compact disc B) Steam engine C) Radio D) Television
A) Electric guitars B) Mobile phones C) Airplanes D) Automobiles
A) The telegraph network B) The postal service C) The Internet D) The printing press
A) Optical computing B) Quantum computing C) Distributed computing D) Cloud computing
A) Sculpture casting B) Oil painting restoration C) Art creation D) Architectural drafting
A) Music B) Vocal cord anatomy C) Musical instrument design D) Acoustic room resonance
A) Metaphysics B) Ethics C) Epistemology D) Aesthetics
A) Ralph Hartley B) Vannevar Bush C) James Gleick D) Harry Nyquist
A) 1928 B) 1948 C) 1939 D) 1940
A) James Gleick B) Vannevar Bush C) Ludwig Boltzmann D) Alan Turing
A) Claude Shannon B) Alan Turing C) Harry Nyquist D) Ralph Hartley
A) PV = nRT B) E = mc2 C) W = K log m D) H = log Sn
A) The bit B) The byte C) The decimal digit D) The baud
A) Alan Turing B) Harry Nyquist C) Ralph Hartley D) Claude Shannon
A) Vannevar Bush B) James Gleick C) Harry Nyquist D) Rolf Landauer
A) Binary logarithm B) Common logarithm C) Decimal logarithm D) Natural logarithm
A) Natural logarithm B) Binary logarithm C) Common logarithm D) Base-two logarithm
A) Binary logarithm B) Natural logarithm C) Base-e logarithm D) Common logarithm
A) The most unpredictable state B) The lowest possible information content C) A deterministic sequence D) The most predictable state
A) Base-e B) Base-10 C) Base-256 D) Base-2
A) A Bernoulli trial B) A Markov trial C) A logarithmic trial D) An equiprobable trial
A) Marginal entropy B) Joint entropy C) Equivocation D) Mutual information
A) Pointwise mutual information B) Kullback-Leibler divergence C) Transinformation D) Log-likelihood ratio
A) Communication B) Thermodynamics C) Quantum mechanics D) Macroeconomics
A) Kullback-Leibler divergence B) Mahalanobis distance C) Jensen-Shannon divergence D) Euclidean distance
A) Log-likelihood ratio test B) Student's t-test C) Mann-Whitney U test D) Shapiro-Wilk test
A) Euclidean metric B) Inner product C) Semi-quasimetric D) Linear transformation
A) Both B) Neither C) Alice D) Bob
A) Both will be equally surprised B) Alice C) It is impossible to determine D) Bob
A) An infinite continuous set B) An empty set C) A discrete set D) A finite geometric set
A) Yes B) Only in quantum states C) No D) Only in macroscopic mechanics
A) {X0, X1, ..., X_{n-1}} B) {X1, X2, ..., X_n} C) {X1, Y1, ..., X_n, Y_n} D) {Y1, Y2, ..., Y_n}
A) A result of zero B) The same result C) Completely different results D) An undefined value
A) A negligible factor in modern systems B) An inherent fixed property C) An unpredictable random variable that changes constantly D) A completely controllable variable
A) p B) Hb C) e D) i
A) Delays the input bit B) Flips the input bit C) Duplicates the input bit D) Erases the input bit
A) Gaussian noise B) Memory C) Zero capacity D) Ternary input |
Створено з That Quiz —
сайт для створення тестів і оцінювання з математики та інших предметів.