description: Today, technology is acquiring the capability to sense and respond skilfully to human emotion, and in some cases to act as if it has emotional processes that make it more intelligent. What is driving this progress? I‘ll give examples of the potential for good with this technology in helping people with autism, epilepsy, and mental health challenges such as anxiety and depression. However, the possibilities are much larger: Affect sensing is being used to make ads less boring, and to sell more products. Social robots will need emotional intelligence, in order to not annoy us. Some organizations want to sense human emotion without people knowing or consenting, for example, to detect terrorists in public settings. A few scientists want to build computers that are vastly superior to humans, capable of powers beyond reproducing their own kind. What do we want to see built? And, how might we make sure that new affective technologies make human lives better?

uk: вхід без авторизації

name: Playing God? Towards machines that deny their maker


Webtrends Infinity Analytics

Marco Roccioletti

type: Person

cs: Informatika

de: Informatik

fi: tietojenkäsittelytiede

uk: Комп'ютерні науки

en: Computer Science

fr: Informatique

da: Datalogi

es: Ciencias de la Computación

nl: Informatica

cs: Technické vědy

de: Ingenieurwissenschaften

fi: tekniikka

uk: Інженерія

en: Engineering Sciences

fr: Ingénierie

da: Ingeniørvidenskab

es: Ingeniería

nl: Engineering

TIB AV-Portal

type: Service

type: WebContent

type: MediaObject

@language: de

cs: přihlášení není vyžadováno

de: keine Anmeldung erforderlich

uk: вхід без авторизації

en: no login required

nl: geen login vereist

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)

addressCountry: CH

addressLocality: Zurich

addressRegion: Zurich

type: Organization

cs: Video

de: Video

fi: Video

uk: Відео

en: Video

fr: Vidéo

da: Video

nl: Video

es: Video


cs: Matematika

de: Mathematik

fi: matematiikka

uk: Математика

en: Mathematics

fr: Mathématiques

da: Matematik

es: Matemáticas

nl: Wiskunde

de: Mathematik, Naturwissenschaften

uk: Математика, природничі науки

en: Mathematics, Natural Sciences

uk: вхід без авторизації

name: Vorlesung 01: Was ist Differentialgeometrie

Technische Universität Darmstadt

addressCountry: DE

addressLocality: Darmstadt

addressRegion: Hesse


uk: Математика, природничі науки

uk: вхід без авторизації

name: Vorlesung 02: Wiederholung: Kurven im R und (Um-)Parametrisierung


uk: Математика, природничі науки

uk: вхід без авторизації

name: Vorlesung 03: Wiederholung: Bogenlänge und Normalenvektor


Vorlesung 04: Krümmung I

uk: Математика, природничі науки

uk: вхід без авторизації


Vorlesung 05: Krümmung II

uk: Математика, природничі науки

uk: вхід без авторизації


Vorlesung 06: Differentialgeometrie

uk: Математика, природничі науки

uk: вхід без авторизації


Vorlesung 07: Flächentheorie I

uk: Математика, природничі науки

uk: вхід без авторизації


Vorlesung 08: Flächentheorie II

uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації

name: Vorlesung 09: Normalkrümmung geodätische Krümmung


uk: Математика, природничі науки

uk: вхід без авторизації

name: Vorlesung 10: Wiederholung: (Hyperfläche) param. Flächenstück


uk: Математика, природничі науки

uk: вхід без авторизації

name: Vorlesung 11: Wiederholung: Flächentheorie


uk: вхід без авторизації

name: Dispenstest elektropneumatisch Basisversion: Videoausschnitte Versuchsserie 1 + 2 - Verschiedene Gold und Silberpasten

name: Scientific Precision Instruments (SPI) GmbH


Vorlesung 12: Innere Geometrie

uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації

name: Vorlesung 13: Innere Geometrie, Geodätische, Paralleltransport


Domain of One's Own: Reclaim Your Data

uk: Комп'ютерні науки

description: A Domain of One's Own is an international initiative in higher education to give students and faculty more control over their personal data. The movement started at the University of Mary Washington in 2012, and has since grown to tens of thousands of faculty and students across hundreds of universities. This presentation will explore how Domain of One's Own could provides a powerful example in how higher education could harness application programming interfaces (APIs) to build a more user-empowered data ecosystem at universities.

@language: en

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Demographic change is ongoing in countries like Germany and Japan, as a consequence, societies and health care systems need to adapt. A possible solution to tackle this challenge of a super-ageing society might be digitalisation and robotics. A look to Japan highlights concepts like society 5.0, but does this fit for the European countries as well? Is it desirable from an ethical perspective, will it be accepted by the society and the citizens themselves? We will discuss those issues in our panel discussion with regard to IoT and robotics in the field of elderly care.

uk: вхід без авторизації

name: Do Robots and Digitisation really fit the demands of an ageing society?


uk: Комп'ютерні науки

description: Der Algorithmus ist ein ständiger Gefährte in unserem Leben, erscheint jedoch nach wie vor als eine Blackbox. Wie funktioniert er eigentlich? Welche Auswirkungen hat er auf Dein (Erwerbs-)Leben? Denn je unkalkulierbarer die Verpackung, desto überraschender kann ihr Inhalt sein – mit gravierenden Folgen. [Partnersession]

uk: вхід без авторизації

name: Algorithmen: Zu Risiken und Nebenwirkungen – fragen Sie Ihren Informatiker


uk: Комп'ютерні науки

description: In naher Zukunft wird jeder Erstkontakt ein Bot-Kontakt sein [Partnersession]

uk: вхід без авторизації

name: Künstliche Intelligenz und die Zukunft des Marketing


Please do not disturb!

uk: Комп'ютерні науки

description: Algorithmen bestimmen, was wir tun. Wir bestimmen, was Algorithmen tun. Diese untrennbare Verflechtung von Mensch und Algorithmus wirft Fragen auf: Wie genau gestalten Algorithmen unsere Arbeitswelt – oft auf subtile Weise – um? Wer entscheidet – Mensch oder Algorithmus? Warum ist es uns so wichtig, dass Algorithmen genauer, fairer, objektiver arbeiten als wir? Welche Verantwortung tragen wir beim Einsatz von autonom arbeitenden Algorithmen in der Arbeitswelt?

uk: вхід без авторизації


uk: Комп'ютерні науки

description: "I see you." That's the message Jessica received after her ex-husband planted spyware on her smartphone, giving up her location, messages, and much more. Our 'When Spies Come Home' investigative series into consumer malware, based on gigabytes of hacked data obtained from four spyware companies, reveals the scale of this industry: hundreds of thousands of ordinary people across the world have bought malware that can intercept emails, switch on microphones, steal WhatsApp messages, and more.

uk: вхід без авторизації

name: When Spies Come Home: Inside the Consumer Spyware Industry


uk: Комп'ютерні науки

description: Algorithmic technologies that rely on data don’t necessarily support a social world that many of us want to live in. We must grapple with the biases embedded in and manipulation of these systems, particularly when so many parts of society are dependent on sociotechnical systems.

uk: вхід без авторизації

name: Opening Keynote: How an Algorithmic World Can Be Undermined


uk: Комп'ютерні науки

description: How Google work? How does Google tackle misinformation and controversial content in Search? How is machine learning and AI shaping the future of Search? [Partnersession]

uk: вхід без авторизації

name: Information in the Digital Age: Trust, Diversity and the Future of Search


uk: Математика, природничі науки

uk: вхід без авторизації

name: Vorlesung 14: Wiederholung: Paralleles Vektorfeld (längs einer Kurve)


uk: Математика, природничі науки

uk: вхід без авторизації

name: Vorlesung 15: Geometrische Datenverarbeitung & Approximation


uk: Комп'ютерні науки

description: We present the latest results obtained with a quantum cryptography prototype based on a coherent-one way quantum key distribution (QKD) scheme. To support its continuous high rate secret key generation we developed different low-noise single photon detectors for telecom wavelength based on a sine gating and low-pass-filtering technique, as well as a negative feedback APD in an active hold-off circuit. A newly developed hardware distillation engine allows for continuous operation of secret key distribution up to 1 Mbps. We also present results of our system in a DWDM (dense wavelength-division multiplexing) configuration where only one single fiber is needed to interconnect Alice' and Bob's systems. The final prototype is fully compatible to serve a high-speed encryption device developed in parallel which provides encrypted communication of up to 100 Gbps.

uk: вхід без авторизації

name: 1 Mbps coherent one-way QKD with dense wavelength division multiplexing and hardware key distillation

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)


uk: Комп'ютерні науки

description: Apart from their foundational signicance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are thereby relations in terms of the smooth min-entropy for BB84 and six-state encodings. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove a new uncertainty relation in terms of the smooth min-entropy that is only marginally less strong, but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Renyi entropies that may be of independent interest.

uk: вхід без авторизації

name: A min-entropy uncertainty relation for finite size cryptography


uk: Комп'ютерні науки

description: Quantum cryptography promises the distribution of cryptographic keys secured by fundamental laws of quantum physics. However, results in quantum hacking have demonstrated that the information theoretic security of quantum cryptography protocols does not guarantee security for actual implementations. Most notable are attacks against the vulnerabilities of single photon detectors [1-4]. In this talk we will report the first proof-of-principle demonstration of a new protocol that removes the threat of any such attack [5]. We demonstrated the protocol over 80 km of spooled fibre as well as across different locations within the city of Calgary [6], confirming this protocol as a realistic approach to secure communication and demonstrating the possibility for controlled two-photon interference in a real-world environment, which is a remaining obstacle to realizing quantum repeaters and quantum networks. [1] Lamas-Linares, A., Kurtsiefer, C. Breaking a quantum key distribution system through a timing side channel, Opt. Express 15 (15), 9388-9393 (2007). [2] Zhao, Y., Fung, C.-H. F., Qi, B., Chen, C. & Lo, H.-K. Quantum Hacking: Experimental demonstration of time-shift attack against practical quantum key distribution systems. Phys. Rev. A 78, 042333 (2008). [3] Lydersen, L., Wiechers, C., Wittmann, C., Elser, D., Skaar, J. & Makarov, V. Hacking commercial quantum cryptography systems by tailored bright illumination. Nature Photonics 4, 686–689 (2010). [4] Lydersen, L., Wiechers, C., Wittmann, C., Elser, D., Skaar, J. & Makarov, V. Thermal blinding of gated detectors in quantum cryptography. Opt. Express 18 (26), 27938-27954 (2010). [5] Lo, H.-K., Curty, M. & Qi, B. Measurement-device-independent quantum key distribution. Phys. Rev. Lett. 108, 130503 (2012). [6] Rubenok, A., Slater, J. A., Chan, P., Lucio-Martinez, I., & Tittel, W. Proof-of-principle field test of quantum key distribution immune to detector attacks. arXiv:1204.0738v1 (2012).

