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