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

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

name: 09A.3 vertikaler Wurf (senkrechter Wurf), inhomogene lineare Differentialgleichung


Jörn Loviscach

type: Person

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

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

Loviscach, Jörn

type: Organization

cs: Video

de: Video

fi: Video

uk: Відео

en: Video

fr: Vidéo

da: Video

nl: Video

es: Video


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

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

name: 09A.5 Lotka-Volterra, Räuber-Beute-Modell, Differentialgleichungssystem


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

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

name: 09A.6 Differentialgleichung mit Randbedingungen; quantenmechanisches Teilchen im Potentialtopf


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

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

name: 10A.1 Differentialgleichung mit trennbaren Variablen, Beispiel


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

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

name: 10A.2 logistische Differentialgleichung, Differentialgleichung mit trennbaren Variablen


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

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

name: 11A.1 Lotka-Volterra, Differentialgleichung numerisch lösen, Räuber-Beute


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

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

name: 11A.2 Stabilität von Differentialgleichungslösern, A-Stabilität, explizites Euler-Verfahren


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

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

name: 12A.1 homogene Differentialgleichung vierter Ordnung


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

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

name: 12A.2 Differentialgleichung höherer Ordnung in DGL-System erster Ordnung umwandeln


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

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

name: 13A.1 lineare Differentialgleichung als DGL-System mit Eigenwerten und Eigenvektoren lösen


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

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

name: 13A.2 Rotationsmatrix in 3D per Differentialgleichungssystem, Exponentialfunktion von Matrizen


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

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

name: 14A.1 kubische Wurzel mit Schmiegeparabel nähern, Taylor-Polynom


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

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

name: 14A.2 nichtlineare Gleichung mit Schmiegeparabel in quadr. Gleichung umwandeln, Taylor


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

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

name: 14A.3 Divergenz der harmonischen Reihe mit Integral zeigen


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

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

name: 15A.1 Potenzreihe für Arcustangens; Konvergenzradius


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

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

name: 16A.1 Jede (übliche) periodische Funktion lässt sich als Fourier-Reihe schreiben; Delta-Funktion


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

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

name: 16A.2 Vektorraum von Funktionen, Norm, Skalarprodukt, Vorbereitung Fourier-Reihe


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

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

name: 16A.3 Fourier-Reihe als Zerlegung von Vektoren; Orthonormalbasis, Skalarprodukt


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

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

name: 17A.1 Fourier-Reihe einer Rechteckschwingung


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

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

name: 17A.2 Formel für pi aus Fourier-Reihe einer Rechteckschwingung


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

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

name: 17A.3 Fourier-Reihe Dreiecksschwingung; noch eine Formel für pi


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

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

name: 17A.4 Fourier-Reihe Sägezahn mittels Rechteck


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

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

name: 18A.1 Laplace-Transformation von t mal y(t)


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

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

name: 19A.1 Differentialgleichung per Laplace-Transformation lösen


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

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

name: 19A.2 noch eine Differentialgleichung per Laplace-Transformation lösen


20A.1 Funktionsplot in 3D mit Google

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

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


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

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

name: 20A.2 Eierkartonfläche sin(x)sin(y) in 3D zeichnen


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

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

name: 20A.3 Gleichung des idealen Gases plotten, 3D, Höhenlinien, Kennlinienfeld


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

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

name: 20A.4 Allgemeine Potenzfunktion x^y in 3D plotten; Stetigkeit


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

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

name: 21A.1 Beispiel Höhenlinien, Gradient, partielle Ableitung


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

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

name: 21A.2 Beispiel 2 Höhenlinien, Gradient, partielle Ableitung


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

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

name: 21A.3 totales Differential, Tangentialebene, ideales Gasgesetz


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

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

name: 22A.1 Fehlerfortpflanzung, Größtfehler, Funktion zweier Veränderlicher


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

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

name: 22A.2 Fehlerfortfplanzung, Standardabweichung, Funktion zweier Veränderlicher


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

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

name: 22A.3 lokale Maxima, Minima einer Funktion zweier Veränderlicher; Hesse-Matrix


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

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

name: 22A.4 nochmal lokale Maxima, Minima einer Funktion zweier Veränderlicher; Hesse-Matrix


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

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

name: 22A.5 Kriterium für positive Eigenwerte der 2x2-Hesse-Matrix


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

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

name: 22A.6 Globales Maximum einer Funktion von zwei VerÄnderlichen; Werte am Rand


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

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

name: 24A.1 Beispiel Doppelintegral, Volumen zwischen Funktionsfläche und Dreieck


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

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

name: 24A.2 Volumen unter Paraboloid, Doppelintegral in Polarkoordinaten


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

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

name: 24A.3 Fläche unter Gauß-Glocke; Normalverteilung; Doppelintegral in Polarkoordinaten


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

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

name: 05.1.4 Determinante, Teil 4, Entwickeln, Sarrus


05.2 Spatprodukt

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

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


05.3 Vektorprodukt rechnerisch

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

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


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

@language: en

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

name: Generic multimedia indexing and retrieval approaches

Technische Informationsbibliothek (TIB)

addressCountry: DE

addressLocality: Hanover

addressRegion: Lower Saxony


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

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

name: Beyond text: New roles for libraries in the 21st century


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

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

name: Standards issues related to moving off the page


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

description: Europeana and The European Library have been working for several years to create an interoperable resource of library, museum, archive and audio visual material. This has now reached a critical mass and we have started the process of distribution of this standardized data. This means placing the content in the path of the user, via API's or creating channels such as the proposed Europeana Research. The talk will summarize activity to date and look at the mountain we still need to climb but also ask for feedback on how useful a web resource dedicated to the researcher might be.

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

name: Europeana: Creating a digital resource for researchers


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

description: The talk will present the importance of non-textual information for scientific publishers. First we will give an overview of what are the perspectives of scientific publishers on research data and how they can add value to scientific publications. We will also show the industries activities in this arena over the last few years. Next we propose measures how publishers can further contribute and welcome a discussion with the conference attendees. In the second half of our talk we will show specific examples how Thieme is incorporating non-textual information into medical and chemical publications.

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

name: Non-textual information: Contributions by scientific publishers


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

description: In contrast to text documents, research data, with its graphic visualizations, places different demands on indexing, searchability and presentation in the information retrieval process. The aim of the VisInfo project is the development and prototypical implementation of innovative approaches for interactive, graphical access to research data, to present it in the information retrieval process and make it searchable in the best way possible. In the project, we have studied and developed further data analysis processes as well as visual search systems, with their prototypical implementation being evaluated for research data from earth and environmental sciences. In this talk we will present the general challenges of a visual search approach in research data and the VisInfo prototype as outcome of the project.

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

name: VisInfo - a visual search system for scientific research data


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

description: Video and multimedia data have become the predominant information on the World Wide Web. To cope with the ever growing amount of multimedia data on the web search engines have to open up the media content for search and retrieval. Automated multimedia analysis technologies such as, e.g. automated speech recognition, video OCR, or visual concept detection help to open up large scale multimedia repositories although the achieved analysis results often are error prone and unreliable. Semantic analysis considers the multiple (mostly text-based) metadata streams from automated analysis and constructs a semantic context to enable understanding the media content. Thus, semantic analysis enables the improvement of metadata reliability by evaluating the plausibility of the semantic assumptions. In addition, semantically annotated multimedia data enables semantic and exploratory search to open up new ways of accessing multimedia repositories.

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

name: Context-driven semantic multimedia search


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

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

name: Insight in six dimensions: An approach to visualizing data using Layerscape


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

description: Digital preservation processes differ in detail depending on a variety of factors. Organizational matters such as retention periods or an overarching archiving mandate influence policies, which in return form the basis for preservation action. On a technical level preservation processes are directly influenced by the complexity of the material but also by the availability of tools to analyze and treat the material. All preservation action must furthermore be in-line with the intended usage of the material. The Goportis institutions preserve their digital holdings in a cooperatively operated digital preservation system. While the digital preservation system may be considered the technical framework of a preservation workflow for a specific collection, this workflow must be extended by format-specific tools and supported by a variety of institutional decisions and actions. The presentation will highlight challenges, strategies and approaches of a digital preservation workflow for non-textual materials using the example of AV-materials at TIB. It will show how requirements of a memory institution influence preservation decision and touch on state-of the art practises in digital preservation of AV materials.

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

name: Digital preservation of AV materials in a library context: Challenges, Strategies, Approaches


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

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

name: Digital preservation of information models for the build environment - requirements, challenges and approaches in the FP7 DuraArk project


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

description: The Jisc Managing Research Data programme aims to improve the management of research data in a variety of UK universities by developing technical infrastructure, raising awareness and developing skills. As a member of the programme team, I will describe some of the current drivers for the effective management and preservation of research data in UK universities, and the response provided by the JISC Managing Research Data programme. The presentation will touch on the structure and direction of the programme, lessons learned from its approach, and our attempt to quantify the benefits of this work in a structured way.

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

name: The JISC managing research data programme: Institutional approaches to research data preservation from the UK


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

description: The French CNRS (National Center for Scientific Research) is involved in almost all scientific fields, including Humanities and Social Sciences (HSS). Within the HSS, transition to digital humanities has been on the CNRS agenda for more than 10 years, leading in particular the creation of so-called very large-scale research infrastructures (TGIR). The presentation will provide a closer look at two of these TGIRs, TGE Adonis and CORPUS-IR, at related developments and the ways in which non-textual information is handled in these facilities. The goal of Adonis is to provide three types of services to the HSS communities: preservation, processing and dissemination of digital objects produced by the research labs. Adonis is working closely with CINES, center for long-term preservation in French higher education and research, and has a role of coordination of the Centers of digital resources, which have been created by CNRS since 2005. A special focus will be on the ISIDORE platform, a unique access point to various kinds of resources, using state-of-the-art data linking and enrichment techniques. It will finally be mentioned how non-textual information is also finding its way into the HAL central open archive run by CNRS.

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