uk: вхід без авторизації

name: A quantum key distribution system immune to detector attacks


Authentication

uk: Комп'ютерні науки

description: The Annual Conference on Quantum Cryptography (QCRYPT) is a conference for students and researchers working on all aspects of quantum cryptography. This includes theoretical and experimental research on the possibilities and limitations of secure communication and computation with quantum mechanical devices or in the presence of quantum mechanical devices. (The conference includes but is not limited to research on quantum key distribution.) It is the goal of the conference to represent the previous year's best results on quantum cryptography and to support the building of a research community in quantum cryptography. In order to achieve this goal, the conference will feature both invited and contributed talks, selected by the steering committee and programme committee, respectively. In line with this goal, the conference has no published proceedings. QCRYPT welcomes the submission of any interesting and important result, while allowing researchers from a wide range of disciplines to pursue publication in any appropriate venue.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Randomness is a fundamental resource in modern cryptography. The generation of uniformly random bits using quantum mechanics, while still experimentally challenging, is straightforward from a purely theoretical point of view. Nevertheless, for cryptographic applications it is often crucial to ensure that the random bits generated are completely secure and uncorrelated with any potential “adversary”. For instance, one may imagine that the manufacturer of the randomness-generation device introduced “backdoor entanglement” between the device and her own lab, thereby potentially gaining access to the “random” bits generated. In this talk I will address the question of generating certifiable, fully secure random bits. I will describe a simple protocol that stretches an initial (log n)-bit random string into n random bits. The bits generated are secure, i.e. appear uniformly random from the point of view of any (quantum) adversary, based only on the verification of a simple statistical test based on the CHSH inequality. No assumptions on the randomness-generating device are made other than that is is formed of two components that do not signal to each other. These results strengthen and extend previous work by Colbeck (2009), who first introduced the task of device-independent randomness expansion, and Pironio et al. (Nature 2010), who gave the first rigorous analysis in the non-adversarial setting. The proof of security of our protocol relies on a technique, the “quantum reconstruction paradigm”, previously introduced in the analysis of the task of randomness extraction in connection with privacy amplification. I will introduce that technique and show how it is applied to the setting of randomness expansion. Based on joint work with Umesh Vazirani, arXiv:1111.6054.

uk: вхід без авторизації

name: Certifiable quantum dice Or, universally composable randomness expansion


uk: Комп'ютерні науки

description: A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of the function. In this work we show that any quantum protocol for the computation of a classical deterministic function that outputs the result to both parties (two-sided computation) and that is secure against a cheating Bob can be completely broken by a cheating Alice. Whereas it is known that quantum protocols for this task cannot be completely secure, our result implies that security for one party implies complete insecurity for the other. Our findings stand in stark contrast to recent protocols for weak coin tossing, and highlight the limits of cryptography within quantum mechanics. We remark that our conclusions remain valid, even if security is only required to be approximate.

uk: вхід без авторизації

name: Complete insecurity of quantum protocols for classical two-party computation


uk: Комп'ютерні науки

description: We provide a security analysis for continuous variable quantum key distribution protocols based on the transmission of two-mode squeezed vacuum states measured via homodyne detection. We employ a version of the entropic uncertainty relation for smooth entropies to give a lower bound on the number of secret bits which can be extracted from a finite number of runs of the protocol. This bound is valid under general coherent attacks, and gives rise to keys which are composably secure. For comparison, we also give a lower bound valid under the assumption of collective attacks. For both scenarios, we find positive key rates using experimental parameters reachable today.

uk: вхід без авторизації

name: Continuous variable quantum key distribution: finite-key analysis of composable security against coherent attacks


uk: Комп'ютерні науки

description: We demonstrate for the first time that long-distance quantum key distribution can be achieved with continuous variables, using only standard telecommunication components. Furthermore, we obtain a positive secret key rate over long distances even when taking into account finite-size effects. These results correspond to a practical implementation guaranteeing the strongest level of security achievable with QKD and show that continuous-variable quantum key distribution is a technology of choice for near-future secure quantum communications.

uk: вхід без авторизації

name: Experimental demonstration of continuous-variable quantum key distribution over 80 km of standard telecom fiber


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Focus Tutorial: Cryptographic primitives


Focus Tutorial: Optics

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Smooth entropies - A Tutorial: With Focus on Applications in Cryptography


uk: Комп'ютерні науки

description: The ability to send quantum information encoded in photons over large distances is hampered by the unavoidable loss in the communication channel. In classical communication, channel-loss is alleviated by amplifying the information carrier, however, due to the no-cloning theorem for quantum states, this approach is not viable for quantum communication channels. Instead long-distance quantum communication can be enabled by quantum-repeaters, which serve to distribute entanglement over the entire channel by means of entanglement swapping between subdivision of the channel [1]. In order to synchronize the process of entanglement swapping between adjacent subdivisions, quantum repeaters must incorporate quantum memories [2]. A quantum memory is a device that has the ability to (reversibly) map quantum states between photons and atoms [3]. In most of the quantum repeater architectures proposed to date, it is required that quantum memories feature recall on demand. Other desirable attributes of a quantum memory are high fidelity and efficiency, long storage times, and the possibility to simultaneously store multiple carriers of quantum information, i.e. record multiple photonic modes. The combination of a quantum state storage protocol based on an atomic frequency comb (AFC) [4] with rare-earth-ion doped crystals cooled to cryogenic temperatures as storage materials [5] has been shown to meet many of these requirements. In particular, it is well suited for storage of temporally multiplexed photons [6,7]. Yet, despite first proof-of-principle demonstrations [8], recalling the quantum information at a desired time (i.e. read-out on demand) with broadband, single-photon-level pulses remains an outstanding challenge. Fortunately, the AFC protocol allows not only for multimode storage in the time domain, but also in the frequency domain. Here, we will present the first experimental demonstration of frequency-multiplexed storage of attenuated laser pulses followed by read-out on demand in the frequency domain, pointing to a quantum repeater architecture based on frequency multiplexing. Our work is based on the AFC protocol and employs a Tm-doped LiNbO3 waveguide cooled to 4 K [9,10]. Using a serrodyne sideband chirping technique we prepare several frequency-combs in the atomic absorption spectrum. Each section of AFC is a few 100 MHz wide and since we vary the comb-tooth spacing in each section we prepare them with different storage times on the order of 20-150 ns. After the AFC preparation, we send a probe pulse, which is modulated to contain several frequency components that correspond to the centre frequencies of the AFC sections. The mean photon number in each mode is set to be around one. As the probe pulse is mapped to our quantum memory the different frequency modes are mapped to different sections of the AFC and thus recalled at different times. The recalled pulses pass through a frequency filter with a bandwidth matching a single frequency mode. Before frequency filtering we are able to impart again a frequency shift on the recalled pulses, which can hence be set to pass the spectral filter. This constitutes recall on demand of a particular frequency mode. Our multimode quantum memory is highly flexible and can be set to recall all modes at the same time, and adapted to broader or narrower frequency modes. In addition it has been shown to faithfully store time bin qubits in pure and entangled states and preserve all degrees of freedom of the photonic wavefunction [9,11]. Finally, we will argue that, in view of a quantum repeater, our approach based on a multimode memory with read-out on demand in the frequency domain is equivalent to temporal multiplexing and read-out on demand in the temporal domain. This overcomes one further obstacle to building quantum repeaters using rare-earth-ion doped crystals as memory devices. [1] H.-J. Briegel, et al., Phys. Rev. Lett., 81, 5932 (1998) [2] N. Sangouard, et al., Rev. Mod. Phys., 83(1), 33 (2011) [3] A. I. Lvovsky, B. C. Sanders, and W. Tittel, Nat. Photon, 3(12), 706 (2009) [4] M. Afzelius, et al., Phys. Rev. A, 79(5), 052329 (2009) [5] W. Tittel, et al., Laser & Photonics Rev., 4(2), 244 (2010) [6] I. Usmani, et al., Nat Commun, 1 (2010) [7] M. Bonarota, J.-L. Le Gouët, and T. Chanelière, New J. of Phys., 13(1), 013013 (2011) [8] M. Afzelius, et al., Phys. Rev. Lett., 104, 040503 (2010) [9] E. Saglamyurek, et al., Nature, 469(7331), 512 (2011) [10] N. Sinclair, et al., J. of Luminescence, 130(9), 1586 (2010) [11] E. Saglamyurek, et al., Phys. Rev. Lett., 108, 083602 (2012)

uk: вхід без авторизації

name: Frequency-multiplexed photon storage and read-out on demand using an atomic frequency comb-based quantum memory


uk: Комп'ютерні науки

description: We show that the maximum transmission distance of continuous-variable quantum key distribution in presence of a Gaussian noisy lossy channel can be arbitrarily increased using a heralded noiseless linear amplifier. We explicitly consider a protocol using amplitude and phase modulated coherent states with reverse reconciliation. Assuming that the secret key rate drops to zero for a line transmittance Tlim, we find that a noiseless amplifier with amplitude gain g can improve this value to Tlim/g2, corresponding to an increase in distance proportional to logg.

uk: вхід без авторизації

name: Improving the maximum transmission distance of continuous-variable quantum key distribution using a noiseless amplifier


uk: Комп'ютерні науки

description: We present the overview of our recent results in research and development of superconducting single-photon detector (SSPD) practical applications such as quantum cryptography. By optimization of fabrication process and usage of high-quality silicon wafers with SiO2 layer acting as a microcavity we managed to reach up to 35.6% detection efficiency at 1500 nm wavelength. Also we extended its wavelength range beyond 1800 nm by the usage of the fluoride ZBLAN fibres.

uk: вхід без авторизації

name: Infrared NbN superconducting single-photon detector for quantum cryptography and quantum information processing


uk: Комп'ютерні науки

description: Device-independent quantum cryptographic schemes aim to guarantee security to users based only on the output statistics of any components used, and without the need to verify their internal functionality. Since this would protect users against untrustworthy or incompetent manufacturers, sabotage or device degradation, this idea has excited much interest, and many device-independent schemes have been proposed. Here we identify a critical weakness of device-independent quantum cryptographic protocols that rely on public communication between secure laboratories. Untrusted devices may record their inputs and outputs and reveal information about them via publicly discussed outputs during later runs. Reusing devices thus compromises the security of a protocol and risks leaking secret data. Possible defences include securely destroying or isolating used devices. However, these are costly and often impractical. We briefly consider other possible defences available in scenarios where device reuse is restricted.

