It’s A Living Mural for X-Games China & Innersect

Looking to build an online form on your WordPress site? Not sure whether you should use WPForms or Google Forms? Both WPForms and Google Forms are two great options for small and medium scale businesses. But when you dig deeper, you’ll find a few key differences between these 2 form builders. To help you find […]

The post WPForms vs. Google Forms – Which One is Best? (Compared) appeared first on IsItWP - Free WordPress Theme Detector.

Adam talks frankly about his challenges keeping up with family and friends since his injury; he has good intentions but following through remains difficult.

Transitioning from military to civilian life can take time and can be tricky. Adam talks about how student veteran groups on college campuses can help vets reintegrate socially in their own way and  time.

They say that a picture is worth a thousand words, but have you ever stopped to think what your Ecommerce images are saying about the products you’re trying to sell online? Are your photos helping your products to jump off the screen and convince shoppers to buy them? Or, are your product images quite simply […]

Original post: 5 Product Image Tips For High Converting Landing Pages

The post 5 Product Image Tips For High Converting Landing Pages appeared first on Daily Blog Tips.

For the first time, it seems, the entire world knows what it’s like to live inside my head.

Sections: Open Color (PID color) Open Monochrome (PID monochrome) Nature (ND) Travel (PTD) The maximum number of works is four (4) per section. (Total 16 [...]

The post BOISHAKHI PHOTO AWARDS appeared first on Photocompete.

Tel Aviv University Press Release Smoking parents misperceive where and when their kids are exposed to cigarette smoke, Tel Aviv University researchers say Four out of 10 children in the US are exposed to secondhand smoke, according to the American … Continue reading →

It was surreal to sit down at the mic and record this show after spending the last few years (5 a.m. mornings, late, late nights, and many long weekends hunkered down) writing a book that I’m proud and beyond excited to share with YOU and the world.  It’s called CREATIVE CALLING and it’s officially available for pre-order TODAY! In this episode, you get the little sneak peek at the book (yes, I read a little from it) and a little background on why I needed to write it.  After all, life isn’t about “finding” fulfillment and success – it’s about creating it. Creativity is a force inside every person that, when unleashed, transforms our lives and delivers vitality to everything we do. Establishing a creative practice is therefore our most valuable and urgent task – as important to our well-being as exercise or nutrition. The good news? Creativity isn’t a skill—it’s a habit available to everyone:  beginners and lifelong creators, entrepreneurs to executives, astronauts to zookeepers, and everyone in between. It’s only through small, daily actions that we can supercharge our innate creativity and (re-)discover our personal power in life. Everything you need is inside you right now. Whether your ambition is a creative career, completing a creative […]

The post Everything I Know In One Place appeared first on Chase Jarvis Photography.

Ditch the idea of yourself as a starving artist. Throw away the notion that you’re doomed to be another poor creative soul. My long time pal Ramit Sethi is back on the show to remind us we need to get back on track to building and living a rich life. And believe me, that doesn’t have to mean cutting back the lattes. Ramit has been on the show a few times, but if you haven’t caught up yet, let me fill you in. Ramit Sethi is the author of the NYT bestseller “I Will Teach You To Be Rich” and writes for over 500,000 monthly readers on his website, iwillteachyoutoberich.com. It’s one of my favorite go-to finance resources covering psychology, personal finance, careers, and entrepreneurship. No one has single-handedly given me better insight into the business side of art, than Ramit. Ramit has updated & expanded 2nd edition of his book and joined me for a LIVE studio conversation on money confessions. In this episode we get into: A rich life isn’t only about save money, it’s about defining & prioritizing the things you love the most. It’s one thing to manage our own personal finances but navigating that with […]

The post Ramit Sethi: Money + Other Ways to Live Rich appeared first on Chase Jarvis Photography.

When it was time to think about the cover – the whole design package – for my NEW BOOK, Creative Calling, I knew I wanted it to be something different. After all…see if you follow me here… it’s just wrong to make a book about creativity with just any old trend, cliche book cover.  Instead, the package needed to embody the ideas within. So when we approached this design challenge of a hard bound book – it had to be meaningful, beautiful, AND stand out in a sea of other books on the shelf.  No small task… And consider this:  you know that this isn’t just a nice story about the book cover.  This is a metaphor for any creative challenge.  Like every episode of podcast is full of practical advice….this is the real life story of ups and downs on this process…on how we struggled to overcame the challenge front of us… with costs, design options, time, publisher feedback, and other real-life constraints.  In short of EVERY CREATIVE PROCESS.  I’ve included 2 live-recorded phone calls with the designers on the project, Lou and Vasco, so you get their take on the creation process, challenges, the concepts behind what we set out to […]

The post A [big] new challenge—the story behind the Creative Calling book cover appeared first on Chase Jarvis Photography.

You know her, the award-winning host, author and speaker, Marie Forleo returns to the podcast to talk about her new book , Everything Is Figureoutable. In the New York Times Best-Selling book, Marie gives readers tactics to look at setbacks positively and overcome obstacles creatively, so you can start reaching your dreams.  In this episode, we sit down to talk about how her life experiences influenced the book. She shares stories of fear, failure and always having fun have impacted her life. And we discuss a quote of hers (that I repeat all the time) that can help you get into the creative zone. Enjoy! FOLLOW MARIE: instagram | twitter | website Listen to the Podcast Subscribe   Watch the Episode  This podcast is brought to you by CreativeLive. CreativeLive is the world’s largest hub for online creative education in photo/video, art/design, music/audio, craft/maker, money/life and the ability to make a living in any of those disciplines. They are high quality, highly curated classes taught by the world’s top experts — Pulitzer, Oscar, Grammy Award winners, New York Times best selling authors and the best entrepreneurs of our times.

The post Everything is Figureoutable with Marie Forleo appeared first on Chase Jarvis Photography.

Ever felt STUCK with something in your life? Blocked, like you can’t get past this mental state, this hurdle, this creative block, this bad habit, this… Wait a minute. Why am I even asking that question? Of course you’ve been stuck before. We’ve literally ALL been stuck before. And by extension we all know how much it sucks to be in this state of mind. AND – on the flipside – how amazing it is when you can reclaim your life and get back to the things you want to be thinking, doing, and becoming. I’m obsessed with overcoming the mental blockers that try to keep me down – and I think it’s been a big piece of my personal success. Which is why I thought this little nugget might help. ENTER: Lewis Howes. My good friend Lewis Howes was in the studio shooting his newest CreativeLive course last week and I was able to snag him for a few minutes to chat about his new book and his amazingly simple, yet powerful process for reclaiming our lives and live our biggest dreams. In this episode, Lewis shares a powerful experience from his life and how- on reflection – it helped […]

The post How To Get UN-STUCK From Anything in Life That’s Got You Down [with Lewis Howes] appeared first on Chase Jarvis Photography.

There are 7106 languages on earth and yet there are a few universal languages that transcends the language barrier. In this episode we explore one of the first universal languages of human history: music. My guest today is Clemency Burton-Hill. From underground DJ to the Creative Director at New York Public Radio, she is an author, a musician, and host of multiple podcasts including The Open Ears Project, Classical Fix, and Moments that Made Me. Her latest book, Year of Wonder helps readers explore and experience a new classical musical piece every day. In this episode: Classical music has a bad rap for being stuffy, boring, and largely inaccessible. Clemency expands on what’s available, and how it’s really the soundtrack of our lives. The universality of music and how we use music to explore, express, and share. Of course, Clemency drops so many names of musical artists to explore who are crushing it today. Enjoy! FOLLOW CLEMENCY: instagram | twitter | website Listen to the Podcast  Subscribe   This podcast is brought to you by CreativeLive. CreativeLive is the world’s largest hub for online creative education in photo/video, art/design, music/audio, craft/maker, money/life and the ability to make a living in […]

The post There Is Only One You with Clemency Burton-Hill appeared first on Chase Jarvis Photography.

Colin O’Brady is a world record holding explorer and one of the world’s top endurance athletes. Fresh out of college, Colin had a vast world of possibility in front of him when a tragic accident left him hospitalized. Unsure if he’d ever walk again, his injuries covered nearly 25% of his body, primarily damaging his legs and feet. Despite the odds, his mother encouraged him to dream big and he dared to set a seemingly impossible goal that set him on a path to rethink what’s possible. Fast forward to today, and Colin’s list of achievements is staggering. In this episode, we get into many of his harrowing adventures, including his solo, unsupported, unassisted crossing of Antartica. Even if you’re not a professional athlete or have any ambition to break world records, his story will resonate. We all need courage, a strong mindset, and pure grit to overcome obstacles, pursue big dreams, and do the seemingly impossible. A few highlights from our conversation: 1000 NOs paves the way to YES. How failure is only helping us forge and prepare us for the thing we are reaching for. The longest journey is 6 inches between your ears. Colin shares how he discovered mindset […]

The post Rethink Impossible with Colin O’Brady appeared first on Chase Jarvis Photography.

Join me + bestselling author Vishen Lakhiani LIVE Tuesday April 7 at 6:30pm PST. Vishen Lakhiani is one of today’s most influential minds in the fields of education and human consciousness. He is the founder of Mindvalley University and its 2 million-strong student base and creator of the Quests learning platform: a next-generation method of online learning, which attains an unheard-of 60% completion rate on courses, in an industry where 8% is average. Vishen’s book, The Code of the Extraordinary Mind, made the New York Times Business Best Sellers List, and hit the coveted #1 spot on Amazon five times in 2017. Enjoy! FOLLOW VISHEN: instagram | facebook | website Listen to the Podcast coming soon … Subscribe   This podcast is brought to you by CreativeLive. CreativeLive is the world’s largest hub for online creative education in photo/video, art/design, music/audio, craft/maker, money/life and the ability to make a living in any of those disciplines. They are high quality, highly curated classes taught by the world’s top experts — Pulitzer, Oscar, Grammy Award winners, New York Times best selling authors and the best entrepreneurs of our times.

The post The Code of the Extraordinary Mind with Vishen Lakhiani appeared first on Chase Jarvis Photography.

In this episode I’m chatting with my long time friend and financial guru, Ramit Sethi. Ramit has been on the show a number of times, and this time we’re connecting virtually from our living rooms during the quarantine. Of course we get into finances during these uncertain times, but more importantly: adaptation and resilience. Over the years, no one has single-handedly given me better insight about the business side of art than the New York Times bestselling author, Ramit Sethi. Take a listen and let us know what you think. Enjoy! This episode was part of CreativeLive TV, a brand-new, free, 24/7 variety show, live-streamed from the very casual living rooms, studios, and kitchen tables of our worldwide community of legendary creators. You can expect musical performances, Q&As, cooking, spoken word, drawing, and more – featuring many of our favorite personalities – all in a safe, virtual space full of joy, shared experiences, and connection via live, interactive chat. The schedule and upcoming broadcasts can be seen at http://creativelive.com/tv FOLLOW RAMIT: instagram | twitter | website Listen to the Podcast  Subscribe   Watch the Episode This podcast is brought to you by CreativeLive. CreativeLive is the world’s largest hub […]

The post Finance Fireside Chat with Ramit Sethi appeared first on Chase Jarvis Photography.

As I stated in my Best of 2017 post, I didn’t get to take many photos this year – which also multiple times throughout the year made me think: why am I paying so much money for Lightroom for how […]

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.

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.

Communication has been quite a challenge during the COVID-19 pandemic, and data visualization hasn't been the most helpful given the low quality of the data – see Amanda Makulec's plea to think harder about making another coronavirus chart. A great example of how to do things right is the widely-circulated Flatten the Curve information graphic/cartoon. […]

We study two notions of topological entropy of correspondences introduced by Friedland and Dinh-Sibony. Upper bounds are known for both. We identify a class of holomorphic correspondences whose entropy in the sense of Dinh-Sibony equals the known upper bound. This provides an exact computation of the entropy for rational semigroups. We also explore a connection between these two notions of entropy.

In this article, we characterize nearly invariant subspaces of finite defect for the backward shift operator acting on the vector-valued Hardy space which is a vectorial generalization of a result of Chalendar-Gallardo-Partington (C-G-P). Using this characterization of nearly invariant subspace under the backward shift we completely describe the almost invariant subspaces for the shift and its adjoint acting on the vector valued Hardy space.

Let $1 le r < n$ be integers. We give a proof that the group $mathop{mathrm{Aut}}({X_{n}^{mathbb{N}}, sigma_{n}})$ of automorphisms of the one-sided shift on $n$ letters embeds naturally as a subgroup $mathcal{h}_{n}$ of the outer automorphism group $mathop{mathrm{Out}}(G_{n,r})$ of the Higman-Thompson group $G_{n,r}$. From this, we can represent the elements of $mathop{mathrm{Aut}}({X_{n}^{mathbb{N}}, sigma_{n}})$ by finite state non-initial transducers admitting a very strong synchronizing condition.

Let $H in mathcal{H}_{n}$ and write $|H|$ for the number of states of the minimal transducer representing $H$. We show that $H$ can be written as a product of at most $|H|$ torsion elements. This result strengthens a similar result of Boyle, Franks and Kitchens, where the decomposition involves more complex torsion elements and also does not support practical extit{a priori} estimates of the length of the resulting product.

We also give new proofs of some known results about $mathop{mathrm{Aut}}({X_{n}^{mathbb{N}}, sigma_{n}})$.

We first give a sufficient condition, issued from pluripotential theory, for an unbounded domain in the complex Euclidean space $mathbb C^n$ to be Kobayashi hyperbolic. Then, we construct an example of a rigid pseudoconvex domain in $mathbb C^3$ that is Kobayashi hyperbolic and has a nonempty core. In particular, this domain is not biholomorphic to a bounded domain in $mathbb C^3$ and the mentioned above sufficient condition for Kobayashi hyperbolicity is not necessary.

This work has been motivated by recent papers that quantify the density of values of generic quadratic forms and other polynomials at integer points, in particular ones that use Rogers' second moment estimates. In this paper we establish such results in a very general framework. Namely, given any subhomogeneous function (a notion to be defined) $f: mathbb{R}^n o mathbb{R}$, we derive a necessary and sufficient condition on the approximating function $psi$ for guaranteeing that a generic element $fcirc g$ in the $G$-orbit of $f$ is $psi$-approximable; that is, $|fcirc g(mathbf{v})| le psi(|mathbf{v}|)$ for infinitely many $mathbf{v} in mathbb{Z}^n$. We also deduce a sufficient condition in the case of uniform approximation. Here, $G$ can be any closed subgroup of $operatorname{ASL}_n(mathbb{R})$ satisfying certain axioms that allow for the use of Rogers-type estimates.

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 first review the setting for the geometric Langlands functoriality and establish a result for the `backward' functoriality functor. We illustrate this by known examples of the geometric theta-lifting. We then apply the above result to obtain new Hecke eigen-sheaves. The most important application is a construction of the automorphic sheaf for G=GSp_4 attached to a G^L-local system on a curve X such that its standard representation is an irreducible local system of rank 4 on X.

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 derive finite rational formulas for the traces of cycle integrals of certain meromorphic modular forms. Moreover, we prove the modularity of a completion of the generating function of such traces. The theoretical framework for these results is an extension of the Shintani theta lift to meromorphic modular forms of positive even weight.

We consider the stochastic 2-dimensional Cahn-Hilliard equation which is driven by the derivative in space of a space-time white noise. We use two different approaches to study this equation. First we prove that there exists a unique solution $Y$ to the shifted equation (see (1.4) below), then $X:=Y+{Z}$ is the unique solution to stochastic Cahn-Hilliard equaiton, where ${Z}$ is the corresponding O-U process. Moreover, we use Dirichlet form approach in cite{Albeverio:1991hk} to construct the probabilistically weak solution the the original equation (1.1) below. By clarifying the precise relation between the solutions obtained by the Dirichlet forms aprroach and $X$, we can also get the restricted Markov uniquness of the generator and the uniqueness of martingale solutions to the equation (1.1).

High dimensional expanders is a vibrant emerging field of study. Nevertheless, the only known construction of bounded degree high dimensional expanders is based on Ramanujan complexes, whereas one dimensional bounded degree expanders are abundant.

In this work, we construct new families of bounded degree high dimensional expanders obeying the local spectral expansion property. This property has a number of important consequences, including geometric overlapping, fast mixing of high dimensional random walks, agreement testing and agreement expansion. Our construction also yields new families of expander graphs which are close to the Ramanujan bound, i.e., their spectral gap is close to optimal.

The construction is quite elementary and it is presented in a self contained manner; This is in contrary to the highly involved previously known construction of the Ramanujan complexes. The construction is also very symmetric (such symmetry properties are not known for Ramanujan complexes) ; The symmetry of the construction could be used, for example, in order to obtain good symmetric LDPC codes that were previously based on Ramanujan graphs.

The main tool that we use for is the theory of coset geometries. Coset geometries arose as a tool for studying finite simple groups. Here, we show that coset geometries arise in a very natural manner for groups of elementary matrices over any finitely generated algebra over a commutative unital ring. In other words, we show that such groups act simply transitively on the top dimensional face of a pure, partite, clique complex.

Let $f colon X o X$ be a surjective endomorphism of a normal projective surface. When $operatorname{deg} f geq 2$, applying an (iteration of) $f$-equivariant minimal model program (EMMP), we determine the geometric structure of $X$. Using this, we extend the second author's result to singular surfaces to the extent that either $X$ has an $f$-invariant non-constant rational function, or $f$ has infinitely many Zariski-dense forward orbits; this result is also extended to Adelic topology (which is finer than Zariski topology).

We address the problem of optimal path planning for a simple nonholonomic vehicle in the presence of obstacles. Most current approaches are either split hierarchically into global path planning and local collision avoidance, or neglect some of the ambient geometry by assuming the car is a point mass. We present a Hamilton-Jacobi formulation of the problem that resolves time-optimal paths and considers the geometry of the vehicle.

In this paper we study removable singularities for regular $(1,1/2)$-Lipschitz solutions of the heat equation in time varying domains. We introduce an associated Lipschitz caloric capacity and we study its metric and geometric properties and the connection with the $L^2$ boundedness of the singular integral whose kernel is given by the gradient of the fundamental solution of the heat equation.

In this work, the generalized $N$-component Fokas-Lenells(FL) equations, which have been studied by Guo and Ling (2012 J. Math. Phys. 53 (7) 073506) for $N=2$, are first investigated via Riemann-Hilbert(RH) approach. The main purpose of this is to study the soliton solutions of the coupled Fokas-Lenells(FL) equations for any positive integer $N$, which have more complex linear relationship than the analogues reported before. We first analyze the spectral analysis of the Lax pair associated with a $(N+1) imes (N+1)$ matrix spectral problem for the $N$-component FL equations. Then, a kind of RH problem is successfully formulated. By introducing the special conditions of irregularity and reflectionless case, the $N$-soliton solution formula of the equations are derived through solving the corresponding RH problem. Furthermore, take $N=2,3$ and $4$ for examples, the localized structures and dynamic propagation behavior of their soliton solutions and their interactions are discussed by some graphical analysis.

In 1978, Dwight Duffus---editor-in-chief of the journal "Order" from 2010 to 2018 and chair of the Mathematics Department at Emory University from 1991 to 2005---wrote that "it is not obvious that $P$ is connected and $P^P$ isomorphic to $Q^Q$ implies that $Q$ is connected," where $P$ and $Q$ are finite non-empty posets. We show that, indeed, under these hypotheses $Q$ is connected and $Pcong Q$.

In this work we study the dynamical behavior Tonelli Lagrangian systems defined on the tangent bundle of the torus $mathbb{T}^2=mathbb{R}^2 / mathbb{Z}^2$. We prove that the Lagrangian flow restricted to a high energy level $ E_L^{-1}(c)$ (i.e $ c> c_0(L)$) has positive topological entropy if the flow satisfies the Kupka-Smale propriety in $ E_L^{-1}(c)$ (i.e, all closed orbit with energy $c$ are hyperbolic or elliptic and all heteroclinic intersections are transverse on $E_L^{-1}(c)$). The proof requires the use of well-known results in Aubry-Mather's Theory.

High-performance implementations of graph algorithms are challenging to implement on new parallel hardware such as GPUs, because of three challenges: (1) difficulty of coming up with graph building blocks, (2) load imbalance on parallel hardware, and (3) graph problems having low arithmetic intensity. To address these challenges, GraphBLAS is an innovative, on-going effort by the graph analytics community to propose building blocks based in sparse linear algebra, which will allow graph algorithms to be expressed in a performant, succinct, composable and portable manner. In this paper, we examine the performance challenges of a linear algebra-based approach to building graph frameworks and describe new design principles for overcoming these bottlenecks. Among the new design principles is exploiting input sparsity, which allows users to write graph algorithms without specifying push and pull direction. Exploiting output sparsity allows users to tell the backend which values of the output in a single vectorized computation they do not want computed. Load-balancing is an important feature for balancing work amongst parallel workers. We describe the important load-balancing features for handling graphs with different characteristics. The design principles described in this paper have been implemented in "GraphBLAST", the first open-source linear algebra-based graph framework on GPU targeting high-performance computing. The results show that on a single GPU, GraphBLAST has on average at least an order of magnitude speedup over previous GraphBLAS implementations SuiteSparse and GBTL, comparable performance to the fastest GPU hardwired primitives and shared-memory graph frameworks Ligra and Gunrock, and better performance than any other GPU graph framework, while offering a simpler and more concise programming model.

Quantum computing has evolved quickly in recent years and is showing significant benefits in a variety of fields. Malware analysis is one of those fields that could also take advantage of quantum computing. The combination of software used to locate the most frequent hashes and $n$-grams between benign and malicious software (KiloGram) and a quantum search algorithm could be beneficial, by loading the table of hashes and $n$-grams into a quantum computer, and thereby speeding up the process of mapping $n$-grams to their hashes. The first phase will be to use KiloGram to find the top-$k$ hashes and $n$-grams for a large malware corpus. From here, the resulting hash table is then loaded into a quantum machine. A quantum search algorithm is then used search among every permutation of the entangled key and value pairs to find the desired hash value. This prevents one from having to re-compute hashes for a set of $n$-grams, which can take on average $O(MN)$ time, whereas the quantum algorithm could take $O(sqrt{N})$ in the number of table lookups to find the desired hash values.

Differential machine learning (ML) extends supervised learning, with models trained on examples of not only inputs and labels, but also differentials of labels to inputs.

Differential ML is applicable in all situations where high quality first order derivatives wrt training inputs are available. In the context of financial Derivatives risk management, pathwise differentials are efficiently computed with automatic adjoint differentiation (AAD). Differential ML, combined with AAD, provides extremely effective pricing and risk approximations. We can produce fast pricing analytics in models too complex for closed form solutions, extract the risk factors of complex transactions and trading books, and effectively compute risk management metrics like reports across a large number of scenarios, backtesting and simulation of hedge strategies, or capital regulations.

The article focuses on differential deep learning (DL), arguably the strongest application. Standard DL trains neural networks (NN) on punctual examples, whereas differential DL teaches them the shape of the target function, resulting in vastly improved performance, illustrated with a number of numerical examples, both idealized and real world. In the online appendices, we apply differential learning to other ML models, like classic regression or principal component analysis (PCA), with equally remarkable results.

This paper is meant to be read in conjunction with its companion GitHub repo https://github.com/differential-machine-learning, where we posted a TensorFlow implementation, tested on Google Colab, along with examples from the article and additional ones. We also posted appendices covering many practical implementation details not covered in the paper, mathematical proofs, application to ML models besides neural networks and extensions necessary for a reliable implementation in production.

With the increase in use of Unmanned Aerial Vehicles (UAVs)/drones, it is important to detect and identify causes of failure in real time for proper recovery from a potential crash-like scenario or post incident forensics analysis. The cause of crash could be either a fault in the sensor/actuator system, a physical damage/attack, or a cyber attack on the drone's software. In this paper, we propose novel architectures based on deep Convolutional and Long Short-Term Memory Neural Networks (CNNs and LSTMs) to detect (via Autoencoder) and classify drone mis-operations based on sensor data. The proposed architectures are able to learn high-level features automatically from the raw sensor data and learn the spatial and temporal dynamics in the sensor data. We validate the proposed deep-learning architectures via simulations and experiments on a real drone. Empirical results show that our solution is able to detect with over 90% accuracy and classify various types of drone mis-operations (with about 99% accuracy (simulation data) and upto 88% accuracy (experimental data)).

The connection between visual input and tactile sensing is critical for object manipulation tasks such as grasping and pushing. In this work, we introduce the challenging task of estimating a set of tactile physical properties from visual information. We aim to build a model that learns the complex mapping between visual information and tactile physical properties. We construct a first of its kind image-tactile dataset with over 400 multiview image sequences and the corresponding tactile properties. A total of fifteen tactile physical properties across categories including friction, compliance, adhesion, texture, and thermal conductance are measured and then estimated by our models. We develop a cross-modal framework comprised of an adversarial objective and a novel visuo-tactile joint classification loss. Additionally, we develop a neural architecture search framework capable of selecting optimal combinations of viewing angles for estimating a given physical property.

A k-proper edge-coloring of a graph G is called adjacent vertex-distinguishing if any two adjacent vertices are distinguished by the set of colors appearing in the edges incident to each vertex. The smallest value k for which G admits such coloring is denoted by $chi$'a (G). We prove that $chi$'a (G) = 2R + 1 for most circulant graphs Cn([[1, R]]).

Many efforts of research are devoted to semantic role labeling (SRL) which is crucial for natural language understanding. Supervised approaches have achieved impressing performances when large-scale corpora are available for resource-rich languages such as English. While for the low-resource languages with no annotated SRL dataset, it is still challenging to obtain competitive performances. Cross-lingual SRL is one promising way to address the problem, which has achieved great advances with the help of model transferring and annotation projection. In this paper, we propose a novel alternative based on corpus translation, constructing high-quality training datasets for the target languages from the source gold-standard SRL annotations. Experimental results on Universal Proposition Bank show that the translation-based method is highly effective, and the automatic pseudo datasets can improve the target-language SRL performances significantly.

Recent single image unsupervised representation learning techniques show remarkable success on a variety of tasks. The basic principle in these works is instance discrimination: learning to differentiate between two augmented versions of the same image and a large batch of unrelated images. Networks learn to ignore the augmentation noise and extract semantically meaningful representations. Prior work uses artificial data augmentation techniques such as cropping, and color jitter which can only affect the image in superficial ways and are not aligned with how objects actually change e.g. occlusion, deformation, viewpoint change. In this paper, we argue that videos offer this natural augmentation for free. Videos can provide entirely new views of objects, show deformation, and even connect semantically similar but visually distinct concepts. We propose Video Noise Contrastive Estimation, a method for using unlabeled video to learn strong, transferable single image representations. We demonstrate improvements over recent unsupervised single image techniques, as well as over fully supervised ImageNet pretraining, across a variety of temporal and non-temporal tasks. Code and the Random Related Video Views dataset are available at https://www.github.com/danielgordon10/vince

Deep neural networks have exhibited promising performance in image super-resolution (SR). Most SR models follow a hierarchical architecture that contains both the cell-level design of computational blocks and the network-level design of the positions of upsampling blocks. However, designing SR models heavily relies on human expertise and is very labor-intensive. More critically, these SR models often contain a huge number of parameters and may not meet the requirements of computation resources in real-world applications. To address the above issues, we propose a Hierarchical Neural Architecture Search (HNAS) method to automatically design promising architectures with different requirements of computation cost. To this end, we design a hierarchical SR search space and propose a hierarchical controller for architecture search. Such a hierarchical controller is able to simultaneously find promising cell-level blocks and network-level positions of upsampling layers. Moreover, to design compact architectures with promising performance, we build a joint reward by considering both the performance and computation cost to guide the search process. Extensive experiments on five benchmark datasets demonstrate the superiority of our method over existing methods.