name: The CNRS engagement in research infrastructures for digital humanities: Archiving and dissemination


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

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

name: Conference Opening and Welcome Addresses


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

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

name: Eefke Smit, STM Association at the DataCite summer meeting 2012: Data and Publications: and how they belong together


keywords:
Semantic Web
WWW
Web
Internet
Rechner
Kommunikation
Document
Data
Semantik
Information
Problemfelder
Information Retrieval
Suchmaschine

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

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

name: Einführung (Teil 2) / Vom WWW zum Semantic Web

Hasso Plattner Institut (HPI)

addressLocality: Potsdam

addressRegion: Brandenburg


Einführung (Teil 1)

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

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


XML und XML-Schema (Teil 1)

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

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


XML und XML-Schema (Teil 2)

keywords:
Semantic Web
URI
XML
XML Schema
DTD
Markup
Language
GML
SGML
Vokabular
Metasprache
sprache
schema
definition
syntax
html

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

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


Resource Description Framework - RDF

keywords:
Semantic Web
XML
RDF
RDFS
collection
Instanz
Entität
Statement
Subject
Predicate
Property
Object
SPO
Tripel
Triple
Turtle
Syntax
Serialization
Serialisierung
N3
Berners-Lee
TBL
Relation
Beziehung
Reifikation
Reification
Vergegenständlichung
res
facere
trust
beurteilung
container
liste
first
last
blank node
leerer knoten
datenbank
uri

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

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


RDFS, RDFa, SPARQL und Triple Stores

keywords:
RDF
Semantic Web,
urtle, SPARQL
Schema,
RDFS
Klassen, Relation
SQL
Protokoll
HTML
Attribute
GRDDL
Microformat
Ontologie
sprache
seman

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

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


keywords:
ontologie
philosophie informatik
antike
mittelalter
platon
sokrates
aristoteles
ockham
kant
scholastik
epistemologie
definition
ontologien
aufbau
konstruktion
klassen
rollen
beziehungen
constraints
regeln
logik
aussagenlogik
prädikatenlogik
beschreibungslogiken
description logics
taxonomie
borges
wordnet
thesaurus
linne

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

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

name: Ontologie(n) in Philosophie und Informatik


Aussagenlogik und Prädikatenlogik

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

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


RDF(S) Semantik

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

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


Beschreibungslogiken

keywords:
Beschreibungslogiken
Description Logics
ALC
Logik
OWL
DL
Semantic Web
Wissensrepräsentation
Knowledge
Representation
Language
logics
erfüllbarkeit
satisfiability
abgeschlossen
completeness
frame
aussagenlogik
fol
prädikatenlogik
semantik
interkretation
modell

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

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


OWL und OWL-Semantik

keywords:
Semantik
Wissen
Wissensrepräsentation
Logik
Beschreibungslogik
Ontologie
Onstanz
Klasse
Rolle
Property
Semantic Web
OWL
RDF
SHOIN
SHOIN(D)
SHIQ
OWL DL

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

description: Aufbauend auf die Beschreibungslogik SHOIN(D) wird die Ontologiebeschreibungssprache OWL DL eingeführt und deren Semantik erläutert.

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


OWL 2

keywords:
owl
owl 2
shoin(d)
shroiq(d)
beschreibungslogiken
semantik
ontologie
knowledge representation
wissensrepräsentation
abstract syntax
manchester syntax
functional syntax
w3c
standard

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

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


SWRL/RIF

keywords: rules regeln antecedent consequent implikation fol prädikatenlogik beschreibungslogiken shoin(d) dl-safe datalog klausel hornklausel

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

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


Ontology Engineering

keywords: ontologien entwurf ontology learning design mapping merging alignment engineering ontology knowledge representation

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

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


Göttinger Tunnelsimulationsanlage

name: Deutsches Zentrum für Luft- und Raumfahrt (DLR)

keywords: Tunnel Zug Göttingen Geschwindigkeit Simulation

description: Das Katapult der Göttinger Tunnelsimulationsanlage bringt Züge auf Hochgeschwindigkeit - es beschleunigt die Zugmodelle auf 400 Kilometer pro Stunde. In der Anlage kann so zum Beispiel die Einfahrt von Hochgeschwindigkeitszügen in Tunnel simuliert werden.

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

addressLocality: Cologne

addressRegion: North Rhine-Westphalia


keywords:
anti-collision system
RCAS
train
transport

description: DLR researchers successfully demonstrate their work on a test track near Aachen. The novel RCAS anti-collision system uses direct train-to-train communication to alert the train operators in time to prevent a possible collision.

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

name: RCAS: An anti-collision system with direct train-to-train communication


keywords: RCAS Zug Kollision

description: Das neuartige Anti-Kollisions-System RCAS mit einer direkten Zug-zu-Zug-Kommunikation warnt den Zugfahrer rechtzeitig vor möglichen Zusammenstößen auf der Schiene.

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

name: RCAS: Anti-Kollisions-System mit einer direkten Zug-zu-Zug-Kommunikation


keywords:
aeronautics
quantum key
aircfraft
Dornier 228

description: For the first time, researchers have managed to transmit a quantum key from a fast-moving object. The quantum data was sent from an aircraft to a ground station via a laser beam. Key exchange based on quantum mechanics is considered to be absolutely secure against eavesdropping.

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

name: Quantum key transmission experiment in Oberpfaffenhofen


Interview mit Alexander Gerst

keywords:
Alexander Gerst
Astronaut
ISS
ESA

description: Am 22. September 2013, dem Tag der Luft- und Raumfahrt des Deutschen Zentrums für Luft und Raumfahrt (DLR) und der ESA, werden weitere Details zur ISS-Mission von Alexander Gerst bekannt gegeben. Doch wer ist der Mensch, der hinter dem Astronauten Alexander Gerst steckt? Was hat den gebürtigen Künzelsauer dazu veranlasst, schon als Kind davon zu träumen, als Astronaut die Erde und das All zu erkunden? Im ersten von insgesamt drei DLR-Webcasts lässt Alexander Gerst uns an seiner persönlichen Geschichte teilhaben - vom ersten Besuch mit seinem Großvater beim DLR in Lampoldshausen bis hin zu seinen Aufgaben und der Verantwortung als Wissenschaftler und Astronaut.

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


First Robot Based Flight Simulator

keywords:
Pilotentraining
Flugsimulator
DLR
Grenzebach Maschienenbau

description: Pilotentraining im weltweit ersten roboterbasierten Flugsimulator, einer Entwicklung des DLR in Kooperation mit Grenzebach Maschinenbau und KUKA.

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


keywords:
congestion detector
traffic
transport
taxi

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

description: The Traffic Tower at Berlin Adlershof uses taxis as a congestion detector; with this data, DLR researchers are analysing the situation on the streets.

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

name: Floatingcar: Taxis as congestion detectors


Floatingcar

keywords: Stau Taxi Verkehr

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

description: Der Traffic-Tower Berlin-Adlershof setzt Taxen als Staumelder ein: Mit deren Daten können die DLR-Wissenschaftler die Situation auf den Straßen analysieren.

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


keywords:
range extender
transport
free-piston linear generator
FKLG

description: Flexibility in respect of fuel types, compact dimensions and high efficiency combined with low emissions, these properties characterise the free-piston linear generator (FKLG), the brainchild of engineers at DLR. This animated film (in German) provides an insight into the way this new kind of range extender works.

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

name: As a new kind of range extender, the free-piston linear generator (FKLG) makes electric vehicles more flexible


description: Kraftstoffflexibilität, kompakte Bauweise und hohe Effizienz bei niedrigen Emissionen - diese Eigenschaften zeichnen den Freikolbenlineargenerator (FKLG) der DLR-Ingenieure aus. Der Animationsfilm gibt einen Einblick in die Funktionsweise dieses neuartigen Range-Extenders.

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

name: Als neuartiger Range-Extender macht der Freikolbenlineargenerator (FKLG) Elektromobilität flexibler


FASCar II

keywords: transport car co-pilot help

description: FAScar is a test vehical for a driver and virtual co-pilot. They help each other out on the road.

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


keywords:
Auto
Zukunft
umweltfreundlich
sicher
autonom
Sprit sparen

description: Mit dem Handy das Auto herbeirufen und Sprit sparend auf Kreuzungen zufahren, weil das Auto mit der Ampel kommuniziert. Das Deutsche Zentrum für Luft- und Raumfahrt (DLR) entwickelt Systeme, die das Autofahren der Zukunft noch sicherer und umweltfreundlicher machen. In einer Fahrdemonstration zeigte das DLR-Institut für Verkehrssystemtechnik, wie ein autonom fahrendes Fahrzeug Informationen von Ampeln zur Geschwindigkeitsanpassung nutzen kann.

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

name: Fahrdemonstration mit dem FASCar II: Das Auto der Zukunft kommt auf Knopfdruck


keywords:
Atmosphäre
Falcon 20E