uk: вхід без авторизації

name: Memory attacks on device-independent quantum


Probing the reality of quantum state

uk: Комп'ютерні науки

description: Is the quantum state real – a property of the system it is assigned to? Or does it represent only our (incomplete) knowledge of the system? It is possible that the second alternative – the epistemic character of the quantum state – comes about because quantum mechanics is obtained by some statistical averaging over a “complete” theory of nature. Such models are often called “hidden variable” models, because the true variables describing the system, the ontic state, are not accessible. Recently Pusey, Barrett and Rudolph [1] showed that, assuming the natural assumption of “preparation independence”, epistemic models of the quantum state are in contradiction with the predictions of quantum theory. “Preparation independence” means that independent preparations of systems correspond to a joint distribution (over the ontic states) is the product of individual distributions. Here we adopt a different approach. We show that, assuming both a form of continuity and separability (a weak form of preparation independence), epistemic interpretations of the quantum state are in contradiction with quantum theory. We also discuss some implications of “hidden-variable” models for cryptography. We then describe a simple high-precision experiment optics experiment that tests some of the predictions of continuous and separable epistemic models. The experiment is particularly simple. It involves attenuated coherent states in time bins of dimension up to 80 propagating in optical fibres. Our experimental results are in agreement with the predictions of quantum theory and provide strong constraints on possible epistemic extensions of quantum mechanics. These results are reported in [2]. [1] M. F. Pusey, J. Barrett, and T. Rudolph, On the reality of the quantum state, Nature Physics, 2309, (2012). [2] M. K. Patra, L. Olislager, F. Duport, J. Safioui, S. Pironio and S. Massar, Experimentally probing the reality of the quantum state, submitted (2012)

uk: вхід без авторизації


QKD widened and deepened

uk: Комп'ютерні науки

uk: вхід без авторизації


Quantum cryptography in Minkowski space

uk: Комп'ютерні науки

description: Quantum theory and the relativistic no-signalling principle both give ways of controlling information, in the sense that someone who creates information somewhere in space-time can rely on strict limits both on how much information another party can extract and on where they can obtain it. An increasingly long list of interesting cryptographic applications exploit the power of the no-signalling principle as well as the properties of quantum information. I describe recent work in this area, including secure protocols for bit commitment, quantum tagging (quantum position authentication) and new intrinsically relativistic cryptographic tasks.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: In this work, we propose the concept of self-testing QKD which is based on a novel local self-testing method. In particular, devices are tested locally independent of the quantum channel, that is, Alice and Bob perform Clauser-Horne-Shimony-Holt (CHSH) tests, an application of Bell's theorem on their own devices, independent of each other and the quantum channel. Note that because the quantum channel is not included in CHSH test, the channel loss cannot be used to open the detection loophole. The security assessment of the quantum channel follows the channel estimation technique of BB84 QKD protocol, i.e., checking for errors in the bases X and Z. Therefore, by deriving the relation between CHSH test and a recent security proof technique (the smooth version of entropic uncertainty relation), the finite-key security proof is obtained under minimal assumptions. Also, our result – a lower bound on the secret key rate – is intuitively related to the almost tight finite-key analysis of BB84 QKD protocol and it differs only by a term that is dependent on the CHSH value. Most importantly, we obtained secret key rates that are comparable to ones of BB84 QKD protocol.

uk: вхід без авторизації

name: Quantum cryptography with local Bell tests


uk: Комп'ютерні науки

description: Key establishment is a crucial primitive for building secure channels: in a multi-party setting, it allows two parties using only public authenticated communication to establish a secret session key which can be used to encrypt messages. But if the session key is compromised, the confidentiality of encrypted messages is typically compromised as well. Without quantum mechanics, key establishment can only be done under the assumption that some computational problem is hard. Since digital communication can be easily eavesdropped and recorded, it is important to consider the secrecy of information anticipating future algorithmic and computational discoveries which could break the secrecy of past keys, violating the secrecy of the confidential channel. Quantum key distribution (QKD) can be used generate secret keys that are secure against any future algorithmic or computational improvements. QKD protocols still require authentication of classical communication, however, which is most easily achieved using computationally secure digital signature schemes. It is generally considered folklore that QKD when used with computationally secure authentication is still secure against an unbounded adversary, provided the adversary did not break the authentication during the run of the protocol. We describe a security model for quantum key distribution based on traditional classical authenticated key exchange (AKE) security models. Using our model, we characterize the long-term security of the BB84 QKD protocol with computationally secure authentication against an eventually unbounded adversary. By basing our model on traditional AKE models, we can more readily compare the relative merits of various forms of QKD and existing classical AKE protocols. This comparison illustrates in which types of adversarial environments different quantum and classical key agreement protocols can be secure.

uk: вхід без авторизації

name: Quantum key distribution in the classical authenticated key exchange framework


Quantum Money from Hidden Subspaces

uk: Комп'ютерні науки

description: Forty years ago, Wiesner pointed out that quantum mechanics raises the striking possibility of money that cannot be counterfeited according to the laws of physics. We propose the first quantum money scheme that is (1) public-key, meaning that anyone can verify a banknote as genuine, not only the bank that printed it, and (2) cryptographically secure, under a “classical” hardness assumption that has nothing to do with quantum money. Our scheme is based on hidden subspaces, encoded as the zero-sets of random multivariate polynomials. A main technical advance is to show that the “black-box” version of our scheme, where the polynomials are replaced by classical oracles, is unconditionally secure. Even in Wiesner's original setting – quantum money that can only be verified by the bank – we are able to use our techniques to patch a major security hole in Wiesner's scheme. We give the first private-key quantum money scheme that allows unlimited verifications and that remains unconditionally secure, even if the counterfeiter can interact adaptively with the bank. Our money scheme is simpler than previous public-key quantum money schemes, including a knot-based scheme of Farhi et al. The verifier needs to perform only two tests, one in the standard basis and one in the Hadamard basis – matching the original intuition for quantum money, based on the existence of complementary observables.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Quantum steering allows two parties to verify shared entanglement even if one measurement device is untrusted, as well as convincing an unbelieving party of the existence of entanglement. I will discuss quantum steering in the contexts of recent experiments [1,2,3] steering the polarization degree of freedom for single photons. The historical context as well as modern motivation for steering will be covered, as well as the similarities and differences in the various recent experiments. Our own work [1], demonstrating quantum steering with high efficiency (62%) in two measurement bases, will be discussed in detail, including the technical challenges in certifying the results due to measurement imperfections of various types. We ultimately demonstrate a violation of some 48 standard deviations of the steering inequality most relevant to applications, which also happens to be the one most difficult to violate. The efficiency demonstrated in this experiment (62%) is half again as high as the previous world record for detection efficiency for an experiment in this context. I will conclude with our current research project – to implement semi-device-independent quantum key distribution [4], with security guaranteed by a steering inequality. This lies in the gap between current QKD implementations and the ultimate security given by device-independent QKD, and, in practical situations, requires a detection efficiency some 10% higher again than our previous result, which should be achievable given the advances made since that result was published. 1. DH Smith, G Gillett et al., Nat. Commun. 3:625 (2012) 2. AJ Bennet et al., Phys. Rev. X 2, 031003 (2012) 3. B Wittmann, S Ramelow et al., New J. Phys. 14, 053030 (2012) 4. C Branciard et al., Phys. Rev. A 85, 010301(R) (2012)

uk: вхід без авторизації

name: Quantum Steering: Experiments and Applications


uk: Комп'ютерні науки

description: The goal of randomness extraction is to distill (almost) perfect randomness from a weak source of randomness. When the source yields a classical string X, many extractor constructions are known. Yet, when considering a physical randomness source, X is itself ultimately the result of a measurement on an underlying quantum system. When characterizing the power of a source to supply randomness it is hence a natural question to ask, how much classical randomness we can extract from a quantum system. To tackle this question we here take on the study of quantum to classical randomness extractors (QC-extractors). We provide constructions of QC-extractors based on measurements in a full set of mutually unbiased bases (MUBs), and certain single qubit measurements. As the first application, we show that any QC-extractor gives rise to entropic uncertainty relations with respect to quantum side information. Such relations were previously only known for two measurements. As the second application, we resolve the central open question in the noisy-storage model [Wehner et al., PRL 100, 220502 (2008)] by linking security to the quantum capacity of the adversary’s storage device.

uk: вхід без авторизації

name: Quantum to classical randomness extractors


Randomness and quantum non-locality

uk: Комп'ютерні науки

uk: вхід без авторизації

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)


Rise of the Quantum Age

uk: Комп'ютерні науки

description: Quantum mechanics is perhaps the most profound revolution ever to occur in our understanding of Nature. While born with last century, it appeared for many decades to be just a game, played by physicists strictly for the sake of advancing pure knowledge, without any impact on everyday life. And then, quantum mechanics gave birth to the transistor, and society was transformed forever. The physicists’ “game” ushered in the Information Age, which is the signature of the 20th century, just as the 19th century was the Machine Age. But we are poised to experience a second quantum revolution in which the full power of the quantum world will be unleashed in ways never before thought possible, transmitting and processing information with unconditionally secure communication and computers powerful beyond imagination. Indeed, the 21st century will go down in history as the Quantum Age.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: We investigate two-party cryptographic protocols that are secure under assumptions motivated by physics, namely relativistic assumptions (no-signalling) and quantum mechanics. In particular, we discuss split models, i.e. models in which certain parties are not allowed to communicate during certain phases of the protocol, for the purpose of bit commitment. We find the minimal splits that are necessary to evade the Mayers-Lo-Chau no-go argument and present protocols that achieve security in these split models. Furthermore, we introduce the notion of local versus global commands, a subtle issue that arises when the split committer is required to delegate agents to perform the open phase separately, without communication. We argue that classical protocols are insecure in the global command model, even when the committer is split. On the other hand, we provide a rigorous security proof in the global command model for a quantum protocol proposed by Kent. The proof employs two fundamental principles of modern physics, the no-signalling property of relativity and the uncertainty principle of quantum mechanics.

uk: вхід без авторизації

name: Secure bit commitment from relativistic constraints


uk: Комп'ютерні науки

