Winterlichter Palmengarten Jan 2016

Taking your first steps in programming is like picking up a foreign language. At first, the syntax makes no sense, the vocabulary is unfamiliar, and everything looks and sounds unintelligible. If you’re anything like me when I started, fluency feels impossible. I promise it isn’t. When I began coding, the learning curve hit me — hard. I spent ten months teaching myself the basics while trying to stave off feelings of self-doubt that I now recognize as imposter syndrome.

Web developers build a lot of Single Page Applications using JavaScript frameworks (Angular, React, Vue). SPAs dynamically populate the contents of their pages on load which means by the time google crawls their site, the important content is yet to be injected into the site. Part of this problem can be solved by pre-rendering your application’s content. This is where server-side applications come in, and for Vuejs developers, we can build server-side applications using Nuxt.

For the most part, we tend to underestimate things that are familiar to us. It is also very likely that we will underestimate those things that though new, seem very simple to process. And that is correct to some degree. But, when we are faced with complex cases and all measures are taken, a good and solid understanding of the basics could help us to find the right solutions. In this article, we will take a deeper look at one of the most simple, thus, quite often underrated activities in web development that is the design of wireframes.

May is here! And even though the current situation makes this a different kind of May, with a new routine and different things on our minds as in the years before, luckily some things never change. Like the fact that we start into the new month with some fresh inspiration. Since more than nine years already, we challenge you, the design community, to get creative and produce wallpaper designs for our monthly posts.

It has been a month since we launched our first online workshop and, to be honest, we really didn’t know whether people would enjoy them — or if we would enjoy running them. It was an experiment, but one we are so glad we jumped into! I spoke about the experience of taking my workshop online on a recent episode of the Smashing podcast. As a speaker, I had expected it to feel very much like I was presenting into the empty air, with no immediate feedback and expressions to work from.

The Ionic Framework is an open-source UI toolkit for building fast, high-quality applications using web technologies with integrations for popular frameworks like Angular and React. Ionic enables cross-platform development using either Cordova or Capacitor, with the latter featuring support for desktop application development using Electron. In this article, we will explore Ionic with the React integration by building an app that displays comics using the Marvel Comics API and allows users to create a collection of their favorites.

In this episode of the Smashing Podcast, we’re talking about building apps on a tight timeline. How can you quickly turn around a project to respond to an emerging situation like COVID-19? Drew McLellan talks to Phil Smith to find out. Show Notes CardMedic React Native React Native for Web Expo Apiary Phil’s company amillionmonkeys Phil’s personal blog and Twitter Weekly Update Getting Started With Nuxt Implementing Dark Mode In React Apps Using styled-components How To Succeed In Wireframe Design Mirage JS Deep Dive: Understanding Mirage JS Models And Associations (Part 1) Readability Algorithms Should Be Tools, Not Targets Transcript Drew McLellan: He is director of the full-stack web development studio amillionmonkeys, where he partners with business owners and creative agencies to build digital products that make an impact.

In these strange times when everything is connected, it’s too easy to feel lonely and detached. Yes, everybody is just one message away, but there is always something in the way — deadlines to meet, Slack messages to reply, or urgent PRs to review. Connections need time and space to grow, just like learning, and conferences are a great way to find that time and that space. In fact, with SmashingConfs, we’ve always been trying to create such friendly and inclusive spaces.

In this tutorial, you’ll be building a Survey App, where we’ll learn to validate our users form data, implement Authentication in Vue, and be able to receive survey data using Vue and Firebase (a BaaS platform). As we build this app, we’ll be learning how to handle form validation for different kinds of data, including reaching out to the backend to check if an email is already taken, even before the user submits the form during sign up.

Aputure’s been coming pretty thick and fast on the announcements lately, and now they’ve announced their new Light Storm 60D daylight and 60X bi-colour adjustable focusing LED lights. As the name suggests, these are 60 Watt LEDs, and everything is built inside the head, meaning there’s no external control unit to have to deal with. […]

The post Aputure announces new LS-60D daylight and LX-60X bicolour LED lights appeared first on DIY Photography.