description: Ob Spitzbergen, Grönland, Tropen oder Südspitze Amerikas - der Einsatz für die Wissenschaft hat das Forschungsflugzeug Dassault Falcon 20E schon an die unterschiedlichsten Plätzen der Welt geführt. Seit 35 Jahren fliegt die Falcon für das Deutsche Zentrum für Luft- und Raumfahrt (DLR). In dieser Zeit hat sie zur Klärung vieler Fragen der Atmosphärenforschung beigetragen und sich weltweit etabliert. Trotzdem ist ein Ruhestand noch nicht in Sicht - weitere Missionen sind geplant.

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

name: Forschungsflugzeug Falcon ist seit 35 Jahren beim DLR


Eröffnung Forschungsanlage: envihab

keywords: Forschungsanlage DLR Astronauten

description: In der neuen Forschungsanlage: envihab des Deutschen Zentrums für Luft- und Raumfahrt (DLR) und seinen acht Modulen steht auf 3500 Quadratmetern der Mensch, seine Gesundheit und seine Leistungsfähigkeit im Mittelpunkt. "In dieser Kombination und mit diesen Möglichkeiten ist das :envihab weltweit einzigartig", betont Prof. Rupert Gerzer, Leiter des DLR-Instituts für Luft- und Raumfahrtmedizin. Dabei haben die Wissenschaftler nicht nur die Astronauten im Blick, sondern auch die Menschen auf der Erde. "Was den Astronauten leistungsfähig erhält, hilft auch dem Patienten am Boden - und umgekehrt."

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


keywords:
Plataforma Almería
polar power
renewable energy
enerMENA

description: In 55 videos, researchers from the German Aerospace Center (Deutsches Zentrum für Luft- und Raumfahrt; DLR) facilitate profound knowledge about the fundamentals of CSP (Concentrating Solar Power) project planning, construction, maintenance and optimisation of solar thermal power plants.

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

name: Facilities of the Plataforma Almería of the spanish research center CIEMAT


Compact Test Range

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: Die Compact Test Range des Deutschen Zentrums für Luft- und Raumfahrt (DLR) ist eine der modernsten wissenschaftlichen Antennen-Messanlagen Europas. Sie wird seit Februar 2010 vom Institut für Hochfrequenztechnik und Radarsysteme in Oberpfaffenhofen betrieben. Die Indoor-Anlage ermöglicht Vermessungen mit höchster Genauigkeit. Das DLR testet und entwickelt Antennen u.a. für Weltraumanwendungen, wie etwa zu den Radarsatelliten TerraSAR-X und TanDEM-X.

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


keywords:
crash test
transport
speed

description: The dynamic component testing facility consists of two modular crash-test sleds, each up to two metres long and 1.3 metres in height. They stand on an 11.5-metre long rail track, so that the 'target' test sled can move backwards on impact. In the first test, DLR engineers accelerated a 1.5-metre long sled with a total mass of 1.3 tons to a maximum speed of 64 kilometres per hour. A compressed air cylinder powers the sled, and a hydraulic brake controls the acceleration.

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

name: Crash tests for the car of the future: DLR inaugurates dynamic component testing facility


keywords: Crashtest Prüfstand Auto

description: Die dynamische Komponenten-Prüfanlage umfasst zwei modular aufgebaute, jeweils zwei Meter lange und 1,3 Meter hohe Crashschlitten. Diese stehen auf einer insgesamt elfeinhalb Meter langen Schienenbahn. Somit kann sich der getroffene Schlitten beim Aufprall nach hinten bewegen. Bei einem Versuch beschleunigen die DLR-Ingenieure den ersten Schlitten auf einer Stecke von nur 1,5 Metern bei einer Gesamtmasse von 1,3 Tonnen auf maximal 64 Stundenkilometer. Angetrieben wird der Schlitten mit einem pressluftbetriebenen Zylinder, wobei eine hydraulische Bremse die Beschleunigung regelt.

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

name: Crashtests für das Auto der Zukunft: DLR weiht dynamische Komponenten-Prüfanlage ein


name: Deutsches Zentrum für Luft- und Raumfahrt (DLR),

description: Die Betonröhre auf dem Gelände des Deutschen Zentrums für Luft- und Raumfahrt (DLR) in Trauen mag nur 3,30 Meter breit sein - und dennoch wird sie von Zeit zu Zeit für etwa zehn Sekunden zum Weltraum: Dann testen die Ingenieure des Instituts für Aerodynamik und Strömungstechnik dort ihr neu entwickeltes Hybridraketentriebwerk. Dr. Ognjan Boić und sein Team sitzen dabei hinter den 20 Zentimeter dicken Stahlbetonwänden ihres Kontrollraums, während im Teststand flüssiges Wasserstoffperoxid in einer Brennkammer mit einem festen Brennstoff reagiert und das Raketentriebwerk einen Schub von 240 Kilogramm erzeugt. Die ersten Auswertungen des Projekts AHRES (Advanced Hybrid Rocket Engine Simulation) zeigen: Bereits in den kommenden fünf bis zehn Jahren könnte ein flugfähiges Hybridtriebwerk für eine Rakete gebaut werden und ins All starten.

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

name: Brenntest DLR AHRES: 87,5% T-Stoff, HTPB, Al


keywords: Autos Verkehr Leichtbau

description: 30 Prozent Gewicht wollen DLR-Forscher mit neuartigen Konstruktionen an der Karosserie von Autos einsparen. Im EU-Projekt Superlightcar erarbeiten sie Lösungen zusammen mit 37 Projektpartnern.

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

name: DLR-Jahresrückblick 2008 - August: Das Auto der Zukunft: leichter und sparsamer


keywords: Robotik Mechatronik Mensch Maschine AUTOMATICA

description: Wie kann sichergestellt werden, dass ein Roboter einen Menschen nicht verletzt? Schon der Science Fiction Autor Isaac Asimov stellte sich dieser Frage. Antworten liefern die Forscher des Instituts für Robotik und Mechatronik des Deutschen Zentrums für Luft- und Raumfahrt (DLR). Im DLR-Webcast berichtet der DLR-Wissenschaftler Sami Haddadin von der Entwicklung neuer Testverfahren, welche die Sicherheit bei der Interaktion von Mensch und Maschine erhöhen sollen. Das DLR stellt das Projekt "Sicherheit in der Mensch-Roboter-Interaktion" auf der AUTOMATICA 2008 in München vor.

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

name: Asimovs Gesetz: Sicherheit in der Mensch-Roboter-Interaktion


Mit dem Motorsegler im Himalaya

keywords: 3D-Kamera Annapurna-Gebiet Himalaya Luftaufnahme

description: Wissenschaftler des DLR fliegen erstmals mit einer 3D-Spezialkamera im Annapurna-Gebiet des Himalaya.

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


50 Jahre DLR Lampoldshausen

keywords: Raketentriebwerke Lampoldshausen

description: Der Webcast zeigt die Höhepunkte der 50-jährigen Geschichte des DLR-Standorts Lampoldshausen.

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


Der verlängerte Arm des Chirurgen

keywords: MIROSURGE Operation Patient Chirurgie

description: Minimal invasive Operationsmethoden schonen den Patienten. Der Leichtbauroboter MIRO des Deutschen Zentrums für Luft- und Raumfahrt (DLR) kann in Zukunft den Chirurgen bei endoskopischen Operationen unterstützen. Im DLR-Webcast erläutert Georg Passig vom DLR-Institut für Robotik und Mechatronik die Vorzüge des Projekts MIROSURGE. Das DLR stellt MIROSURGE auf der AUTOMATICA 2008 in München vor.

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


Test von Omegahab in Moskau

keywords: Omegahab Moskau Mini-Ökosystem

description: Das aus Deutschland stammende Mini-Ökosystem Omegahab wurde vor seinem Start an Bord des Forschungssatelliten BION-M1 in den Laboren des Instituts für Biomedizinische Probleme (IBMP) der Russischen Akademie der Wissenschaften in Moskau auf seinen Aufenthalt im All vorbereitet.

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


keywords:
test range
laser

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

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

description: On the 130-metre long test range at DLR Lampoldshausen, laser beams will be precisely analysed under real environmental conditions. This video is part of DLRs annual review from March 2010.

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

name: Optical test range at DLR Lampoldshausen


name: Deutsches Zentrum für Luft- und Raumfahrt (DLR)

keywords:
ILA
Luftfahrt
Cessna Caravan

description: "So wie hier, kommt die Cessna normalerweise nicht vom Band", sagt Volker Dreiling, wissenschaftlicher Leiter der Flugabteilung des Deutschen Zentrums für Luft- und Raumfahrt (DLR) in Oberpfaffenhofen und beschreibt die Cessna 208B Grand Caravan, die auf dem Außengelände auf der ILA zu sehen ist. Im DLR-Webcast beschreibt Dreiling mit seinem Kollegen Steffen Gemsa das kleinste Forschungsflugzeug des DLR.

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

name: "Fliegender Hörsaal" Cessna Caravan auf der ILA 2008


Survey Sampling

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

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

University of California Irvine (UCI)

addressCountry: US

addressLocality: Irvine

addressRegion: California


Probability (1)

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

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


Estimation of Parameters

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

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


Fitting of Probability Distributions

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

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


Hypothesis Testing

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

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


Random Sampling

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

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


Simple Random Sampling

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

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


Final Review

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

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


Probability (2)

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

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


Random Variables

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

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


Joint Distribution (1)

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

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


Expected Values

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

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


Joint Distribution (2)

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

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


Limit Theorems

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

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


Distributions from normal Distribution

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

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


Math for Economists - Lecture 1

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

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


Math for Economists - Lecture 2

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

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


Math for Economists - Lecture 3

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

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


Math for Economists - Lecture 4

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

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


Math for Economists - Lecture 6

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

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


