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