description: We prove that Gaussian continuous-variable quantum key distribution protocols, using a Gaussian distribution of coherent or squeezed states and homodyne or heterodyne measurement, are secure against arbitrary attacks. Our proof exploits the speciﬁc symmetries in phase-space of Gaussian QKD protocols to prove that once a simple test over the measurement outcomes succeeds, the global state shared between Alice and Bob is well decribed by assigning a low dimensional Hilbert space to each mode. Then one can use the postselection technique introduced by Christandl, Koenig and Renner for discrete-variable protocols to conclude. Our result greatly improves over previous ones using either a de Finetti theorem or an entropic uncertainty principle which could not be applied to prove the security of protocols in realistic experimental implementations.

uk: вхід без авторизації

name: Security of continuous-variable quantum key distribution against general attacks


uk: Комп'ютерні науки

description: In optical implementations of the phase-encoded BB84 protocol, the bit information is usually encoded in the phase of two consecutive photon pulses generated in a Mach-Zehnder interferometer. In the actual experimental realization, the loss in the arms of the Mach-Zehnder interferometer is not balanced, for example because only one arm contains a lossy phase modulator. Therefore, the amplitudes of the pulses is not balanced, and the structure of the signals and measurements no longer corresponds to the (balanced) ideal BB84 protocol. Hence, the BB84 security analysis no longer applies in this scenario. We provide a security proof of the unbalanced phase-encoded BB84. The resulting key rate turns out to be lower than the key rate of the ideal BB84 protocol. Therefore, in order to guarantee security, the loss due to the phase modulator cannot be ignored.

uk: вхід без авторизації

name: Security proof of the unbalanced phase-encoded BB84 protocol


uk: Комп'ютерні науки

description: The maximal transmission distance of optical quantum communication is reaching a hard limit imposed by the intrinsic loss of the transmission medium, e.g. optical fibre. A quantum repeater promises to push that limit towards much longer, potentially intercontinental distances. Its implementation relies on the development of efficient and long-lived quantum memories that can store and retrieve the quantum properties of light. Sources of photonic entanglement, tailored for quantum memories, are also necessary and represent a challenging experimental task. I will review the efforts of our group towards the realization of quantum memories based on rare-earth-ion doped crystals (REIC) as well as a matching source of photon pair. This approach has recently allowed us to demonstrate several features that are of great importance for quantum repeaters, and for quantum networks in general. After a brief introduction, I will show how we have successfully entangled two neodymium-doped crystals in a heralded fashion. I will then show how polarization qubits encoded in true single photons can be stored in such crystals, despite their intrinsic birefringence and polarization-dependant absorption. I will finally present an on-demand quantum memory exploiting the long hyperfine coherence time of europium ions to store light for up to 8 ms. Our results highlight the great potential of REIC for quantum repeaters.

uk: вхід без авторизації

name: Solid-state quantum memories for quantum repeaters


uk: Комп'ютерні науки

description: Attacks on cryptographic protocols are usually modeled by allowing an adversary to ask queries to an oracle. Security is then defined by requiring that as long as the queries satisfy some constraint, there is some problem the adversary cannot solve, such as compute a certain piece of information. Even if the protocol is quantum, the queries are typically classical, such as a choice of subset of players to corrupt. In this paper, we introduce a fundamentally new model of quantum attacks on protocols, where the adversary is allowed to ask several classical queries in quantum superposition. This is a strictly stronger attack than the standard one, and we consider the security of several primitives in this model. We show that a secret-sharing scheme that is secure with threshold t in the standard model is secure against superposition attacks if and only if the threshold is lowered to t/2. This holds for all classical as well as a large class of quantum secret sharing schemes. We then consider zero-knowledge and first show that known protocols are not, in general, secure in our model by designing a superposition attack on the well-known zero-knowledge protocol for graph isomorphism. We then use our secret-sharing result to design zero-knowledge proofs for all of NP in the common reference string model. While our protocol is classical, it is sound against a cheating unbounded quantum prover and computational zero-knowledge even if the verifier is allowed a superposition attack. Finally, we consider multiparty computation and give a characterization of a class of protocols that can be shown secure, though not necessarily with efficient simulation. We show that this class contains non-trivial protocols that cannot be shown secure by running a classical simulator in superposition.

uk: вхід без авторизації

name: Superposition attacks on cryptographic protocols


uk: Комп'ютерні науки

description: Quantum cryptography aims to achieve security from fundamental physical principles, such as the quantum mechanical phenomena of entanglement and Heisenberg's uncertainty principle. In the last few years significant progress has been made in the theoretical understanding of quantum cryptography and its technological feasibility has been demonstrated experimentally. Quantum cryptography is therefore regarded as one of the most promising candidates for a future quantum technology. -- With QCRYPT we initiate a new conference series on Quantum Cryptography. The first conference in this series will be held at ETH Zurich and the second at CQT in Singapore. The aim of this series is to bring together researchers working on all aspects of the subject (both on the theoretical and experimental sides) and to support the building of a research community in Quantum Cryptography.

uk: вхід без авторизації

name: An ultrafast quantum random number generator based on quantum phase fluctuations


Composition in Quantum Cryptography

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Dual universality of hash functions and its applications to classical and quantum cryptography


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Fast coherent-one way quantum key distribution and high-speed encryption


Higher-Dimensional Quantum Cryptography

uk: Комп'ютерні науки

uk: вхід без авторизації


Merkle Puzzles in a Quantum World

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: On-demand Entanglement Distribution Network


Opening of QCRYPT 2011

uk: Комп'ютерні науки

uk: вхід без авторизації


Public Quantum Communication

uk: Комп'ютерні науки

uk: вхід без авторизації


Quantum Computing on Encrypted Data

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Quantum Cryptography with Continuous Variables


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Quantum memories for light: Status and perspectives


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Quantum Memories for Quantum Networks and Device-Independent QKD


Quo vadis, quantum cryptography

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Randomness Extraction and Privacy Amplification with quantum eavesdroppers


Security in the noisy-storage model

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Semi-device-independent security of one-way quantum key distribution (QKD)


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Simplified instantaneous non-local quantum computation with applications to position-based cryptography


uk: Комп'ютерні науки

uk: вхід без авторизації

name: The Garden-Hose Game and Application to Position-Based Quantum Cryptography


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Universal composable security of quantum message authentication with key recycling

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Wavelength Division Multiplexing Quantum Key Distribution (WDM-QKD) with high throughput key distillation engine


uk: Математика, природничі науки

description: Following a discussion of various forms of set-theoretical foundations of category theory and the controversial question of whether category theory does or can provide an autonomous foundation of mathematics, this lecture concentrates on the question whether there is a foundation for “unlimited” or “naïve” category theory. I proposed four criteria for such some years ago. This lecture describes how much had previously been accomplished on one approach to meeting those criteria, then takes care of one important obstacle that had been met in that approach, and finally explains what remains to be done if one is to have a fully satisfactory solution.

uk: вхід без авторизації

name: Foundations of Unlimited Category Theory


uk: Математика, природничі науки

description: Georg Cantor established the modern theory of sets with his theory of transfinite cardinal and ordinal numbers, which began with his proof that the set of real numbers has greater cardinality than the set of natural numbers; Cantor’s Continuum Hypothesis (CH) states that there is no intermediate cardinal number. The call to establish CH was the first in the famous list of twenty-three challenging mathematical problems that Hilbert posed at the International Congress of Mathematicians in 1900. Yet, a century later, it did not appear on the list of the seven Millennium Prize Problems worth a million dollars each, despite the fact that no solution to it has been found in the mean time. In this lecture I will discuss the evidence for my view (contrary to Gödel above all) that CH is not a definite mathematical problem, despite the fact that it is formulated in terms of concepts that have become an established part of mathematics.

uk: вхід без авторизації

name: Is the Continuum Hypothesis a definite mathematical problem?


Paul Bernays Lectures 2012 - Opening

uk: Математика, природничі науки

description: The Paul Bernays Lectures are a new, annual and three-part honorary lecture series about the philosophy of the exact sciences. The series will alternate between the philosophy of logic or mathematics and the philosophy of physics. This lecture series is established in honor of the eminent logician, mathematician and philosopher of logic and mathematics Paul Bernays who was engaged in teaching and research at the ETH from 1933 to 1959. Within the framework of the Paul Bernays lectures outstanding philosophers of logic, mathematics or physics will be invited to speak about their pioneering research. The first lecture will present the research topics for a wider audience, the second lecture will address the research community, and a final seminar will offer to the members of the research community the opportunity to discuss with the invited speaker selected research topics and ideas.

uk: вхід без авторизації


uk: Математика, природничі науки

description: Paul Bernays was brought from Zurich to Göttingen in 1917 by David Hilbert - the leading mathematician of the time - to assist him in developing his consistency program for the foundations of mathematics. The major exposition of that work appeared in the 1930s in the two volume opus by Hilbert and Bernays, Grundlagen der Mathematik, whose preparation was due entirely to Bernays. In the meantime, Kurt Gödel, a precocious doctorate in Vienna, had discovered his remarkable incompleteness theorems which threatened to undermine Hilbert’s program. Though Hilbert refused to accept that, Bernays undertook to absorb the significance of those theorems through correspondence with Gödel. This led to a lifelong deep personal and intellectual relationship between the two of them whose high points will be traced in the lecture.

uk: вхід без авторизації

name: Bernays, Gödel and Hilbert's consistency program


The meter stick of life

uk: Математика, природничі науки

description: It is not known how living things measure their lengths. They clearly do so, for organisms have characteristic sizes and shapes that are the same down to very small details. But it is a conundum nonetheless because the experimental means at our disposal are not very good at addressing this question. Elementary mass action in chemistry is very good for making clocks, but not so good at making lengths, especially ones that can be tuned and scaled proportionately as an organism grows. In this talk I shall discuss the various options available for dealing with this problem, including Turing reaction-diffusion, none of which is completely satisfactory. One's inability to write down equations that describe how cells do this highly quantitative thing is not an unimportant detail of interest only to physicists but unambiguous evidence that at least one important idea is missing.

uk: вхід без авторизації


Bond Current Antiferromagnetism

uk: Математика, природничі науки

description: In this talk I will review the growing body of evidence that a previously unknown order parameter, bond antiferromagnetism, is present in cuprate superconductors in a glassy form and is responsibile for much of their perplexing behavior, including particularly their pseudogap, doping asymmetry, weak spin polarization and violenty varying superfluid density. I shall argue that bond-current order competes with d-wave superconductivity in the cuprates the same way structural phase transitions compete with s-wave superconductivity in conventional metals, the ordered bond antiferromagnet being essentially a crystal of d-wave Cooper pairs. Its relevance to the cuprates is thus mainly as an impediment to achieving higher superconducting transition temperatures. However, it has wider relevance to engineering through oxide resistive memory, a vastly more important phenomenon presently of great interest to electronics manufacturers on account of its potential to replace flash memory.