Math for Economists - Lecture 7

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

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


Math for Economists - Lecture 8

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

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


Math for Economists - Lecture 10

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

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


Math for Economists - Lecture 11

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

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


Math for Economists - Lecture 12

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

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


Math for Economists - Lecture 13

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

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


Math for Economists - Lecture 14

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

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


Math for Economists - Lecture 15

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

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


New Algorithms in Information Science

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

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


Conditional Probability

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

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


Math for Economists - Lecture 9

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

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


Math for Economists - Lecture 5

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

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


Basic Physics Lecture 8

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

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

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


Basic Physics Lecture 7

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

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

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


Basic Physics Lecture 9

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

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

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


Basic Physics Lecture 10

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

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

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


Basic Physics Lecture 11

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

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

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


Basic Physics Lecture 12

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

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

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


Basic Physics Lecture 13

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

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

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


Basic Physics Lecture 14

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

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

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


Basic Physics Lecture 15

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

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

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


Basic Physics Lecture 16

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

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

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


Basic Physics Lecture 17

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

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

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


Basic Physics Lecture 18

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

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

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


Basic Physics Lecture 19

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

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

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


Basic Physics Lecture 20

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

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

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


Basic Physics Lecture 21

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

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

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


Basic Physics Lecture 22

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

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

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


Basic Physics Lecture 23

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

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

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


Basic Physics Lecture 24

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

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

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


Basic Physics Lecture 25

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

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

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


Basic Physics Lecture 26

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

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

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


Basic Physics III Lecture 1

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

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

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


Basic Physics III Lecture 2

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

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

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


Basic Physics III Lecture 4

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

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

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


Basic Physics III Lecture 5

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

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

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


Basic Physics III Lecture 6

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

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

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


Basic Physics III Lecture 7

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

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

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


Basic Physics III Lecture 8

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

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

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


Basic Physics III Lecture 9

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

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

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


Basic Physics III Lecture 10

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

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

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


Basic Physics III Lecture 11

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

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

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


Basic Physics III Lecture 12

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

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

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


Basic Physics III Lecture 13

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

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

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


Basic Physics III Lecture 14

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

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

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


Basic Physics III Lecture 15

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

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

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


Basic Physic III Lecture 16

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

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

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


Basic Physics III Lecture 17

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

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

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


Basic Physics III Lecture 18

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

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

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


Basic Physics III Lecture 19

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

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

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


Basic Physics III Lecture 20

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

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

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


Basic Physics III Lecture 21

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

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

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


Basic Physics III Lecture 22

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

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

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


Basic Physics III Lecture 23

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

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

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


Basic Physics III Lecture 24

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

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

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


Basic Physics III Lecture 25

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

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

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


Basic Physics III Lecture 26

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

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

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


keywords: GIS Geographic Resource Analysis Support System

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

description: Video presentation explaining the features and capabilities of this computer-based mapping system.

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

name: GRASS: Geographic Resource Analysis Support System

name: Moving Pictures, US Army Construction Engineering Research Laboratory


Basic Physics III Lecture 27

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

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

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


Basic Physics III Lecture 3

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

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

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


Classical Physics Lecture 8

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

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

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


Classical Physics Lecture 7

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

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

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


Classical Physics Lecture 9

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

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

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


Classical Physics Lecture 10

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

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

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


Classical Physics Lecture 11

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

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

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


Classical Physics Lecture 12

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

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

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


Classical Physics Lecture 13

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

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

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


Classical Physics Lecture 14

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

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

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


Classical Physics Lecture 15

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

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

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


Classical Physics Lecture 16

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

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

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


Classical Physics Lecture 17

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

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

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


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

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

description: A lecture delivered by UCI Professor James Bullock on February 11, 2009. James Bullock, Associate Professor of Physics and Astronomy at UC Irvine, is part of a team of scientists who believe they have discovered the minimum mass for galaxies in the universe -- 10 million times the mass of the sun. This mass could be the smallest known "building block" of the mysterious, invisible substance called dark matter. Stars that form within these building blocks clump together and turn into galaxies. Dark matter governs the growth of structure in the universe. Without it, galaxies like our own Milky Way would not exist. Dark matter's gravity attracts normal matter and causes galaxies to form small galaxies and to merge to create larger galaxies.

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

name: Putting Together the Pieces of the Universe


Classical Physics Lecture 1

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

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

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


Classical Physics Lecture 2

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

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

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


Classical Physics Lecture 3

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

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

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


Classical Physics Lecture 4

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

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

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


Classical Physics Lecture 5

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

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

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


Classical Physics Lecture 6

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

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

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


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

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

name: Introduction to Probability and Statistics 131B Lecture 1


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

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

name: Introduction to Probability and Statistics 131B Lecture 2


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

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

name: Introduction to Probability and Statistics 131B Lecture 3


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

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

name: Introduction to Probability and Statistics 131B Lecture 4


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

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

name: Introduction to Probability and Statistics 131B Lecture 5


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

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

name: Introduction to Probability and Statistics 131B Lecture 6


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

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

name: Introduction to Probability and Statistics 131B Lecture 7


Lattices and quadratic forms in Sage

keywords:
Mathematics
Algebraic geometry
Number theory

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

description: In this talk I give the definition of lattices and quadratic forms. Then I survey what you can do with them in sageMath. Finally, I present the functionality we hope to implement this weekend.

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

name: Banff International Research Station (BIRS) for Mathematical Innovation and Discovery


Arithmetic of surfaces in Sage

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

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


Plone Conference 2022 - Fast tests

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

description: Slow tests suck. They are annoying and slow down you and your team. Hours and hours of engineer time is lost waiting for the CI to finish. I'll go through a number of approaches and principles to help you write fast tests.

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


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

description: Welcome & State of Plone An overview to the current state of Plone software, focusing on the new Plone 6 - the first CMS on the market that combines the advanced features, best-in-class security, and scalability of an enterprise CMS with a modern, easy-to-use and powerful front end, based on the latest state-of-the art web technologies.

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

name: Plone Conference 2022 - Welcome & State of Plone


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

description: For the very first live episode of the Podcast The Plone Newsroom the hosts Philip and Fred leave the safety of their home lairs and chat about what's new in the world of Plone in front of a live audience. Expect moderate levels of audience participation.

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

name: Plone Conference 2022 - The Plone Newsroom - Live


SCION, Quo Vadis?

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

description: Prof. Adrian Perrig from the Network Security Group at ETH Zürich has developed SCiON as the result of a years-long journey that started as academic research at ETH. Prof. Adrian Perrig illustrates recent milestones in the SCiON journey, from its inception to the next generation secure internet. His talk includes topics such as the advancement in green routing research, improved technologies to drive adoption, and recognition with awards for the SCiON team at CoNEXT’21.

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

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

addressCountry: CH

addressLocality: Zurich

addressRegion: Zurich


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

description: In this talk, I will give a positive answer to the following question: given a modular tensor category C, is there a mathematical structure such that its center is C? This question is crucial to the question of how to extend Reshetikhin-Turaev TQFT’s down to points. The idea comes from physics, more precisely, from the boundary-bulk relation of 2d topological orders with a chiral gapless edge. It was long believed that such an edge is described by a chiral conformal field theory. The key is to make this statement mathematically precise.

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

name: Chiral conformal field theories and gapless edges of 2+1D topological orders


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

description: There are three intertwined schools of thought in the world of factorization algebras. First, chronologically, is the theory of Beilinson-Drinfeld in their work on chiral algebras. Next, there is the Lurie, Francis-Ayala approach which is primarily the setting in which David Jordan’s talks are in. Finally, there are factorization algebras in the style of Costello-Gwilliam. Each of these approaches have their own advantages. In this talk, I will focus on the third option. In the topological case, the theory agrees with that of Lurie/Francis-Ayala. The primary advantage of this approach is that it is more intrinsic to the underlying geometry. In complex dimension one, for instance, there is the theory of *holomorphic* factorization algebras. We will see how this notion encodes the operator product expansion (OPE) for chiral CFT, while also providing some geometric examples. We will also see how factorization homology appears in this approach to factorization.

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

name: Factorization algebras in conformal field theory


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

description: Factorization algebras, and factorization homology, began in the work of Beilinson-Drinfeld, as an algebro-geometric/coordinate-free approach to vertex algebras and conformal blocks, respectively. They were re-interpreted by Costello-Gwilliam as a framework for algebras of observables in quantum field theory. A special class, the so-called "locally constant" factorization algebras received special attention from Lurie, Ayala-Francis, and Scheimbauer in the context of fully extended topological field theories. In the first lecture I shall recall this history, define factorization homology in the mold of Ayala-Francis, and recall the key property of excision, which both uniquely determines factorization homology as a functor, and gives an effective mechanism for its computation. In the second lecture, I will turn to examples in geometry and representation theory, following Ben-Zvi-Francis-Nadler, and our works with Ben-Zvi-Brochier and Brochier-Snyder. Specializing the "coefficients" to lie in presentable k-linear categories (the natural home of algebraic geometry and representation theory), one recovers character varieties, and their canonical quantizations, as a computation in factorization homology.

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

name: Factorization algebras in quantum, conformal, and topological Field Theory


Open: Our central mission

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

uk: Бібліотекознавство, документознавство

en: Information and Library Sciences

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

de: Geisteswissenschaften

uk: Гуманітарні науки

en: Humanities

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

name: State Scientific and Technical Library of Ukraine

addressCountry: UA

addressLocality: Kyiv

addressRegion: Kyiv City


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

uk: Бібліотекознавство, документознавство

uk: Гуманітарні науки