Are there still folks among you who, like me, prefer handwriting to typing? If you’re in this group, you’ll love this new feature on Google Lens. The app now lets you scan your handwritten notes, copy them, and paste them straight to your computer. I gave it a spin, and I bring you my impressions […]

The post Google Lens now copies handwritten text and pastes it straight to your computer appeared first on DIY Photography.

DJI has announced their new Matrice 300 RTK “flying platform” (big drone) and the Zenmuse H20 hybrid camera series, to provide “a safer and smarter solution” to their enterprise customers. The M300 RTK, DJI says, is their first to integrate modern aviation features, advanced AI, 6-direction sensing and positioning, a UAV health management system and […]

The post DJI’s new Matrice 300 RTK drone offers a ridiculous 55-minutes of flight time and 2.7kg payload appeared first on DIY Photography.

Have you noticed extra-long and weirdly stretched images on your Instagram feed? It looks like some kind of a glitch has appeared, allowing users to post images like this to their followers. Of course, some Instagrammers have made the use of it to draw attention, and if you want to have some fun (or annoy […]

The post Weird glitch lets you post insanely long photos to Instagram appeared first on DIY Photography.

It feels like forever since Nikon announced their newest flagship DSLR; the Nikon D6. It’s actually only been three months, but that hasn’t stopped some people getting anxious. Recently, customers were being told that the D6 would start shipping right about now, but now Nikon has officially come out to announce that the Nikon D6 […]

The post Nikon has confirmed that their flagship D6 DSLR will start shipping on May 21st appeared first on DIY Photography.

With the coronavirus pandemic, many folks switched to working online. Things like teaching, business meetings and other face-to-face activities have been replaced with video calls. Home has become both home and workplace, and admit it: your wardrobe totally reflects this. Creative duo The Workmans shows this “fashion crossover” in their latest photo series #COVIDwear. The […]

The post #COVIDwear: a hilarious photo series showing quarantine fashion of remote workers appeared first on DIY Photography.

For those who’ve never seen TheCrafsMan SteadyCraftin on YouTube, you’re in for a treat – even if you already understand everything contained within this 25-minute video. For those who have, you know exactly what to expect. I’ve been following this rather unconventional channel for a while now. It covers a lot of handy DIY and […]

The post Watch YouTube’s most informed sock puppet teach you how to shoot with manual exposure appeared first on DIY Photography.

The Godox SL series LED lights have proven to be extremely popular due to their low cost. Two of the models in that range, the SL150 and SL200 have seen a Mark II update today, according to an email that Godox has been sending out today. One of the features of the new SL150II and […]

The post Godox’s new SL150/SL200 Mark II LED lights offer fanless “silent mode” operation appeared first on DIY Photography.

Charts usually show values as visual properties, like the length in a bar chart, the location in a scatterplot, the area in a bubble chart, etc. Unit charts show values as multiples instead. One famous example of these charts is called ISOTYPE, and you may have seen them in information graphics as well. They’re an […]

We all use data all the time, but what exactly is data? How do different programs know what to do with our data? How is visualizing data different from other uses of data? And isn’t everything inside a computer data in the end? The latest episode of eagereyesTV looks at what data is and what […]

Alberto Cairo’s new book, How Charts Lie, takes readers on a tour of how charts are used and misused, and teaches them how to not be misled. It’s a useful book for both makers and consumers of charts, in the news, business, and pretty much anywhere else. When Alberto started talking about the title on […]

This book from 1945 contains a very interesting mix of different charts made by the ISOTYPE Institute, some classic and some quite unusual. As a book about labor and unemployment, it also makes extensive use of Gerd Arntz’s famous unemployed man icon. Michael Young and Theodor Prager’s There’s Work for All is part of a […]

Visualization turns data into images, but are images themselves data? There are often claims that they are, but then you mostly see the images themselves without much additional data. In this video, I look at image browsers, a project classifying selfies along a number of criteria, and the additional information stored in HEIC that makes […]

We prove a Marstrand type slicing theorem for the subsets of the integer square lattice. This problem is the dual of the corresponding projection theorem, which was considered by Glasscock, and Lima and Moreira, with the mass and counting dimensions applied to subsets of $mathbb{Z}^{d}$. In this paper, more generally we deal with a subset of the plane that is $1$ separated, and the result for subsets of the integer lattice follow as a special case. We show that the natural slicing question in this setting is true with the mass dimension.

One proves the existence and uniqueness of a generalized (mild) solution for the nonlinear Fokker--Planck equation (FPE) egin{align*} &u_t-Delta (eta(u))+{mathrm{ div}}(D(x)b(u)u)=0, quad tgeq0, xinmathbb{R}^d, d e2, \ &u(0,cdot)=u_0,mbox{in }mathbb{R}^d, end{align*} where $u_0in L^1(mathbb{R}^d)$, $etain C^2(mathbb{R})$ is a nondecreasing function, $bin C^1$, bounded, $bgeq 0$, $Din(L^2cap L^infty)(mathbb{R}^d;mathbb{R}^d)$ with ${ m div}, Din L^infty(mathbb{R}^d)$, and ${ m div},Dgeq0$, $eta$ strictly increasing, if $b$ is not constant. Moreover, $t o u(t,u_0)$ is a semigroup of contractions in $L^1(mathbb{R}^d)$, which leaves invariant the set of probability density functions in $mathbb{R}^d$. If ${ m div},Dgeq0$, $eta'(r)geq a|r|^{alpha-1}$, and $|eta(r)|leq C r^alpha$, $alphageq1,$ $alpha>frac{d-2}d$, $dgeq3$, then $|u(t)|_{L^infty}le Ct^{-frac d{d+(alpha-1)d}} |u_0|^{frac2{2+(m-1)d}},$ $t>0$, and the existence extends to initial data $u_0$ in the space $mathcal{M}_b$ of bounded measures in $mathbb{R}^d$. The solution map $mumapsto S(t)mu$, $tgeq0$, is a Lipschitz contractions on $mathcal{M}_b$ and weakly continuous in $tin[0,infty)$. As a consequence for arbitrary initial laws, we obtain weak solutions to a class of McKean-Vlasov SDEs with coefficients which have singular dependence on the time marginal laws.

We consider a nonlinear Dirichlet problem driven by a nonhomogeneous differential operator plus an indefinite potential. In the reaction we have the competing effects of a singular term and of concave and convex nonlinearities. In this paper the concave term is parametric. We prove a bifurcation-type theorem describing the changes in the set of positive solutions as the positive parameter $lambda$ varies. This work continues our research published in arXiv:2004.12583, where $xi equiv 0 $ and in the reaction the parametric term is the singular one.

In this paper, for a family of second-order parabolic equation with rapidly oscillating and time-dependent periodic coefficients, we are interested in an approximate two-sphere one-cylinder inequality for these solutions in parabolic periodic homogenization, which implies an approximate quantitative propagation of smallness. The proof relies on the asymptotic behavior of fundamental solutions and the Lagrange interpolation technique.

An inverse spectral problem for the Sturm-Liouville operator with a singular potential from the class $W_2^{-1}$ is solved by the method of spectral mappings. We prove the uniqueness theorem, develop a constructive algorithm for solution, and obtain necessary and sufficient conditions of solvability for the inverse problem in the self-adjoint and the non-self-adjoint cases

Given graphs $T$ and $H$, the generalized Tur'an number ex$(n,T,H)$ is the maximum number of copies of $T$ in an $n$-vertex graph with no copies of $H$. Alon and Shikhelman, using a result of ErdH os, determined the asymptotics of ex$(n,K_3,H)$ when the chromatic number of $H$ is greater than 3 and proved several results when $H$ is bipartite. We consider this problem when $H$ has chromatic number 3. Even this special case for the following relatively simple 3-chromatic graphs appears to be challenging.

The suspension $widehat H$ of a graph $H$ is the graph obtained from $H$ by adding a new vertex adjacent to all vertices of $H$. We give new upper and lower bounds on ex$(n,K_3,widehat{H})$ when $H$ is a path, even cycle, or complete bipartite graph. One of the main tools we use is the triangle removal lemma, but it is unclear if much stronger statements can be proved without using the removal lemma.

The paper considers constrained linear systems with stochastic additive disturbances and noisy measurements transmitted over a lossy communication channel. We propose a model predictive control (MPC) law that minimizes a discounted cost subject to a discounted expectation constraint. Sensor data is assumed to be lost with known probability, and data losses are accounted for by expressing the predicted control policy as an affine function of future observations, which results in a convex optimal control problem. An online constraint-tightening technique ensures recursive feasibility of the online optimization and satisfaction of the expectation constraint without bounds on the distributions of the noise and disturbance inputs. The cost evaluated along trajectories of the closed loop system is shown to be bounded by the optimal predicted cost. A numerical example is given to illustrate these results.

We show weak-strong uniqueness and stability results for the motion of a two or three dimensional fluid governed by the Navier-Stokes equation interacting with a flexible, elastic plate of Koiter type. The plate is situated at the top of the fluid and as such determines the variable part of a time changing domain (that is hence a part of the solution) containing the fluid. The uniqueness result is a consequence of a stability estimate where the difference of two solutions is estimated by the distance of the initial values and outer forces. For that we introduce a methodology that overcomes the problem that the two (variable in time) domains of the fluid velocities and pressures are not the same. The estimate holds under the assumption that one of the two weak solutions possesses some additional higher regularity. The additional regularity is exclusively requested for the velocity of one of the solutions resembling the celebrated Ladyzhenskaya-Prodi-Serrin conditions in the framework of variable domains.

We derive the non-relativistic $c oinfty$ and ultra-relativistic $c o 0$ limits of the $kappa$-deformed symmetries and corresponding spacetime in (3+1) dimensions, with and without a cosmological constant. We apply the theory of Lie bialgebra contractions to the Poisson version of the $kappa$-(A)dS quantum algebra, and quantize the resulting contracted Poisson-Hopf algebras, thus giving rise to the $kappa$-deformation of the Newtonian (Newton-Hooke and Galilei) and Carrollian (Para-Poincar'e, Para-Euclidean and Carroll) quantum symmetries, including their deformed quadratic Casimir operators. The corresponding $kappa$-Newtonian and $kappa$-Carrollian noncommutative spacetimes are also obtained as the non-relativistic and ultra-relativistic limits of the $kappa$-(A)dS noncommutative spacetime. These constructions allow us to analyze the non-trivial interplay between the quantum deformation parameter $kappa$, the curvature parameter $eta$ and the speed of light parameter $c$.

We review some recent results on the phenomenon of surface superconductivity in the framework of Ginzburg-Landau theory for extreme type-II materials. In particular, we focus on the response of the superconductor to a strong longitudinal magnetic field in the regime where superconductivity survives only along the boundary of the wire. We derive the energy and density asymptotics for samples with smooth cross section, up to curvature-dependent terms. Furthermore, we discuss the corrections in presence of corners at the boundary of the sample.

In this work we consider the initial-value problem associated with a coupled system of generalized Korteweg-de Vries equations. We present a relationship between the best constant for a Gagliardo-Nirenberg type inequality and a criterion for the existence of global solutions in the energy space. We prove that such a constant is directly related to the existence problem of solitary-wave solutions with minimal mass, the so called ground state solutions. To guarantee the existence of ground states we use a variational method.

Willems et al.'s fundamental lemma asserts that all trajectories of a linear system can be obtained from a single given one, assuming that a persistency of excitation condition holds. This result has profound implications for system identification and data-driven control, and has seen a revival over the last few years. The purpose of this paper is to extend Willems' lemma to the situation where multiple (possibly short) system trajectories are given instead of a single long one. To this end, we introduce a notion of collective persistency of excitation. We will then show that all trajectories of a linear system can be obtained from a given finite number of trajectories, as long as these are collectively persistently exciting. We will demonstrate that this result enables the identification of linear systems from data sets with missing data samples. Additionally, we show that the result is of practical significance in data-driven control of unstable systems.

Miller and Sheffield introduced a notion of an imaginary surface as an equivalence class of pairs of simply connected proper subdomains of $mathbb{C}$ and Gaussian free fields (GFFs) on them under conformal equivalence. They considered the situation in which the conformal transformations are given by a chordal Schramm--Loewner evolution (SLE). In the present paper, we construct processes of GFF on $mathbb{H}$ (the upper half-plane) and $mathbb{O}$ (the first orthant of $mathbb{C}$) by coupling zero-boundary GFFs on these domains with stochastic log-gases defined on parts of boundaries of the domains, $mathbb{R}$ and $mathbb{R}_+$, called the Dyson model and the Bru--Wishart process, respectively, using multiple SLEs evolving in time. We prove that the obtained processes of GFF are stationary. The stationarity defines an equivalence relation between GFFs, and the pairs of time-evolutionary domains and stationary processes of GFF will be regarded as generalizations of the imaginary surfaces studied by Miller and Sheffield.

We study a mean field approximation for the 2D Euler vorticity equation driven by a transport noise. We prove that the Euler equations can be approximated by interacting point vortices driven by a regularized Biot-Savart kernel and the same common noise. The approximation happens by sending the number of particles $N$ to infinity and the regularization $epsilon$ in the Biot-Savart kernel to $0$, as a suitable function of $N$.

Starting from the Hamiltonian formulation of ${cal N}{=},2$ supersymmetric Calogero models associated with the classical $A_n, B_n, C_n$ and $D_n$ series and their hyperbolic/trigonometric cousins, we provide their superspace description. The key ingredients include $n$ bosonic and $2n(n{-}1)$ fermionic ${cal N}{=},2$ superfields, the latter being subject to a nonlinear chirality constraint. This constraint has a universal form valid for all Calogero models. With its help we find more general supercharges (and a superspace Lagrangian), which provide the ${cal N}{=},2$ supersymmetrization for bosonic potentials with arbitrary repulsive two-body interactions.

We prove the following result: Let $(M,g_0)$ be a compact manifold of dimension $ngeq 12$ with positive isotropic curvature. Then $M$ is diffeomorphic to a spherical space form, or a compact quotient manifold of $mathbb{S}^{n-1} imes mathbb{R}$ by diffeomorphisms, or a connected sum of a finite number of such manifolds. This extends a recent work of Brendle, and implies a conjecture of Schoen in dimensions $ngeq 12$. The proof uses Ricci flow with surgery on compact orbifolds with isolated singularities.

This paper addresses the problem of identifying the graph structure of a dynamical network using measured input/output data. This problem is known as topology identification and has received considerable attention in recent literature. Most existing literature focuses on topology identification for networks with node dynamics modeled by single integrators or single-input single-output (SISO) systems. The goal of the current paper is to identify the topology of a more general class of heterogeneous networks, in which the dynamics of the nodes are modeled by general (possibly distinct) linear systems. Our two main contributions are the following. First, we establish conditions for topological identifiability, i.e., conditions under which the network topology can be uniquely reconstructed from measured data. We also specialize our results to homogeneous networks of SISO systems and we will see that such networks have quite particular identifiability properties. Secondly, we develop a topology identification method that reconstructs the network topology from input/output data. The solution of a generalized Sylvester equation will play an important role in our identification scheme.

In this work, we study dynamic properties of classical solutions to a homogenous Neumann initial-boundary value problem (IBVP) for a two-species and two-stimuli chemotaxis model with/without chemical signalling loop in a 2D bounded and smooth domain. We successfully detect the product of two species masses as a feature to determine boundedness, gradient estimates, blow-up and $W^{j,infty}(1leq jleq 3)$-exponential convergence of classical solutions for the corresponding IBVP. More specifically, we first show generally a smallness on the product of both species masses, thus allowing one species mass to be suitably large, is sufficient to guarantee global boundedness, higher order gradient estimates and $W^{j,infty}$-convergence with rates of convergence to constant equilibria; and then, in a special case, we detect a straight line of masses on which blow-up occurs for large product of masses. Our findings provide new understandings about the underlying model, and thus, improve and extend greatly the existing knowledge relevant to this model.

In a multitype branching process, it is assumed that immigrants arrive according to a nonhomogeneous Poisson or a generalized Polya process (both processes are formulated as a nonhomogeneous birth process with an appropriate choice of transition intensities). We show that the renormalized numbers of objects of the various types alive at time $t$ for supercritical, critical, and subcritical cases jointly converge in distribution under those two different arrival processes. Furthermore, some transient moment analysis when there are only two types of particles is provided. AMS 2000 subject classifications: Primary 60J80, 60J85; secondary 60K10, 60K25, 90B15.

In this paper, we provide some topological criteria for the Poisson Dixmier-Moeglin equivalence for $A$ in terms of the poset $({ m P. spec A}, subseteq)$ and the symplectic leaf or core stratification on its maximal spectrum. In particular, we prove that the Zariski topology of the Poisson prime spectrum and of each symplectic leaf or core can detect the Poisson Dixmier-Moeglin equivalence for any complex affine Poisson algebra. Moreover, we generalize the weaker version of the Poisson Dixmier-Moeglin equivalence for a complex affine Poisson algebra proved in [J. Bell, S. Launois, O.L. S'anchez, and B. Moosa, Poisson algebras via model theory and differential algebraic geometry, J. Eur. Math. Soc. (JEMS), 19(2017), no. 7, 2019-2049] to the general context of a commutative differential algebra.

In this paper we study the following set[A={p(n)+2^nd mod 1: ngeq 1}subset [0.1],] where $p$ is a polynomial with at least one irrational coefficient on non constant terms, $d$ is any real number and for $ain [0,infty)$, $a mod 1$ is the fractional part of $a$. By a Bernoulli decomposition method, we show that the closure of $A$ must have full Hausdorff dimension.

Let $hat G$ be the finite simply connected version of an exceptional Chevalley group, and let $V$ be a nontrivial irreducible module, of minimal dimension, for $hat G$ over its field of definition. We explore the overgroup structure of $hat G$ in $mathrm{GL}(V)$, and the submodule structure of the exterior square (and sometimes the third Lie power) of $V$. When $hat G$ is defined over a field of odd prime order $p$, this allows us to construct the smallest (with respect to certain properties) $p$-groups $P$ such that the group induced by $mathrm{Aut}(P)$ on $P/Phi(P)$ is either $hat G$ or its normaliser in $mathrm{GL}(V)$.

We study the geometry and topology of exotic Springer fibers for orbits corresponding to one-row bipartitions from an explicit, combinatorial point of view. This includes a detailed analysis of the structure of the irreducible components and their intersections as well as the construction of an explicit affine paving. Moreover, we compute the ring structure of cohomology by constructing a CW-complex homotopy equivalent to the exotic Springer fiber. This homotopy equivalent space admits an action of the type C Weyl group inducing Kato's original exotic Springer representation on cohomology. Our results are described in terms of the diagrammatics of the one-boundary Temperley-Lieb algebra (also known as the blob algebra). This provides a first step in generalizing the geometric versions of Khovanov's arc algebra to the exotic setting.

Gabber and Joseph introduced a ladder diagram between two natural sequences of extensions. Their diagram is used to produce a 'twisted' sequence that is applied to old and new results on extension groups in category $mathcal{O}$.

In this work, we propose a simple modification of the forward-backward splitting method for finding a zero in the sum of two monotone operators. Our method converges under the same assumptions as Tseng's forward-backward-forward method, namely, it does not require cocoercivity of the single-valued operator. Moreover, each iteration only requires one forward evaluation rather than two as is the case for Tseng's method. Variants of the method incorporating a linesearch, relaxation and inertia, or a structured three operator inclusion are also discussed.

The two-dimensional directed spanning forest (DSF) introduced by Baccelli and Bordenave is a planar directed forest whose vertex set is given by a homogeneous Poisson point process $mathcal{N}$ on $mathbb{R}^2$. If the DSF has direction $-e_y$, the ancestor $h(u)$ of a vertex $u in mathcal{N}$ is the nearest Poisson point (in the $L_2$ distance) having strictly larger $y$-coordinate. This construction induces complex geometrical dependencies. In this paper we show that the collection of DSF paths, properly scaled, converges in distribution to the Brownian web (BW). This verifies a conjecture made by Baccelli and Bordenave in 2007.