uk: вхід без авторизації


A different universe

uk: Математика, природничі науки

description: It sometimes seems obvious that the universe should be ruled by law-relationships among measured quantities that are always accurately true -but it actually isn't. It's a miracule that only look obvious because of one's cultural and religious prejudices, specificially the idea from Greek stoic philosophy that Nature, Logic and God should all be the same thing. The power of this idea makes it notoriously difficult for us to ask where law might come from. But it turns out that many of the most useful laws -rigidity of solids, for example, the electrical properties of metals or the rules of heat- definitely do come from somewhere. They are organizational, and they emerge from chaos as the system size grows larger the way political consensus might, or the way a Monet painting does as one steps away. The growing body of experimental evidence accumulated in the last 60 years has demonstrated explicitly that many engineering laws fail when the system size gets small. But there is also accumulating evidence at the level of big science that ALL physical laws known to science may be in this category, including those of Newton (which emerge from quantum mechanics) and those of the empty vacuum of space-time. This observation has the disturbing implication that entire idea of fundamental law, and the search for the theory of everything based on it, may be ideological, and thus not science at all.

uk: вхід без авторизації


uk: Математика, природничі науки

description: Die Paul Bernays Lectures alternieren zwischen den Gebieten der Philosophie der Logik oder der Mathematik und der Philosophie der Physik. Mit ihnen wird der eminente Logiker, Mathematiker und Philosoph der Logik und Mathematik, Paul Bernays, der von 1933 bis 1959 an der ETH Zürich lehrte und forschte, geehrt. Im Rahmen der Paul Bernays Lectures präsentieren herausragende geladene Referenten ihre wegweisende Forschung. Der erste Vortrag stellt die Forschungsthemen für eine breitere Öffentlichkeit dar, der zweite Vortrag wendet sich an die Forschungsgemeinschaft, und ein abschliessendes Seminar bietet Mitgliedern der Forschungsgemeinschaft die Gelegenheit, ausgewählte Forschungsthemen und –ideen mit dem Gastreferenten zu diskutieren.

uk: вхід без авторизації

name: Foundations of Mathematics: Their past, present and future III: Univalent Foundations


uk: Математика, природничі науки

uk: вхід без авторизації

name: Foundations of Mathematics: Their past, present and future II: The story of set theory (so far)


uk: Математика, природничі науки

uk: вхід без авторизації

name: Foundations of Mathematics: Their past, present and future I: To the history of the conception


uk: Математика, природничі науки

uk: вхід без авторизації

name: Counting And Controlling Photons Non-Destructively


uk: Математика, природничі науки

uk: вхід без авторизації

name: Celebrating The International Year Of Light: How The Laser Has Revolutionized Physics Over The Last Fifty Years


uk: Математика, природничі науки

uk: вхід без авторизації

name: Controlling Photons In A Box And Raising Schrödinger Cats Of Light: When Thought Experiments Become Real


uk: Математика, природничі науки

description: The modern mathematical story of infinity began in the period 1879-84 with a series of papers by Cantor that defined the fundamental framework of the subject. Within 40 years the key ZFC axioms for Set Theory were in place and the stage was set for the detailed development of transfinite mathematics, or so it seemed. However, in a completely unexpected development, Cohen showed in 1963 that even the most basic problem of Set Theory, that of Cantor's Continuum Hypothesis, was not solvable on the basis of the ZFC axioms. The 50 years since Cohen's announcement has seen a vast development of Cohen's method and the realization that the occurrence of unsolvable problems is ubiquitous in Set Theory. This arguably challenges the very conception of Cantor on which Set Theory is based. Thus a fundamental dilemma has emerged. On the one hand, the discovery, also over the last 50 years, of a rich hierarchy of strong axioms of infinity seems to confirm that Cantor's conception is fundamentally sound. But on the other hand, the vast development of Cohen's method over this same period seems to also confirm that there can be no preferred extension of the ZFC axioms to a system of axioms that can escape the ramifications of Cohen's method. But this dilemma was itself based on a misconception and recent discoveries suggest there is a resolution.

uk: вхід без авторизації

name: Unsolvable problems, the Continumm Hypothesis, and the nature of infinity


uk: Математика, природничі науки

description: William Hugh Woodin is Professor of Mathematics and Philosophy at Harvard University. His main interests are in mathematical logic, and particularly in axiomatic set theory (program of inner models, theory of determinacy and large cardinals, the continuum hypothesis), as well as in foundations of mathematics and philosophy of mathematics.

uk: вхід без авторизації

name: Beyond the age of independence by forcing


uk: Математика, природничі науки

uk: вхід без авторизації

name: Unsolvable problems in Second Order Number Theory and their solutions


uk: Математика, природничі науки

description: David Gross is Chancellor's Chair Professor of Theoretical Physics and former director of the Kavli Institute for Theoretical Physics at the University of California, Santa Barbara. Questions about renormalization in particle physics, symmetries in physics, and the relation between quantum theory and gravitation belong to his main fields of research. In 2004 he received the Nobel Prize for Physics for his discovery of the asymptotic freedom according to which the closer quarks are to each other, the weaker is the interaction between them. Gross’ discovery of asymptotic freedom was central to the development of quantum chromodynamics.

uk: вхід без авторизації

name: Gauge – Gravity, or Open – Closed String Duality


uk: Математика, природничі науки

uk: вхід без авторизації

name: A Century of Quantum Physics: From Nuclear Physics to String Theory and Beyond


uk: Математика, природничі науки

uk: вхід без авторизації

name: Quantum Field Theory: Past, Present, Future


uk: Математика, природничі науки

uk: вхід без авторизації

name: From integers to reals: A walk in the world of numbers

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)


de: Umweltschutz

uk: Охорона навколишнього середовища

en: Environmental Protection

de: Biologie

uk: Біологія

en: Biology

uk: Математика, природничі науки

de: Raumplanung

uk: Містобудування та територіальне планування

en: Spatial Planning

description: The World Food System Center is a competence center at ETH Zurich that supports multi- and cross-disciplinary approaches to addressing the challenges confronting the world food system. We do this through research, education, and outreach activities that contribute to sustainable food security.

uk: вхід без авторизації

name: Elisabeth Kalko Memorial Lecture: Lecture 1


uk: Охорона навколишнього середовища

uk: Математика, природничі науки

uk: вхід без авторизації

name: Elisabeth Kalko Memorial Lecture: Lecture 2


LHC Experiments and their Properties

de: Physik, Astronomie

fi: fysiikka, tähtitiede

uk: Фізика, Астрономія

en: Physics, Astronomy

fr: Physique, Astronomie

da: Fysik, Astronomi

es: Física, Astronomía

nl: Natuurkunde, Astronomie

uk: Математика, природничі науки

description: 1 collider experiments (the onion structure) - 2 requirements of the LHC - 3 the four LHC experiments - 4 why four, the differences - 5 online selection and computing needs - 6 flow of data analysis, data formats - 7 the analysis process - 8 unpredictability, iterations - 9 an example of detector understanding in early LHC data - 10 some early results

uk: вхід без авторизації


de: Architektur, Innenarchitektur

uk: Архітектура, дизайн інтер'єру

en: Architecture, Interior Architecture

description: «On Architecture» bietet gegenwärtige Sichtweisen auf die Anforderungen der heutigen architektonischen Praxis. Die Vortragsreihe stellt konkrete Positionen aus Asien, Afrika und Amerika wie auch spezifische Standpunkte an den Rändern Europas vor. Die Vorträge befassen sich mit Themen wie Ausbildung, Material und Bautätigkeit, Infrastruktur, Ressourcen und Politik. Die eingeladenen Architekten, Architektinnen und kreativen Denker eröffnen uns einen Blick auf ihre Praxis und Theorie in Architektur und Städtebau, der es uns erlaubt, unsere eigene Haltung zu reflektieren.

uk: вхід без авторизації

name: Masters of the architectural narrative I


uk: Архітектура, дизайн інтер'єру

uk: вхід без авторизації

name: Masters of the architectural narrative II


uk: Архітектура, дизайн інтер'єру

description: Das Architektenduo Astrid Staufer (1963, Lausanne) und Thomas Hasler (1957, Uzwil) ist bekannt für seine soliden Bauprojekte von höchster Qualität. Ihre Arbeit orientiert sich am Lokalen und bezieht so die unmittelbare Umgebung mit ein. Das Duo arbeitet seit 20 Jahren zusammen. Zu ihren bekanntesten Bauten gehören die Kantonsschule in Wil, das Bundesverwaltungsgericht in St. Gallen, das Brandhaus in Zürich-Opfikon sowie diverse Schulen, Verwaltungsbauten, Kinos, Bars und Privathäuser. Staufer/Hasler unterrichteten an der ETH Zürich und an der ETH Lausanne; aktuell haben sie eine Professur an der TU Wien inne. Beide forschen und publizieren regelmässig zu Architektur, Konstruktion und Städtebau.

uk: вхід без авторизації

name: Masters of the architectural narrative III


uk: Архітектура, дизайн інтер'єру

uk: вхід без авторизації

name: Masters of the architectural narrative IV


Particle Physics at LHC - An overview

uk: Фізика, Астрономія

uk: Математика, природничі науки

description: 1 The Standard Model of particle physics (SM) - 2 The LHC physics program - 3 Why do we want it. - 4 What do we want and hope to measure. - 5 Why does it take some time to do this.

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації

name: Patterns in plane drawings: Euler's formula


uk: Охорона навколишнього середовища

uk: Математика, природничі науки

uk: вхід без авторизації

name: Elisabeth Kalko Memorial Lecture: Questions and Discussion


uk: Фізика, Астрономія

uk: Математика, природничі науки

description: 1 L H C - 2 Accelerator elements - 3 What makes the LHC special - 4 LHC commissioning and plans

uk: вхід без авторизації

name: The LHC - Accelerator Aspects (a crash course in accelerators?)


The Value of Materials I

uk: Архітектура, дизайн інтер'єру

description: “What is worth more, a kilogram of stone or a kilogram of gold? The question is doubtless ridiculous. But only to a merchant. The artist would reply: to me all materials are equally precious.” Thus Adolf Loos in his essay “Building Materials”. Frank Lloyd Wright, in one of his lectures, was even more explicit and forthright: “Ladies and gentlemen, do you know what a brick is? It’s trivial and costs 11 cents; it’s common and valueless but possesses a peculiar characteristic. Give me this brick and it will be worth its weight in gold.” How can the worth of a material to the architect be measured? What are the criteria by which architects select the materials for their buildings? What counts more: the costliness of a material or the expenditure represented in its workmanship. How low-end or how high-end should a building material be? Does such a distinction have any significance at all? Whether the point of departure is decided by limited resources or the treasured status of an existing building, each of the five guest speakers in the department’s lecture series have found their distinctive answers to these questions. They all possess the gift of the alchemist and know how to ingeniously and intelligently transmute inconspicuous materials into precious architectural objects. The lecture series examines the topic from different perspectives and provides insights into thinking and the work of Toni Gironès, Philipp Esch, Martin und Elisabeth Boesch, and Wang Shu.