description: In der ersten Folge werfen wir einen Blick zurück – auf 17 Jahre Twitter und Co.

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

name: Folge 1: Ein Blick zurück – 17 Jahre Twitter und Co.


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

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

name: Eta-invariants on pin manifolds and time-reversal symmetry


Reproducible research in R

keywords:
R
Computer science
Reproducible workflow
Rmarkdown

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

description: In this session, Facundo Muñoz (Cirad, France) describex tools and workflows to cumulatively improve the reproducibility of analyses performed in R. R is a mature, world-class, open-source statistical computing and data-analysis platform with a huge community of users from all areas of science and industry. Yet, most researchers rely only on its most basic scripting features, missing the opportunity to unleash its full potential, in particular concerning reproducible-research workflows. Specifically, we discuss encoding and platform-specific packages, the advantages of organising code into functions, using project-directories and relative paths, reproducible reports with RMarkdown, controlling package versions with Renv, organising code into a pipeline with targets, keeping track of changes from various collaborators with git, reproducibly publishing results with Continuous Integration in Git(Hu|La)b pages, reproducing the complete environment with docker, and controlling versions of the complete software stack with GNU Guix.

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


keywords:
Open science
Tick-borne encephalitis
Disease surveillance
Epidemiology

de: Humanmedizin/Gesundheitswissenschaften

uk: Медицина / Науки про здоров'я

en: Human Medicine / Health Sciences

de: Biologie

uk: Біологія

en: Biology

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

description: In this video tutorial, Timothee Dub and Henna Mäkelä (Finnish Institute for Health and Welfare, Finland ) discussed the basics of infectious disease surveillance (event-based and indicator-based surveillance, active versus passive surveillance), as well as the advantages and limitations of each type of systems, followed by the example of how surveillance activities for TBE are conducted in Finland. By the end of this lecture, participants should be aware of the limitations and quality issues that can occur when using surveillance data for comparison and/or modelling.

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

name: Basics of surveillance and epidemic intelligence activities: an overview and the example of TBE


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

description: Moduli spaces of stable parabolic connections on curves are very interesting objects which are related to different area of mathematics like algebraic geometry, integrable systems, mathematical physics and Geometric Langlands conjecture. In this lecture, we will explain about an explicit geometry of the moduli spaces of stable parabolic connections on curves introduced and constructed by Inaba, Iwasaki and Saito and Inaba. Then we will review a work of Arinkin and Lysenko on a rank 2 connections on the projective line with 4 singular points, which is related to Geometric Langlands conjecture in this case. We then explain about the joint work on the moduli space of rank 2 parabolic bundles on the projective line with Simpson and Loray. If time permits, related works of Geometric Langlands conjecture in these cases may be discussed.

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

name: Moduli spaces of parabolic connections, parabolic bundles and Geometric Langlands


Spectral problems and WKB

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

description: We reformulate spectral problems in the language of WKB theory and generalise to higher rank. This is based on work with Andrew Neitzke.

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


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

description: I will present work in progress suggesting a conjecturally general correspondence relating quantum (Chern-Simons) invariants of knots in three-space to (Eynard-Orantin) higher genus mirror symmetry, the computation of the former being solved by the latter. The correspondence rests on the identification of a natural group of piecewise linear transformations on both sides of the correspondence.

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

name: Chern-Simons theory and the Thompson group


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

description: The Askey–Wilson polynomials are a special case of Macdonald polynomials; their degenerations are organised into a hierarchy called q-Askey scheme. In this talk the speaker will give a new approach to study degenerations as well as dualities in the q-Askey scheme, based on the fact that all families of polynomials in the q-Askey scheme admit a certain algebra of symmetries (the Zhedanov algebra and its degenerations) and in the limit as q→1 this algebra becomes the coordinate ring of a certain subalgebra of a quantum object that we call quantum cusped character variety.

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

name: Quantum character varieties and q-Askey scheme


On quantum curves

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

description: In this talk I will discuss some general aspects on quantum curves. I will emphasize the need to go beyond WKB-like perturbative schemes, and the usefulness of working with actual Hilbert spaces. I will then present three mathematical mechanisms in our theory of quantum mirror curves which make it possible to go from the discrete world of quantum mechanics to the continuous world of enumerative geometry: Fredholm determinants, large N limits, and Wigner distributions. I will also list some interesting open problems for the future.

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


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

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

name: The BGW KdV tau function coupled to Gromov-Witten invariants of P1


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

description: Im Rahmen der voranschreitenden Open-Access-Transformation werden immer mehr Zeitschriften in Open-Access-Formate überführt. So stieg die Zahl der im Directory of Open Access Journals (DOAJ) indexierten Zeitschriften von April 2018 bis April 2021 von 11.250 auf mehr als 16.000. Dies resultiert in starken Herausforderungen für Wissenschaftler:innen, fachlich geeignete Zeitschriften für ihre Manuskripte zu bestimmen. Deshalb haben sich die TIB und die SLUB Dresden mit Unterstützung des DOAJ, OpenCitations und vieler nationaler Einrichtungen im BMBF-Projekt "B!SON" zum Ziel gesetzt, einen offenen, verlagsagnostischen, kostenfreien und datenschutzkonformen webbasierten Empfehlungsservice für qualitätsgesicherte Open-Access-Zeitschriften aufzubauen. Hier erhalten Nutzer:innen nach Eingabe von Titel, Abstract und/oder Literaturverzeichnis eine nach Relevanz gefilterte Liste an Open-Access-Zeitschriften, welche zu ihrem Manuskript passen. Die Suche kann mittels Filterkriterien verfeinert werden. Die Ausgabe der Empfehlungen enthält einen Steckbrief zu jeder Zeitschrift, welche die finale Auswahl durch die Wissenschaftler:innen erleichtern soll. Zu Beginn des Projekts wurden Anforderungen an den Empfehlungsservice erhoben. Dazu wurde (a) eine Fragebogenerhebung bei Wissenschaftler:innen durchgeführt und (b) Aussagen von Spezialist:innen aus der Publikationsberatung in qualitativen Interviews gesammelt. Mehr als 850 Wissenschaftler:innen haben den Fragebogen ausgefüllt. Diese wünschten sich die Einbindung folgender Informationen in den Empfehlungsservice: (1) Auflistung der Zeitschriften-Verzeichnisse in denen die Zeitschrift gelistet ist zur Absicherung gegen Fake-Journale, (2) Kosten und Lizenzrechte (z.B. Höhe der Publikationskosten und deren Übernahme durch die Institution; Verbleib der Nutzungsrechte bei den Autor:innen), und (3) Auffindbarkeit des eigenen Artikels (DOI-Vergabe, Einbindung in Literaturdatenbanken) sowie Einfluss und Sichtbarkeit der Zeitschrift (zitationsbasierter Aufmerksamkeitswert). Seitens der Publikationsberatenden wird vor allem die Transparenz des Empfehlungsservice (Wie kommt B!SON zu den empfohlenen Zeitschriften?) und die standortspezifische Anpassung zur Einbindung der Förderkriterien hervorgehoben. Der erste B!SON-Prototyp soll ab April 2022 zur Verfügung stehen, das vollständige System wird April 2023 live gehen. Im Fokus des Talks stehen, neben einer kurzen Vorstellung des Empfehlungsservice, die Präsentation und Diskussion der Ergebnisse der Anforderungsanalyse.

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

name: B!SON – Empfehlungsservice für qualitätsgesicherte Open-Access-Zeitschriften

Universität Konstanz

addressLocality: Konstanz

addressRegion: Baden-Wurttemberg


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

description: We propose a new link between the moduli spaces of wild Higgs bundles and quantum invariants of 3-manifolds. The construction goes through a class of four-dimensional quantum field theories known as Argyres-Douglas theories. Every such theory realizes a wild Hitchin space as its Coulomb branch and defines a VOA on the Higgs branch. The latter can be used to construct a non-unitary modular tensor category, which leads to 3d-TQFTs that are generically semisimple but non-unitary. This is based on joint work with Mykola Dedushenko, Sergei Gukov, Hiraku Nakajima and Ke Ye.

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

name: Wild Higgs Bundles and Modular Categories


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

description: (Joint work with Anna Puskas) We determine all of the imaginary n-quadratic fields with class number dividing 32 by extending on already known results for the class numbers of quadratic and biquadratic fields. Our results provide techniques to find complete lists of imaginary n-quadratic fields of class number 2m for nonnegative integers m. Further, given a fixed m>0 we find a bound B(m) on n for which there are no imaginary n-quadratic fields of class number 2m whenever n>B(m).

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

name: Imaginary Multiquadratic Fields of Class Number 2^k

name: Banff International Research Station (BIRS) for Mathematical Innovation and Discovery


The primes according to Euclid

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

description: In Book IX of the Elements, Euclid recorded a constructive proof that there are infinitely many prime numbers. It remains a model of elegant mathematical reasoning. However, some basic follow-up questions remain unanswered, such as: If we start from nothing and apply Euclid's construction in all possible ways, does every prime number eventually turn up? I will explain how the set of all possible instances of Euclid's construction has a natural directed graph structure, before saying some (interesting?) things about the graph.

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


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

description: In 1792, Gauss conjectured that the primes occur with a density of 1logx around x. Therefore, when developing explicit results relating to the Prime Number Theorem, it is useful to study Chebyshev‚Äôs θ(x) function, given by ∑p≤xlogp. Over summer 2017, I worked on a joint project supported by NSERC USRA to develop an effective version of the Prime Number Theorem. In this talk, I present our results which are the current best results for the prime counting function θ(x) for various ranges of x. We developed these results by first surveying existing explicit results from the past 60 years on prime counting functions. Our results are based on a recent zero density result for the zeroes of the Riemann Zeta function (due to H. Kadiri, A. Lumley, and N. Ng).

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

