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