uk: вхід без авторизації


The Value of Materials II

uk: Архітектура, дизайн інтер'єру

uk: вхід без авторизації


uk: Архітектура, дизайн інтер'єру

uk: вхід без авторизації

name: Topographies over time. The experience of archticture


uk: Охорона навколишнього середовища

uk: Математика, природничі науки

uk: вхід без авторизації

name: Elisabeth Kalko Memorial Lecture: Welcome


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Digitale Hochschullehre - Vom Best Practice zum Standard - Resümee der Veranstaltung und Verabschiedung

Technische Informationsbibliothek (TIB)

addressLocality: Hanover

addressRegion: Lower Saxony


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Lernmanagementsysteme an deutschen Hochschulen - derzeitiger Stand, aktuelle Baustellen und zukünftige Trends


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Technologien für Open Science und Open Education


Metadaten, OER

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Digitale Hochschullehre - Vom Best Practice zum Standard - Keynotes


Learning Analytics

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Digitale Hochschullehre - Vom Best Practice zum Standard - Eröffnung und Begrüßung


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Bildungszertifikate und Micro-Assessment durch Open Badges und Blockchain - Projekte und Potentiale in Deutschland und weltweit


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Mehr Chancengerechtigkeit für Studierende mit heterogenen Bildungsvoraussetzungen durch e-teaching am Beispiel von Blended Learning Arrangements?


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Lernszenarien, Toolauswahl als “Didaktischer Assistent/Pragmatische Didaktik”


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Digitale Hochschullehre - Vom Best Practice zum Standard: Keynotes


DDB/edusharing

uk: Комп'ютерні науки

uk: вхід без авторизації


Lernen mit audiovisuellen Medien

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Digitale Effizienz mit künstlicher Intelligenz


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Podiumsdiskussion: Maschinelles Lernen – Was bringt die Zukunft?


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Qualifizierungsmaßnahmen und Forschungsvorhaben des BMBF im Bereich Maschinelles Lernen


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Die Zukunft ist hier, um zu bleiben – Künstliche Intelligenz in der Medizin: Gegenwart und Zukunft


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Intelligente Mobilität durch App, Vernetzung und Machine Learning


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Europeana Research – European Perspective


Mainzed

uk: Комп'ютерні науки

uk: вхід без авторизації


Basic Ideas of Causal Inference

uk: Комп'ютерні науки

description: The inaugural summer school of the joint ETH/MPI Research Network on Learning Systems will feature tutorial lectures and practicals on various topics related to Learning Systems. In particular, researchers from the Max Planck Institute for Intelligent Systems and ETH Zurich will present introductory and advanced topics in areas such as Statistical Machine Learning, Robotics / Control and Computer Vision.

uk: вхід без авторизації

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)


Computer vision overview

uk: Комп'ютерні науки

uk: вхід без авторизації


Gaussian processes: An Introduction

uk: Комп'ютерні науки

uk: вхід без авторизації


High-dimensional data analysis

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Joint 3D reconstruction and class segmentation


Learning and Randomized Optimization

uk: Комп'ютерні науки

uk: вхід без авторизації


Learning Control for Autonomous Robots

uk: Комп'ютерні науки

uk: вхід без авторизації


Learning in Networks

uk: Комп'ютерні науки

uk: вхід без авторизації


Model Validation

uk: Комп'ютерні науки

uk: вхід без авторизації


Observability vs Controllability

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Computing Optical Flow: The "good parts" version


Measuring (in)dependence

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name:
Robot Learning: From Control to Learning
Model-based Control


Small-Scale Mobile Robotics

uk: Комп'ютерні науки

uk: вхід без авторизації


Structured Models in Computer Vision

uk: Комп'ютерні науки

uk: вхід без авторизації


Submodularity in Learning Systems

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Niklaus Wirth was a Professor of Computer Science at ETH Zürich, Switzerland, from 1968 to 1999. His principal areas of contribution were programming languages and methodology, software engineering, and design of personal workstations. He designed the programming languages Algol W, Pascal, Modula-2, and Oberon, was involved in the methodologies of structured programming and stepwise refinement, and designed and built the workstations Lilith and Ceres. He published several text books for courses on programming, algorithms and data structures, and logical design of digital circuits. He has received various prizes and honorary doctorates, including the Turing Award, the IEEE Computer Pioneer, and the Award for outstanding contributions to Computer Science Education.

uk: вхід без авторизації

name: Convergence and divergence in programming language design


uk: Комп'ютерні науки

uk: вхід без авторизації

name: "Abstraction and Reference" for Digital Vellum


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Languages are in the Eye of the Beholder


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Reviving a computer system of 25 years ago


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Stepwise refinement: From common sense to common practice


uk: Комп'ютерні науки

uk: вхід без авторизації

name: The Multicompiler: Software Defenses (Using Compiler Techniques)


The Trouble with Types

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Niklaus Wirth Birthday Symposium: Welcome and Introduction


uk: Комп'ютерні науки

uk: вхід без авторизації

name: When Less is More: Designing Predictable and Robust Systems


uk: Архітектура, дизайн інтер'єру

description: Eine Ausstellung der Professur Laurent Stalder, ETH Zürich in Zusammenarbeit mit Atelier Bow-Wow und dem Institut gta Das von Yoshiharu Tsukamoto und Momoyo Kaijima 1992 in Tokyo gegründete Architekturbüro Atelier Bow-Wow gehört zu den vielseitigsten Büros der Gegenwart. Das Werk der Architekten umfasst über 40 Wohnhäuser, öffentliche Bauten sowie zahlreiche Installationen. Einen wesentlichen Teil ihrer Arbeit bilden zudem städtebauliche Analysen und theoretische Schriften.

uk: вхід без авторизації

name: Vortrag Prof. Peter Märkli zur Ausstellungseröffnung Atelier Bow-Wow


uk: Архітектура, дизайн інтер'єру

uk: вхід без авторизації

name: Vortrag Prof. Dr. Laurent Stalder zur Ausstellungseröffnung Atelier Bow-Wow


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Do we need a new Internet? - Part 2: Motivations for Change


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Do we need a new Internet? - Part 1: Basic Issues


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Next-Generation Secure Public-Key Infrastructures


SCION: Architecture Overview

uk: Комп'ютерні науки

uk: вхід без авторизації

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)


SCION: Control Plane Overview

uk: Комп'ютерні науки

uk: вхід без авторизації


SCION: Data Plane Overview

uk: Комп'ютерні науки

uk: вхід без авторизації


SCION: PKI Overview

uk: Комп'ютерні науки

uk: вхід без авторизації


Cohomology of p-adic Stein spaces

uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації

name: Drinfeld's lemma and multivariate (phi, Gamma)-modules


Integral p-adic Hodge theory (2017)

uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації

name: P-adic étale cohomology and the Drinfeld tower


uk: Комп'ютерні науки

description: This talk is part of the LinuxDays of the student association TheAlternative, the digital arm of [project21]. In the digital age, we want to draw attention to a sustainable interaction with knowledge and culture. We want to encourage usage and comprehension of Free and Open Source Software (also known as FOSS) as an alternative to proprietary software, as well as promote similar open alternatives in other areas. Our LinuxDays are a series of events designed to introduce Linux to beginners and help those who already have it enhance their knowledge. They are created mainly for users of other operating systems who want to discover and/or eventually switch to Linux. We start all the way from the bottom and guide you on your way up to a safer and more comfortable digital lifestyle. In our courses, we cover philosophical aspects as well as technical content. Users already familiar to Linux can jump in at any time to learn more about the wonders of Linux and Free Software. During our Install Events, we will personally assist you in installing Linux on your laptop. Don't worry - of course you can keep your existing OS and additionally use Linux if you want to. After visiting our courses, you will not only have an easy-to-use and efficient operating system on your computer, but also know how to get the best out of it and find more information on your own in case you are enticed with Linux. You don't have to worry about the limits and costs of proprietary software anymore. All students of Zürich may attend our events for free. In consideration of international participants, all courses are held in English.

uk: вхід без авторизації

name: Free and Open Source Scientific Software


Introduction to Linux

uk: Комп'ютерні науки

uk: вхід без авторизації


Free and Open Source Software Course

uk: Комп'ютерні науки

uk: вхід без авторизації


LinuxDays 2015: Practice 1

uk: Комп'ютерні науки

uk: вхід без авторизації


LinuxDays 2015: Practice 2

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Am 12. Januar 2016 feiert Prof. Dr. Urs Hochstrasser seinen 90. Geburtstag. Die ETH, insbesondere das Departement Informatik, veranstaltet ihm zu Ehren ein Symposium, welches im HG Audi Max stattfinden wird. Die Teilnahme ist kostenlos, jedermann ist herzlich eingeladen. Über Jahrzehnte hat Prof. Hochstrasser die Schweizerische Wissenschaftspolitik geprägt. Das Symposium wird verschiedene Abschnitte seines Lebens beleuchten. Urs Hochstrasser hat bei Wolgang Pauli als Physiker an der ETH diplomiert und danach bei Eduard Stiefel promoviert. Er ist wohl der erste ETH Doktorand, der für Berechnungen in seiner Dissertation einen Computer (die Zuse Z4) verwendet hat. Nach dem Doktorat folgte eine Zeit in den USA als wissenschaftlicher Mitarbeiter am National Bureau of Standards und als Professor in Washington und Kansas. Danach war er der erste Wissenschaftsrat an den Schweizerischen Botschaften in Washington D.C., USA, und Ottawa, Kanada. Zurück in der Schweiz wurde er Delegierter des Bundesrates für Fragen der Atomenergie. 1969 ernannte ihn der Bundesrat zum ersten Direktor des neugeschaffenen Bundesamtes für Bildung und Wissenschaft, das er 20 Jahre lang leitete. In dieser Zeit setzte Urs Hochstrasser entscheidende Weichen mit verschiedenen Vorstössen. So war es zum Beispiel sein Verdienst, dass die Gymnasien 1986 erstmals Informatik im Studienplan aufnehmen konnten und 1985 bereitete er die wichtige "Botschaft über Sondermassnahmen zugunsten der Ausbildung und Weiterbildung sowie der Forschung in der Informatik und den Ingenieurwissenschaften" vor, welche dann, vom Bundesrat den Eidgenössischen Räten unterbreitet, von diesen im vollen Umfang akzeptiert und mit den entsprechenden Krediten genehmigt wurde. Als Folge kaufte die Schweiz ihren ersten Supercomputer in Manno.