name: Sharper bounds for Chebyshev's θ(x) function


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

description: About half a century ago, Simon Gindikin and Fredrick Karpelevich evaluated the well known Harish Chandra‚Äôs \textbf{c}-function for semisimple Lie groups. This solution became known as the Gindikin-Karpelvich formula. While studying the constant term of Eisenstein series on adelic groups, Langland in \emph{Euler Products}, formulated the p-adic analogue of \textbf{c}-function and solved this integral. Macdonald independently obtained this formula for p-adic Chevalley groups in his lectures notes \emph{Spherical Functions on a Group of p-adic Type}. In Kac-Moody settings, which are infinite dimensional in general, the first challenge is to show that the algebraic analogue of the \textbf{c}-function is well defined. This can be done by proving certain finiteness results. For affine Kac-Moody groups, Braverman, Garland, Kazhdan, and Patnaik (BGKP) did this in 2014. Recently, Auguste H¬¥ebert generalized these results by using the combinatorial objects called \emph{hovels} associated with Kac-Moody groups. We are trying to obtain these finiteness results using the algebraic methods motivated by the work of BGKP. In my talk, I will describe these results and share our progress on it.

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

name: Certain finiteness results for local Kac-Moody groups


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

description: The graph of isogenies of supersingular elliptic curves has many applications in computational number theory and public key cryptography. I will present some of these applications and I will also discuss some open problems.

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

name: Supersingular isogeny graphs and applications


On a Theorem of Arthur and Clozel

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

description: Nearly thirty years ago, Arthur and Clozel proved that every nilpotent Galois representation of a number field arises from an automorphic representation, which, in fact, follows from Artin reciprocity, their cyclic base change, and some group theory. In this talk, we will discuss what goes wrong when trying to apply the cyclic base change to attack general monomial Galois representations, and what one can do instead. In particular, we shall discuss how to derive Langlands reciprocity for any Galois representation whose image is either nearly nilpotent or "small'".

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


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

description: Let a,b∈Q¯ be such that exactly one of a and b is an algebraic integer, and let ft(z)=z2+t be a family of quadratic polynomials parametrized by t∈Q¯. We prove that the set of all t∈Q¯ for which there exist m,n≥0 such that fmt(a)=fnt(b) has bounded height. This is a special case of a more general result supporting a new bounded height conjecture in arithmetic dynamics. This is joint work with DeMarco, Ghioca, Krieger, Tucker, and Ye.

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

name: Bounded heights in families of dynamical systems


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

description: Trainers: Alok Kumar & Jakob Kahl Learn how to create your own website based on Volto.

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

name: Plone Conference 2021 - React and Volto: Get started with React and create your own site using Volto - Part 2/2


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

description: In the past couple of years we have been working on developing a batteries-included solution for Italian municipalities based on the latest Plone 6 frontend technology. It offers repeatable deployments of Plone sites that are adherent to current regulations for municipality websites, while allowing the needed graphical customizations. And its core is open source. We will take a look at how it's made and how it joins forces with the community towards its goals.

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

name: io-Comune: the solution for Italian municipalities


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

description: Trainer: David Bain In case you are unsure about any of these terms we will do a quick review BEFORE going on to the rest of this workshop. A little background, Principles & concepts, Logging in & out, preferences and password management, Folder management and the basic publication workflow. We will not look at theming or customisation.

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

name: Getting started with your Plone 6 site: For Editors and Site Managers


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

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

name: Plone Conference 2021 - React and Volto: Get started with React and create your own site using Volto - Part 1/2


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

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

name: Volume estimates for some random convex sets


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

description: In equilibrium statistical mechanics, the macroscopic states of a system at thermal equilibrium are described by probability measures on the space of microscopic states that maximize pressure. For systems whose microscopic states are symbolic configurations from a subshift, Dobrushin, Lanford and Ruelle showed that under broad conditions, global and local equilibrium conditions are equivalent, that is, "equilibrium measures" are the same as (shift-invariant) "Gibbs measures". I will discuss some variants and generalizations of this theorem, in particular, a broad generalization to systems in contact with a random environment. Some nice symbolic dynamics issues arise. The underlying lattice can be any countable amenable group.

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

name: Relative Gibbs measures and relative equilibrium measures


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

description: We discuss the automorphism group, i.e. the centralizer of the shift action inside the group of self-homeomorphisms of a subshift, together with the extended symmetry group (the corresponding normalizer) of certain Zd -subshifts with a hierarchical structure, like bijective substitutive subshifts and the Robinson tiling. This group has been previously studied in e.g. Michael Baake, John Roberts and Reem Yassawi's previous works, among others. Treating those subshifts as geometrical objects, we introduce techniques to identify allowed extended symmetries from large-scale structures present in certain special points of the subshift, leading to strong restrictions on the group of extended symmetries. We prove that in the aforementioned cases, Sym(X,Zd) (and thus Aut(X,Zd)) is virtually-Zd and we explicitly represent the nontrivial extended symmetries, associated with the quotient Sym(X,Zd)/Aut(X,Zd), as a subset of rigid transformations of the coordinate axes. We also show how our techniques carry over to the study of the Robinson tiling, both in its minimal and non-minimal version. We emphasize the geometric nature of these techniques and how they reflect the capability of extended symmetries to capture such properties in a subshift.

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

name: Extended symmetry on Z d-subshifts with hierarchical structure


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

description: In this talk I'll discuss the notion of "invariant random orders", and explain how it can be useful in studying actions of countable groups. In particular, we'll formulate a unified "Kieffer-Pinsker formula" for the Kolmogorov-Sinai entropy of measure preserving actions of amenable groups, and show how it can be used to prove that a topologically predictable action of a countable amenable group has zero topological entropy, as conjectured by Hochman, and mention some related open problems. Based on joint work with Andrei Alpeev and Sieye Ryu.

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

name: Predictability, topological entropy and invariant random orders


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

description: For any group G and set A, let CA(G;A) be the monoid of all cellular automata over the configuration space AG. In this talk, we present some algebraic results on CA(G;A) when G and A are both finite. First, we show that any generating set of CA(G;A) must have a cellular automaton with minimal memory set equal to G itself. Second, we describe the structure of the group of units of CA(G;A) in terms of a set of representatives of the conjugacy classes of subgroups of G. Third, we discuss the minimal cardinality of a generating set of CA(G;A): in some cases we give it precisely, while in others we give some bounds. We apply this to provide a simple proof that CA(G;A) is not finitely generated for various kinds of infinite groups G.

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

name: Generating sets of monoids of cellular automata


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

description: Rufus Bowen left a notebook containing 157 open problems and questions. Problem 32 on that list asks for classification of shift spaces with the specification property. Unfortunately, there is no universally accepted agreement what does it mean “to classify” a family of mathematical objects, and Bowen didn't left any clues. During my talk, I will describe one of the most popular ways of making the problem formal. It is based on the theory of Borel equivalence relations. Inside that framework, I will explain a result saying that (roughly speaking) there is no reasonable classification for shift spaces with the specification property. More precisely, I will show that the isomorphism relation on the space of shifts with the specification property is a universal countable Borel equivalence relation, i.e. for every countable Borel equivalence relation F, we have that F is Borel reducible to E. It follows that no classification using a finite set of definable invariants is possible. This solves the problem provided that Bowen would agree with the notion of “classification” provided by the theory of Borel equivalence relations.

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

name: On Problem 32 from Rufus Bowen's list: classification of shift spaces with specification


Nilrigidity

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

description: A dynamical system is asymptotically nilpotent if every trajectory tends to some special zero point. When such convergence is necessarily uniform for some family of dynamical systems, we speak of nilrigidity. We discuss nilrigidity in particular in the context of (cold) dynamics of cellular automata and subactions of subshifts. Joint work with Ilkka Törmä.

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


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

description: Let (X,σ) be a subshift and Aut(X) be the automorphism group, the group of self conjugacies of (X,σ). The mapping class group, denoted M)(σ), is the group of self flow equivalences. We show that M(σ) is constrained in the case of low-complexity minimal subshifts, similar to constraints on Aut(X). In particular, when (X,σ) is a minimal subshift associated to a substitution, M(σ) is an extension of Z by some finite subgroup of Aut(X).

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

name: The mapping class group of minimal subshifts


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

description: This talk is about topological and combinatorial properties of finite rank minimal systems. We establish a clear connection with the S -adic subshifts and provide necessary and sufficient conditions for a subshift to be of finite rank. Using these conditions we study the number of asympototic components of a finite rank subshift and show that there is a rank two subshift with non superlinear complexity. I will also mention results concerning the automorphism group of a finite rank subshift. This is work in progress with Fabien Durand, Alejandro Maass and Samuel Petite.

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

name: Topological and combinatorial properties of finite rank minimal subshifts


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

description: Points are coded in a Bratteli-Vershik system by the cylinders of a fixed length through which their orbit passes at time n. This coding is said to be essentially faithful if it is faithful on a set of measure 1. We discuss a family of diagrams that are guaranteed to have a faithful coding for sufficiently long cylinders. In addition, we will discuss a condition on diagrams for which the codings will be periodic on a set of measure 1 and hence not faithful.

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

name: An essentially faithful coding of Limited Scope adic systems

name: Banff International Research Station (BIRS) for Mathematical Innovation and Discovery


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

