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