uk: вхід без авторизації

name: Aufbau und Legitimation einer Schweizer Wissenschaftspolitik


Symposium Hochstrasser: Begrüssung

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Der lange Weg der Informatik in die Schweizer Schulen


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Eine Diskussion der Nutzung wissenschaflicher Erkenntnisse in der Politik am Beispiel des Naturschutzes


Flatterrechnungen und Z4

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Grusswort des Präsidenten der ETH Zürich


Ohne Weiterbildung keine Bildung

uk: Комп'ютерні науки

uk: вхід без авторизації


Schweizer Expats in den USA

uk: Комп'ютерні науки

uk: вхід без авторизації


Supercomputing: Der Weg der Schweiz

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Urs Hochstrasser: Geburtshelfer der Atomenergie in der Schweiz


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Symposium Hochstrasser: Schlusswort und Verabschiedung


uk: Охорона навколишнього середовища

uk: Математика, природничі науки

description: „Unmögliches wird möglich, wenn man den Mut hat, es zu denken.“ In diesem Vortrag wird uns Prof. Gunzinger seinen „Plan B“ für Klima und Energie vorstellen. Das Ziel ist, den nichterneuerbaren Energieverbrauch und den CO2-Ausstoss um den Faktor 10 zu senken. Ist so etwas möglich? Wenn ja, unter welchen Rahmenbedingungen? Was wären die Konsequenzen? Was bedeutet das für uns Ingenieure?

uk: вхід без авторизації

name: „Plan B / Faktor 10“ für Klima und Energie


uk: Охорона навколишнього середовища

uk: Математика, природничі науки

description: Unangenehme Fakten, scharfsinnige physikalische Analysen und düstere Prognosen - fern der von Politik und Wirtschaft aufgetischten Halbwahrheiten.

uk: вхід без авторизації

name: Gedanken zu Klima und Energie: Wie ist es wirklich?


uk: Комп'ютерні науки

description: Guido van Rossum, the inventor of the Python programming language, is presenting the current state of affairs and where he sees Python going.

uk: вхід без авторизації

name: FOSS/FLOSS: EuroPython 2012 - "Not the state of the Python union"


Presentation of the FuturICT Project

uk: Комп'ютерні науки

description: The FuturICT project is a response to the European Commission’s Flagship Call in the area of Information and Communication Technology (ICT) – Future and Emergent Technologies (FET). It is motivated by recognizing that society and ICT form a tightly coupled system that needs to be considered as a whole, rather than as two separate systems. To this end, FuturICT aims to develop a new science of the co-evolution of ICT with society, building on an integration of expertise from the social sciences, complexity science, and ICT. The conference aims to inform the Swiss scientific community about the FuturICT project and its possible impacts on different fields. The organizers welcome scientists of all fields, political decision makers, press representatives and the interested public. The conference will be held in English and Prof. Dirk Helbing, Scientific Coordinator of the FuturICT project, will attend as main speaker.

uk: вхід без авторизації


FuturICT - Questions/Discussion

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Expectations, contributions, risks and opportunities.

uk: вхід без авторизації

name: FuturICT - Participatory computing for our complex world: Conference Series "The Big Six - Spotlight on the EU-Flagship-Initiative"


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Significance and Perspectives of FuturICT for Economics


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Future Cities: Significance and Perspectives of FuturICT


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Significance and Perspectives of FuturICT for the Social Sciences


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Significance and Perspectives of FuturICT for Information and Communication Technologies

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)


FuturICT - Welcome and Goals

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Архітектура, дизайн інтер'єру

uk: вхід без авторизації

name: FCL Architekturdialog: European - South East Asian Architectural Dialogue


uk: Комп'ютерні науки

description: Das Endlosprojekt Berliner Hauptstadtflughafen steht Pate für die Schöpfung der neuen Zeitform Futur III: „In 2017 wird der Hauptstadtflughafen in Teilbetrieb gegangen wären gewesen“. Mit besserer Planung unter intensiverem Einsatz der Möglichkeiten der Digitalisierung wäre das möglicherweise nicht passiert. Das Bundesministerium für Verkehr und digitale Infrastruktur (BMVI) sieht denn auch in Deutschland erheblichen Handlungsbedarf für die Digitalisierung in der Baubranche, um unter anderem Bau(zeiten)verzögerungen zu vermeiden: erst digital, dann real bauen! In diesem Kontext hat das Building Information Modeling (BIM) einen besonders guten Ruf in der Umsetzung einer kooperativen Arbeitsmethodik für den „as built“-Prozess. Die Anwendung kann zur Erstellung eines digitalen Raumbuchs in BIM-kompatiblen Geo-Informations-Systemen und in digitalen Bauanträgen genutzt werden. Auch das Führen virtueller Bautagebücher und Baumängellisten oder automatische Baufortschrittskontrollen werden durch BIM zukünftig möglich sein. Brechen also mithin paradiesische Zeiten für das virtuelle Planen und Bauen in Deutschland an? Die Referenten der Fachtagung beschäftigen sich mit den beiden „BIM-Welten“: open und closed BIM. Worin bestehen die Unterschiede? Welche Funktion hat und wie wird man ein BIM Manager? Was ist eine BIM-BVB? Wie funktioniert die Auswertung von 3D-Laserscandaten bei der Umwandlung von Punktwolken zur Integration in BIM? Und: Wie steht es um Datenschutz und Urheberrecht?

uk: вхід без авторизації

name: Abschlussdiskussion mit allen Teilnehmern

name: Frankfurt University of Applied Sciences

addressLocality: Frankfurt am Main


BIM - Building Information Modeling

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: BIM und Landmanagement: Was kann BIM für das Planungsrecht und die Bodenpolitik leisten?


uk: Комп'ютерні науки

uk: вхід без авторизації

name: BIM Zusammenspiel zwischen CAD und Statik


CAD-Modell und Prüfung

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: BIM und Recht - Technische und rechtliche Herausforderungen: Diskussion


uk: Комп'ютерні науки

uk: вхід без авторизації

name: BIM und Recht - Technische und rechtliche Herausforderungen: Einführung und Begrüßung


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Erfolgreicher Umstieg auf die BIM Technologie – Mehrwerte, rechtliche Herausforderungen, Anregungen (Keynote)


uk: Комп'ютерні науки

uk: вхід без авторизації

name: BIM und Recht - Technische und rechtliche Herausforderungen: Firmenpräsentationen


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Der Mythos BIM: Ein Buch mit sieben Siegeln?


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Technische und rechtliche Aspekte beim Einsatz von BIM in der Bauwirtschaft und Geodäsie


keywords:
Technik und Gesellschaft
Technik und Umwelt
Technologiefolgenabschätzung
Bionik

uk: Комп'ютерні науки

uk: вхід без авторизації

name: Global Talent Summit (GTS) 2018: Closing remarks


How to Fix the Future

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Industry 4.0 & Impact on Organization, People & Society


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Leveraging Crowd Intuition in the Future of Innovation


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Practical Solutions to Closing the Tech Skills Gap


Putting the Fun Into Work with Robots

uk: Комп'ютерні науки

uk: вхід без авторизації


Talk Bohnet

uk: Комп'ютерні науки

uk: вхід без авторизації


Talk Carter

uk: Комп'ютерні науки

uk: вхід без авторизації


Talk Flynn

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Global Talent Summit (GTS) 2018: Talking points II


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Global Talent Summit (GTS) 2018: Talking points I

name: Eidgenössische Technische Hochschule Zürich (ETH Zürich)


uk: Комп'ютерні науки

uk: вхід без авторизації

name: The future of education; Introduction lightning speaker


The Future of Organizations

uk: Комп'ютерні науки

uk: вхід без авторизації


The Future of Work

uk: Комп'ютерні науки

uk: вхід без авторизації


The World in 2050

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Global Talent Summit (GTS) 2018: Welcome Keynote


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Why the Liberal Arts Matter in an Algorithmic World


uk: Комп'ютерні науки

description: Computer Science Colloquium

uk: вхід без авторизації

name: Global Lecture Series: Post-Snowden Cryptography


uk: Комп'ютерні науки

description: Die Digitalisierung ist endgültig in der Mitte der Gesellschaft angekommen. Von Großcomputern bis zur Datencloud hat das digitale Chamäleon schon oft seine Farbe gewechselt – und macht weiter damit: Internet der Dinge, künstliche Intelligenz und Blockchain-Technologie erfordern interdisziplinäre Anstrengungen in der Wissenschaft und Diskussionen auf gesellschaftlicher Ebene. Unsere Tagung mit der Gesellschaft für Informatik und der Initiative D21 verknüpft technische Expertise und politisch-gesellschaftliche Dimension. Beim Akademiegespräch am See waren Blockchain-Technologie ("ausfallsicher, immer da, unhackbar, nicht zu verändern"), Kryptowährungen und Smart Contracts das Thema von Walter Blocher vom Institut für Wirtschaftsrecht der Universität Kassel. Unser Tagungsbericht: https://www.apb-tutzing.de/news/2018/digital-diskutieren.php

uk: вхід без авторизації

name: Blockchain, Kryptowährungen und Smart Contracts

name: Akademie für Politische Bildung (APB) Tutzing


uk: Комп'ютерні науки