description: Given a countable amenable group G one can ask which are the real numbers that can be realized as the topological entropy of a subshift of finite type (SFT). A famous result by Hochman and Meyerovitch completely characterizes these numbers for Z2. I will show that the same characterization is valid for any amenable group with decidable word problem which admits an action of Z2 which is free and bounded. Using this result we can give a full characterization of the entropies of SFTs for polycyclic groups. Furthermore, the same result holds for any countable group with decidable word problem which contains the direct product of any pair of infinite, finitely generated and amenable groups. In particular, it holds for many branch groups such as the Grigorchuk group.

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

name: Topological entropies of subshift of finite type in amenable groups


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

description: From the minute 55:45 of video does not have audio. The study of the topology of real algebraic varieties dates back to the work of Harnack, Klein and Hilbert in the 19th century; in particular, the isotopy type classification of real algebraic curves with a fixed degree in the real projective plane is a classical subject that has undergone considerable evolution. On the other hand, apart from studies concerning Hirzebruch surfaces and at most degree 3 surfaces in the real projective space, not much is known for more general ambient surfaces. In particular, this is because varieties constructed using the patchworking method are hypersurfaces of toric varieties. However, there are many other real algebraic surfaces. Among these are the real rational surfaces, and more particularly the real minimal rational surfaces. In this talk, we present some results about the classification of topological types realized by real algebraic curves of "small class" in real minimal del Pezzo surfaces which are real non-toric surfaces with non-connected real parts. We will explain how combine variations of classical methods with degeneration methods, that have found recent applications in real enumerative geometry, and the exploitation of Welschinger invariants to get through such classifications.

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

name: Real algebraic curves on real minimal del Pezzo surfaces


Specialization of stable rationality

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

description: I will discuss an ongoing project with John Christian Ottem to find new examples of stably irrational hypersurfaces by combining the specialization results obtained with Evgeny Shinder with tropical compactification techniques. The guiding example will be the quartic fivefold.

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


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

description: Using tools from Tropical and Non-Archimedean Geometry, we show that there is a tight relationship between the following two concepts of real inflection of real linear series defined on real algebraic curves: 1. that of complete series on hyper-elliptic curves, and 2. that of incomplete series on elliptic curves. Concretely, the case (1) can be degenerated to the case (2), and the case (2) can be regenerated to the case (1). This interplay gives us two products: 1. A limit linear series on a (marked) metrized complex of (real) algebraic curves. By this we mean a marked tropical curve with real models. 2. A 2-dimensional family of polynomials generalizing the division polynomials (which are used to compute the torsion points of elliptic curves) This is a joint work with I. Biswas (TATA, India) and E. Cotterill (UFF, Brazil).

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

name: On the real inflection points of linear (in)complete series on real (hyper)elliptic curves.


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

description: Many of the classical models of statistical physics, such as the Ising and Potts models, can be defined over any underlying finite graph. The case of a sparse, randomly-generated underlying graph has received considerable recent attention from probabilists, largely guided by several far-reaching predictions about its behaviour from the physics literature. When the underlying graph is chosen uniformly at random from all (2d) -regular graphs on n vertices, and then n is sent to infinity, the local neighbourhoods around most vertices look like larger and larger trees with high probability. This observation allows one to extract weak limit processes over an infinite (2d) -regular tree from sequences of models built over the finite graphs. That infinite tree can be viewed as the Cayley graph of a free group, and the limit process becomes a probability-preserving action of that group on a shift-space. This point of view is the basis for various asymptotic analyses of probabilistic features of the finite models, and also for the definition of sofic entropy for free-group actions in ergodic theory. This talk will be a gentle introduction to these two fields and the connections between them.

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

name: Probability over random graphs and actions of free groups


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

description: A plane quartic has 28 bitangents. A tropical plane quartic may have infinitely many bitangents, but there is a natural equivalence relation for which we obtain precisely 7 bitangent classes. If a tropical quartic is Trop(V(q)) for a polynomial q in K[x,y] (where K is the field of complex Puiseux series), it is a natural question where in the 7 bitangent classes the tropicalizations of the 28 bitangents of V(q) are, or, put differently, which member of the tropical bitangent classes lifts to a bitangent of V(q), and with what multiplicity. It is not surprising that each bitangent class has 4 lifts. If q is defined over the reals, V(q) can have 4, 8, 16 or 28 real bitangents. We show that each tropical bitangent class has either 0 or 4 real lifts - that is, either all complex solutions are real, or none. We also discuss further questions concerning tropical tangents, their combinatorics and their real lifts. This talk is based on joint work with Yoav Len, and with Maria Angelica Cueto.

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

name: The combinatorics and real lifting of tropical bitangents to plane quartics


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

description: I will define and discuss the tropicalization and analytification of semialgebraic sets. We show that the real analytification is homeomorphic to the inverse limit of real tropicalizations, analogously to a result of Payne. We also show a real analogue of the fundamental theorem of tropical geometry.

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

name: Real tropicalization and analytification of semialgebraic sets.


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

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

name: Bounding the Betti numbers of real tropical varieties.


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

description: It is well known that if f is a Holder continuous function from a mixing shift of finite type X to R, then there exists a unique equilibrium state which is an invariant Gibbs measure having f as a potential function. This result has been generalized to wider classes, such as when X is a subshift with the specification property and f is a function in the Bowen class. Recently Baker and Ghenciu showed that there exists a (non-invariant) Gibbs measures for the zero potential if and only if X is (right-)balanced. We extend this result and show that a necessary and sufficient condition for the existence of invariant Gibbs measures on X for the potential 0 is the bi-balanced condition for X. We define a new condition, called f-balanced condition for the pair (X,f) and present a similar result for the existence of Gibbs measure with respect to f. Using this result, we construct a class of shift spaces which have a Gibbs measure but do not have invariant Gibbs measures for the potential 0, or equivalently, which are one-sided balanced but not bi-balanced, answering a question raised by Baker and Ghenciu.

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

name: On balanced subshifts and the existence of invariant Gibbs measures


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

description: Frontend techniques improve the user experience, but they damage the developer experience. AbFab (short name for Absolutely Fabulous, as the glorious TV show) proposes to throw away all these (npm)+(node)+(hyper complex javascript frameworks)+(gigantic bundles) and replace them with a more 90’s oriented approach (the 90’s is a period known for good TV shows and for extremely basic web technology). But yet… it is still providing all the frontend power and good stuff (because we are in the 20’s). Built with Guillotina and Svelte, it provides a ready-to-use online platform (should I say TTW?) to create simple and light components (should I say low-code?) that can be published anywhere.

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

name: AbFab! Come back to easy frontend development


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

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

name: On the number of transversal special parabolic points in the graph on a real polynomial


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

description: We investigate microgrid management where the controller tries to optimally dispatch a diesel generator as backup to primary renewable sources while maintaining low probability of blackouts. Dispatch takes place at discrete epochs (15 min in our example), while balancing takes place continuously, so only probabilistic guarantees are possible. Moreover, the likelihood of a blackout during the next dispatch period is not available analytically and can only be estimated. We formulate the problem as stochastic control where the Bellman equation features local probabilistic constraints that lead to an implicit state-dependent admissible control set. To tackle this challenge we develop novel Monte Carlo based algorithms, in particular empirical simulation procedures for learning the admissible control set as a function of system state. We propose a variety of relevant statistical tools including logistic regression, Gaussian process regression, quantile regression and support vector machines, which we then incorporate into an overall Regression Monte Carlo (RMC) framework for approximate dynamic programming. Our results indicate that using logistic or Gaussian process regression to estimate the admissibility probability outperforms the other options. Our algorithms offer an efficient and reliable extension of RMC to probability-constrained control. We illustrate our findings with two case studies for the microgrid setup with time-stationary and daily-seasonal net load dynamics.

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

name: Stochastic Control Problems with Local Probabilistic Constraints for Microgrid Management


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

description: The progressive hedging algorithm minimizes an expected "cost" by iteratively decomposing into separate subproblems for each scenario. Up to now it has depended on convexity of the underlying "cost" function with respect to the decision variables and the constraints on them. However, a new advance makes it possible to obtain convergence to a locally optimal solution when the procedure is executed close enough to it and a kind of second-order local sufficiency condition is satisfied. Besides applications in which costs and associated constraints may directly be nonconvex, there are applications to stochastic programming problems in which those are convex but the probabilities for the scenarios may be decision-dependent. For example, in a two-stage problem the probabilities in the recourse stage could be influenced by the first-stage decision.

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

name: Progressive Hedging in Nonconvex Stochastic Optimization


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

description: In this talk, we present a problem of strategic planning for capacity investment and production under uncertainty, in a competitive market. We model it as a general equilibrium problem, i.e., a collection of multi-agent optimization problems with an equilibrium constraint (supply meets demand), and we propose a solution method based on a scheme that considers: i) a stagewise-decomposition procedure using Progressive Hedging, ii) a representative agent representation, and iii) a decomposition-type method for its solution, such as the Alternating Direction Method of Multipliers (ADMM). We illustrate the numerical performance of the algorithm by solving a stochastic infrastructure planning problem for the electric vehicule fast-charging station problem over a small network.

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

name: A computation strategy for a two-stage stochastic equilibrium problem


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

description: Peak/off-peak spreads in European electricity spot markets are eroding due to the nuclear phaseout and the recent growth in photovoltaic capacity. The reduced profitability of peak/off-peak arbitrage forces hydropower producers to participate in the reserve markets. We propose a two-layer stochastic programming framework for the optimal operation of a multi-reservoir hydropower plant which sells energy on both the spot and the reserve markets. The backbone of this approach is a combination of decomposition and decision rule techniques. Numerical experiments demonstrate its effectiveness.

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

