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