description: Die Digitalisierung ist endgültig in der Mitte der Gesellschaft angekommen. Von Großcomputern bis zur Datencloud hat das digitale Chamäleon schon oft seine Farbe gewechselt – und macht weiter damit: Internet der Dinge, künstliche Intelligenz und Blockchain-Technologie erfordern interdisziplinäre Anstrengungen in der Wissenschaft und Diskussionen auf gesellschaftlicher Ebene. Unsere Tagung mit der Gesellschaft für Informatik und der Initiative D21 verknüpft technische Expertise und politisch-gesellschaftliche Dimension. Leibniz-Preisträger Prof. Dr. Daniel Cremers leitet die Computer Vision Group der TU München, einer seiner Schwerpunkte ist die 3D-Rekonstruktion. So können 3D-Fotos mit Tiefenkameras oder 3D-Videos durch mehrere Aufnahmen derselben Handlung entwickelt werden. Die Rekonstruktion erfolgt dann durch Algorithmen. Diese Technologien ermöglichen beispielsweise eine Kameraverfolgung in Echtzeit - schlussendlich könnten Zuschauer einen Film gleichzeitig aus unterschiedlichsten Perspektiven verfolgen und direkt in die Handlung eintauchen (Immersion). Oder wie wäre es, wenn eine kleine Drohne bei der nächsten Skype-Konferenz regelmäßig in zwei Metern Entfernung vor Ihnen herfliegt; oder nach einer Naturkatastrophe unzugängliche oder zerstörte Gebiete abfliegt? Was Künstliche Intelligenz bis zu diesem Zeitpunkt an Datensätzen erfasst und ausgewertet hat - zum Beispiel alleine, um einen Kopf mit all seinen Nuancen, verschiedenen Gesichtsausdrücken und im Licht wechselnden Schattierungen richtig zu erfassen - ist kaum vorstellbar. Unser Tagungsbericht: https://www.apb-tutzing.de/news/2018/digital-diskutieren.php

uk: вхід без авторизації

name: Vergangenheit und Zukunft künstlicher Intelligenz


uk: Комп'ютерні науки

description: Die Digitalisierung ist endgültig in der Mitte der Gesellschaft angekommen. Von Großcomputern bis zur Datencloud hat das digitale Chamäleon schon oft seine Farbe gewechselt – und macht weiter damit: Internet der Dinge, künstliche Intelligenz und Blockchain-Technologie erfordern interdisziplinäre Anstrengungen in der Wissenschaft und Diskussionen auf gesellschaftlicher Ebene. Unsere Tagung mit der Gesellschaft für Informatik und der Initiative D21 verknüpft technische Expertise und politisch-gesellschaftliche Dimension. Über Geschäftsmodelle, gesellschaftliche und politische Folgen von digitalen Plattformen sprach Ansgar Baums, Leiter Regierungsbeziehungen Europa, Nahost, Afrika bei HP. Eindeutig ist: Digitale Plattformen verändern die Struktur der Wirtschaft grundlegend, und je näher am Konsumenten der Markt für ein Produkt ist, desto stärker wird dieser Prozess. Die Politik kann damit nicht viel anfangen ("Kein Politiker hat derzeit Lust auf noch mehr Disruption - ganz im Gegensatz zur IT-Marketingstrategie"), fördere eher eine Plattform-Feindlichkeit und sollte sich daher auf die Gestaltung intelligenter Infrastrukturen sowie eines praktikablen Wettbewerbs- und Verbraucherschutzrechts konzentrieren. Unser Tagungsbericht: https://www.apb-tutzing.de/news/2018/digital-diskutieren.php

uk: вхід без авторизації

name: Plattformen: Geschäftsmodelle, Organisationsstrukturen und gesellschaftliche Folgen


uk: Комп'ютерні науки

description: Die Digitalisierung ist endgültig in der Mitte der Gesellschaft angekommen. Von Großcomputern bis zur Datencloud hat das digitale Chamäleon schon oft seine Farbe gewechselt – und macht weiter damit: Internet der Dinge, künstliche Intelligenz und Blockchain-Technologie erfordern interdisziplinäre Anstrengungen in der Wissenschaft und Diskussionen auf gesellschaftlicher Ebene. Unsere Tagung mit der Gesellschaft für Informatik und der Initiative D21 verknüpft technische Expertise und politisch-gesellschaftliche Dimension. Prof. Dr. Sabine Maasen - Direktorin des Munich Center for Technology in Society der TU München - sprach in ihrer "tour d'horizon durch die Tech-Gesellschaft" über politische und gesellschaftliche Folgen digitaler Technologien. Eine Kernfrage ihrer Ausführungen: Wie bekommt man den "Update-Modus", die ständige Anpassung an die Digitalisierung, in die Politik? Kann man Digitalisierung steuern? Unser Tagungsbericht: https://www.apb-tutzing.de/news/2018/digital-diskutieren.php

uk: вхід без авторизації

name: Gesellschaftspolitische Aspekte intelligenter Systeme


Datenpolitik durch die Jahrzehnte

uk: Комп'ютерні науки

description: Die Digitalisierung ist endgültig in der Mitte der Gesellschaft angekommen. Von Großcomputern bis zur Datencloud hat das digitale Chamäleon schon oft seine Farbe gewechselt – und macht weiter damit: Internet der Dinge, künstliche Intelligenz und Blockchain-Technologie erfordern interdisziplinäre Anstrengungen in der Wissenschaft und Diskussionen auf gesellschaftlicher Ebene. Unsere Tagung mit der Gesellschaft für Informatik und der Initiative D21 verknüpft technische Expertise und politisch-gesellschaftliche Dimension. Prof. Dr. Peter Parycek führte vom Kompetenzzentrum Öffentliche IT (ÖFIT) bzw. der Donau-Universität Krems in die Welt der Datenpolitik ein. Er erläuterte unter anderem die Vor- wie Nachteile datengetriebener Politik und des Open Governments. Wie viel davon sollte sein? Hinter der Antwort darauf steckt die grundsätzliche Frage, wie Politik ausgestaltet sein muss, die eine digitalisierte Gesellschaft voranbringt. "Ein gut geschriebenes Gesetz ist wie ein funktionierender digitaler Code", meint jedenfalls Parycek. Unser Tagungsbericht: https://www.apb-tutzing.de/news/2018/digital-diskutieren.php

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Die Digitalisierung ist endgültig in der Mitte der Gesellschaft angekommen. Von Großcomputern bis zur Datencloud hat das digitale Chamäleon schon oft seine Farbe gewechselt – und macht weiter damit: Internet der Dinge, künstliche Intelligenz und Blockchain-Technologie erfordern interdisziplinäre Anstrengungen in der Wissenschaft und Diskussionen auf gesellschaftlicher Ebene. Unsere Tagung mit der Gesellschaft für Informatik und der Initiative D21 verknüpft technische Expertise und politisch-gesellschaftliche Dimension. Kann man Digitalisierung steuern? Darüber diskutierten Unternehmensgründerin Catharina van Delden (innosabi), Wirtschaftsjournalist Götz Hamann (bei der ZEIT verantwortlich für Print-Online-Projekte) und Lisa Herzog, Professorin für Politische Theorie an der Hochschule für Politik München. Catharina van Delden beobachtet, dass sich die Wertschöpfung von Unternehmen grundlegend ändert, in Netzwerken und über Plattformen entsteht: "Ich warte als Startup-Gründerin nicht darauf, dass die Politik mir die Rahmenbedingungen schafft." (Junge und flexible) Angestellte stimmen eben mit den Füßen ab und gehen, wenn's nicht passt. Doch was ist mit all den anderen? Götz Hamann bemerkt, dass sich der Staat aus der Steuerung von Digitalisierungsprozessen zunächst zurückzieht - und das, obwohl routinemäßige Arbeitsprozesse in Produktion und Verwaltung vermehrt Ansehen und Bezahlung verlieren sowie durch Maschinen/künstliche Intelligenz bedroht sind. Das kann ein immenses sozialpolitisches Problem werden. Daher fragt auch Lisa Herzog, ob die Politik nicht deutlich aktiver Innovation fördern sowie den "Machtkampf" mit der Wirtschaft um Wettbewerbsbedingungen und Mitarbeiterfürsorge offensiver angehen sollte: "Schaden abhalten ist das Eine, eine Entwicklung positiv beeinflussen ist das Andere."

uk: вхід без авторизації

name: Digitalisierung: Steuern, was nicht zu steuern ist


de: Chemie

fi: kemia

uk: Хімія

en: Chemistry

fr: Chimie

da: Kemi

es: Química

nl: Scheikunde

uk: Математика, природничі науки

description: Pd(II)-Catalyzed Processes: Enyne Cyclization

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 10 - 06.05.14

Ruhr-Universität Bochum (RUB)

addressLocality: Bochum

addressRegion: North Rhine-Westphalia


uk: Математика, природничі науки

description: Pd(II)-Catalyzed Processes: Wacker Oxidation

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 11 - 07.05.14


uk: Математика, природничі науки

description: Pd(II)-Catalyzed Processes with Dienes

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 12 - 13.05.14


uk: Математика, природничі науки

description: Pd-Catalyzed CH-Activation

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 13 - 14.05.14


uk: Математика, природничі науки

description: Gold-Catalyzed Activation of Alkynes

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 14 - 20.05.14


uk: Математика, природничі науки

description: Hashmi Phenol Synthesis, Gold-Catalyzed Friedel-Crafts Type Reactions

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 15 - 21.05.14


uk: Математика, природничі науки

description: Enantioselective Oxidation of Olefins: Jabobsen-Katsuki Epoxidation, Sharpless Asymmetric Dihydroxylation

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 16 - 23.05.14


uk: Математика, природничі науки

description: Rhodium Catalysis: Hydroacylation, Carbene CH Insertion

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 17 - 27.05.14


uk: Математика, природничі науки

description: Rhodium and Ruthenium Catalysis: Enantioselective Hydrogenation, Takasago Process

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 18 - 28.05.14


uk: Математика, природничі науки

description: Ruthenium Catalysis: Murai Reaction, Grubb's Catalyst and Olefine Metathesis

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 19 - 03.06.14


uk: Математика, природничі науки

description: Transition Metal Catalysis or Organocatalysis? Importance of blank tests.

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 1 - 08.04.14


uk: Математика, природничі науки

description: Enyne Metathesis, Alkyne Metathesis

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 20 - 04.06.14


uk: Математика, природничі науки

description: Cobalt Catalysis

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 21 - 17.06.14


uk: Математика, природничі науки

description: Nickel Catalysis

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 22 - 18.06.14


uk: Математика, природничі науки

description: Modern Dehydrogenation Reactions

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 23 - 24.06.14


uk: Математика, природничі науки

description: Borylation at Hydrocarbons

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 24- 25.06.14


uk: Математика, природничі науки

description: Chiral Lewis Acids

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 25 - 01.07.14


uk: Математика, природничі науки

description: Lanthanoids in Catalysis

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 26 - 09.07.14


uk: Математика, природничі науки

description: Iron and Copper Catalysis

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 27 - 15.07.14


uk: Математика, природничі науки

description: Basics of Transition Metal Catalysis

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 2 - 09.04.14


uk: Математика, природничі науки

description: Key Steps in Catalytic Cycles - Heck Reaction

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 3 - 15.04.14


uk: Математика, природничі науки

description: Heck Reaction - Variants and Applications

uk: вхід без авторизації

name: Lecture Catalytic Organometallics 4 - 16.04.14