name: A Day-Ahead Decision Rule Method for Multi-Market Multi-Reservoir Management


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

description: Julia Dynamic Generation Expansion (JuDGE) is a Julia package for solving stochastic capacity expansion problems formulated in a "coarse-grained" scenario tree that models long-term uncertainties. The user provides JuDGE with a coarse-grained tree and a JuMP formulation of a stage problem to be solved in each node of this tree. JuDGE then applies Dantzig-Wolfe decomposition to this framework based on the general model of Singh et al. (2009). The stage problems are themselves single-stage capacity expansion problems with integer capacity variables, but quite general constraints that can model, for example, operations in random environments, or even equilibrium constraints, as long as they can be solved exactly (e.g. via reformulation as mixed integer programs). This presentation outlines the theoretical background for JuDGE, and shows the results of applying it to several problem instances: i. a knapsack problem with expanding capacity; ii. optimal capacity expansion in an electricity distribution network subject to reliability constraints; iii. national capacity expansion to meet renewable energy targets; iv. optimal transmission expansion for an electricity wholesale market with imperfectly competitive agents. References Singh, K., Philpott, A.B. and Wood, K., Dantzig-Wolfe decomposition for solving multi-stage stochastic capacity planning problems, Operations Research, 57, 1271-1286, 2009.

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

name: Multistage Stochastic Capacity Planning Using JuDGE


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

description: Nepal is an agriculture based society. According to 2011 Census, 64% of the households use wood/fire wood for meeting their energy needs. With an aim of conducting a detailed study of energy consumption dynamics of rural Nepal, three surveys were conducted. A survey of 400 households of biogas consumers, 300 households of national grid electricity users and 51 households of micro hydro project users was conducted. This presentation is based on results obtained from these surveys. Conduction of such surveys has a great significance for country like Nepal; as it is without a strong backbone of good quality official data. Remote geographical locations, lack of awareness and lack of incentives are the main reasons behind this plight of official statistics. This survey generated more than 350 multivariate data. In these surveys, the base questionnaire is the same. It is a structured questionnaire with answers given as multiple choices that resulted in categorical data. This categorical data could be analyzed on ordinal scale. Because of large sample size this could be treated as a continuous data by the application of central limit theorem. The questionnaire was pretested. Multivariate statistics is used here to quantify and explain the relationship between these variables. Consumer profile databases were constructed. Data based research is evidence based research. Evidence based research is objective and undisputable. This presentation highlights this evidence based approach of handling an issue. As what gets measured also gets done.

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

name: Results from Sample Surveys of Renewable Energy Users of Nepal


On sets and configurations

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

description: When does a given set contain a copy of your favourite pattern (for example, specially arranged points on a line or a spiral, or the vertices of a polyhedron)? Does the answer depend on how thin the set is in some quantifiable sense? Problems involving identification of prescribed configurations under varying interpretations of size have been vigorously pursued both in the discrete and continuous setting, often with spectacular results that run contrary to intuition. Yet many deceptively simple questions remain open. I will survey the literature in this area, emphasizing some of the landmark results that focus on different aspects of the problem.

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

name: Banff International Research Station (BIRS) for Mathematical Innovation and Discovery


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

description: I will discuss an inverse problem for the wave equation, where a collection (array) of sensors probes an unknown heterogeneous medium with waves and measures the echoes.The goal is to determine scattering structures in the medium modeled by a reflectivity function. Much of the existing imaging methodology is based on a linear least squares data fit approach. However, the mapping between the reflectivity and the wave measured at the array is nonlinear and the resulting images have artifacts. I will show how to use a reduced order model (ROM) approach to solve the inverse scattering problem. The ROM is data driven i.e., it is constructed from the data, with no knowledge of the medium. It approximates the wave propagator, which is the operator that maps the wave from one time step to the next. I will show how to use the ROM to: (1) Remove the multiple scattering (nonlinear) effects from the data, which can then be used with any linearized inversion algorithm. (2) Obtain a well conditioned quantitative inversion algorithm for estimating the reflectivity.

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

name: Quantitative inverse scattering via reduced order modeling


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

description: Reaction-diffusion systems with strong interaction terms appear in many multi-species physical problems as well as in population dynamics. The qualitative properties of the solutions and their limiting profiles in different regimes have been at the center of the community's attention in recent years. A prototypical example is the system of equations \[\left\{\begin{array}{l} -\Delta u+a_1u = b_1|u|^{p+q-2}u+cp|u|^{p-2}|v|^qu,\\ -\Delta v+a_2v = b_2|v|^{p+q-2}v+cq|u|^{p}|v|^{q-2}v \end{array} \right. \] in a domain $\Omega\subset \mathbb{R}^N$ which appears, for example, when looking for solitary wave solutions for Bose-Einstein condensates of two different hyperfine states which overlap in space. The sign of $b_i$ reflects the interaction of the particles within each single state. If $b_i$ is positive, the self interaction is attractive (focusing problems). The sign of $c$, on the other hand, reflects the interaction of particles in different states. This interaction is attractive if $c>0$ and repulsive if $c<0$. If the condensates repel, they eventually separate spatially giving rise to a free boundary. Similar phenomena occurs for many species systems. As a model problem, we consider the system of stationary equations: \[ \begin{cases} -\Delta u_i=f_i(u_i)-\beta u_i\sum_{j\neq i}g_{ij}(u_j)\;\\ u_i>0\;. \end{cases} \] The cases $g_{ij}(s)=\beta_{ij}s$ (Lotka-Volterra competitive interactions) and $g_{ij}(s)=\beta_{ij}s^2$ (gradient system for Gross-Pitaevskii energies) are of particular interest in the applications to population dynamics and theoretical physics respectively. Phase separation and has been described in the recent literature, both physical and mathematical. Relevant connections have been established with optimal partition problems involving spectral functionals. The classification of entire solutions and the geometric aspects of phase separation are of fundamental importance as well. We intend to focus on the most recent developments of the theory in connection with problems featuring anomalous diffusions, non-local and non symmetric interactions.

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

name: Spiralling and other solutions in limiting profiles of competition diffusion systems


Complex Analysis: Old and New

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

description: We give a survey of some of the leading trends in several complex variables and offer a few themes and problems for discussion at the workshop.

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


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

description: In this talk I will introduce the classical and tropical invariants corresponding to the enumeration of fixed genus (or cogenus) curves on a Surface, the floor diagrams, and their multiplicity in order to explicit some combinatorial aspects that allow us to establish the polynomiality property on the degree. I will explain how these polynomials can be seen as polynomials in two variables, the degree and the number of complex conjugated points of the configuration of points; and I will show some properties of the polynomials we obtain and some relations among them coming from known properties of the classical invariants. This is a joint work with E. Brugallé.

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

name: Göttsche conjecture for tropical refined invariants.


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

description: The small boundary property for topological dynamical systems was introduced by Lindenstrauss to construct small entropy factors. A recent work of Kerr and Szabo showed that this dynamical property is closely related to uniform property Gamma of the crossed product, hence plays an important role in classification of crossed products. In this talk we discuss how to strengthen the connection by considering a relative version of uniform property Gamma. This is a joint work with Aaron Tikuisis.

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

name: Small boundary property, uniform property Gamma, and almost finiteness


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

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

name: Representation stability and index theory


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

description: We give conditions on a potentially non-Hausdorff étale groupoid which guarantee that its associated C*-algebra is simple. As a key source of examples, work of Nekrashevych and Exel-Pardo describes a class of C*-algebras arising from the action of a group on a finite alphabet (or more generally, a finite graph). The above authors described these as groupoid C*-algebras and gave conditions which guaranteed their simplicity, usually starting from assumptions which imply the groupoid is Hausdorff. These groupoids need not be Hausdorff, notably for the self-similar action associated to the Grigorchuk group, so it was an open question whether the C*-algebra of the Grigorchuk group action was simple or not. We answer this question in the affirmative. We also discuss simplicity criteria for the associated Steinberg algebras.

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

name: Simplicity of algebras associated to non-Hausdorff groupoids


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

description: Higher-rank graphs (k-graphs) are a combinatorial model for C*-algebras; indeed, much of the structure of k-graph C*-algebras is encoded in the underlying combinatorial data of the k-graph. However, different k-graphs can give rise to isomorphic or Morita equivalent C*-algebras. In this talk, we present several ways to modify the structure of a k-graph which preserve the Morita equivalence class of the associated C*-algebra. Our constructions are inspired by the analogous work for graph C*-algebras of Bates and Pask, as well as by the textile system approach to describing k-graphs. This is joint work with C. Eckhardt, K. Fieldhouse, D. Gent, I. Gonzales, and D. Pask.

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

name: Moves on k-graphs preserving Morita equivalence


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

description: I will discuss the new concepts of complemented partitions of unity (CPoU) and uniform property gamma, introduced in joint work with Castillejos, Tikuisis, White and Winter.

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

name: Complemented partitions of unity and uniform property gamma


Comparison radius and mean dimension

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

description: Consider a free and minimal topological dynamical system and the corresponding crossed-product C*-algebra. We show that, under an assumption of Rokhlin property and an assumption of Cuntz comparison of open sets, the radius of comparison of the C*-algebra is at most the half of the mean (topological) dimension of the dynamical system. Moreover, still under these two assumptions, if the mean dimension is zero, then the C*-algebra is Jiang-Su stable or finite dimensional. This includes all free and minimal actions by Z^d and some other systems.

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