What happens when you mash-up Disney princesses with Marvel Super Heros, artist cartooncookie did an excellent job creating this mix: Marvel x Disney Princesses: a celebration of the X-Men joining...

A landing page can be the difference between having a strong conversion rate and a bad one. After putting a […]

The post 5 Key Components of a Highly Converting Landing Page appeared first on WPHacks.

We kicked things off with an update on Rob's marijuana abstaining, or lack thereof. We then spend a good amount...

The post METAL INJECTION LIVECAST #540 - Eight Iota Ripper with Kenny Hickey of SILVERTOMB / TYPE O NEGATIVE appeared first on Metal Injection.

Punxsutawney Phil’s predictions for the coming of Spring on Groundhog Day haven’t been that accurate, and the U.S. National Weather Service is here to prove it with an infographic!

Every February 2, a crowd of thousands gathers at Gobbler’s Knob in Punxsutawney, Pennsylvania, to await a special forecast from a groundhog named Phil. If the 20-pound groundhog emerges and sees his shadow, the United States can expect six more weeks of winter weather according to legend. But, if Phil doesn’t see his shadow, we can expect warmer temperatures and the arrival of an early spring.

Even though he’s been forecasting since 1887, Phil’s track record for the entire country isn’t perfect. To determine just how accurate he is, we’ve compared U.S. national temperatures with Phil’s forecasts. On average, Phil has gotten it right 40% of the time over the past 10 years.

Using real data wins!

For what it’s worth, Phil didn’t see his shadow in 2020, and predicted that Spring would be coming soon!

By David Suzuki The David Suzuki Foundation Seeing terms like “post-truth” and “alternative facts” gain traction in the news convinces me that politicians, media workers and readers could benefit from a refresher course in how science helps us understand the … Continue reading →

A set of key visuals for Nike Shanghai

Managing money is complicated, especially for people with a brain injury who may have trouble remembering what they spent or creating a budget. Adam shares some tips from online banking to keeping a spending journal.

Adam says that like drill and ceremony and calling cadence, which start with a first step, so does recovery from a brain injury and/or PTSD.

If extra time on a test or memory aids can make life easier during college, why not use them? Adam talks about moving past the "stigma" of using disability services and getting the help you need to succeed in college.

By Melissa Hellmann Yes! Magazine A new report revealed surprising results when Oakland overhauled its lunch menu at 100-plus schools by serving less meat and more fruits and vegetables. When her eldest son was in elementary school in the Oakland … Continue reading →

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.

Corey Rich is a director, writer, and one of the top action sports photographers of our time. He has built a life and a career around his passions for travel and adventure by documenting some of the world’s greatest athletes in extreme locations spanning the globe. From alpine climbing in Pakistan’s Karakoram Mountains to ultramarathon racing in the Sahara Desert of Morocco, freight-train hopping in the American West, underwater cave exploration in the Yucatan and snowboarding in Papua New Guinea – if you’re an outdoor adventure lover, you’ve likely seen his work gracing the pages of your favorite magazines and video screens. Corey is a long-time friend and a master storyteller, so when he released his latest book, Stories Behind the Images, I couldn’t wait to have him on the show. In this episode, Corey takes us on a journey behind the scenes of his life and career. We get into: Doing what you love. The process of chasing the things we know we’re supposed to be doing in our heart. Sacrifice. I don’t know a single person at the top of their game who hasn’t sacrificed something to be where they are today. Corey reflects on what what he’s sacrificed […]

The post Corey Rich: Good Enough is Never Good Enough appeared first on Chase Jarvis Photography.

About six years ago, a colleague I’ll call Tom, because that’s his name, forwarded me a link to the ‘WASD CODE’; a keyboard focused on the needs of programmers, designed with the help of Stack Overflow’s Jeff Atwood. I had no idea at the time that there were people actually dedicating themselves to creating keyboards beyond the stock fare shipping with computers. As I read and re-read the blurb, I was smitten.

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.

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 […]

How do we read pie charts? This seems like a straightforward question to answer, but it turns out that most of what you’ve probably heard is wrong. We don’t actually know whether we use angle, area, or arc length. In a short paper at the VIS conference this week I’m presenting a study I ran […]

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 […]

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 provide an explicit construction for a class of commutative, non-associative algebras for each of the simple Chevalley groups of simply laced type. Moreover, we equip these algebras with an associating bilinear form, which turns them into Frobenius algebras. This class includes a 3876-dimensional algebra on which the Chevalley group of type E8 acts by automorphisms. We also prove that these algebras admit the structure of (axial) decomposition algebras.

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)$.

In this review paper, we survey Hardy type inequalities from the point of view of Folland and Stein's homogeneous groups. Particular attention is paid to Hardy type inequalities on stratified groups which give a special class of homogeneous groups. In this environment, the theory of Hardy type inequalities becomes intricately intertwined with the properties of sub-Laplacians and more general subelliptic partial differential equations. Particularly, we discuss the Badiale-Tarantello conjecture and a conjecture on the geometric Hardy inequality in a half-space of the Heisenberg group with a sharp constant.

In this paper, we give new constructions of strongly regular Cayley graphs on abelian groups as generalizations of a series of known constructions: the construction of covering extended building sets in finite fields by Xia (1992), the product construction of Menon-Hadamard difference sets by Turyn (1984), and the construction of Paley type partial difference sets by Polhill (2010). Then, we obtain new large families of strongly regular Cayley graphs of Latin square type or negative Latin square type.

Image analysis in the field of digital pathology has recently gained increased popularity. The use of high-quality whole slide scanners enables the fast acquisition of large amounts of image data, showing extensive context and microscopic detail at the same time. Simultaneously, novel machine learning algorithms have boosted the performance of image analysis approaches. In this paper, we focus on a particularly powerful class of architectures, called Generative Adversarial Networks (GANs), applied to histological image data. Besides improving performance, GANs also enable application scenarios in this field, which were previously intractable. However, GANs could exhibit a potential for introducing bias. Hereby, we summarize the recent state-of-the-art developments in a generalizing notation, present the main applications of GANs and give an outlook of some chosen promising approaches and their possible future applications. In addition, we identify currently unavailable methods with potential for future applications.

Recent beyond worst-case optimal join algorithms Minesweeper and its generalization Tetris have brought the theory of indexing and join processing together by developing a geometric framework for joins. These algorithms take as input an index $mathcal{B}$, referred to as a box cover, that stores output gaps that can be inferred from traditional indexes, such as B+ trees or tries, on the input relations. The performances of these algorithms highly depend on the certificate of $mathcal{B}$, which is the smallest subset of gaps in $mathcal{B}$ whose union covers all of the gaps in the output space of a query $Q$. We study how to generate box covers that contain small size certificates to guarantee efficient runtimes for these algorithms. First, given a query $Q$ over a set of relations of size $N$ and a fixed set of domain orderings for the attributes, we give a $ ilde{O}(N)$-time algorithm called GAMB which generates a box cover for $Q$ that is guaranteed to contain the smallest size certificate across any box cover for $Q$. Second, we show that finding a domain ordering to minimize the box cover size and certificate is NP-hard through a reduction from the 2 consecutive block minimization problem on boolean matrices. Our third contribution is a $ ilde{O}(N)$-time approximation algorithm called ADORA to compute domain orderings, under which one can compute a box cover of size $ ilde{O}(K^r)$, where $K$ is the minimum box cover for $Q$ under any domain ordering and $r$ is the maximum arity of any relation. This guarantees certificates of size $ ilde{O}(K^r)$. We combine ADORA and GAMB with Tetris to form a new algorithm we call TetrisReordered, which provides several new beyond worst-case bounds. On infinite families of queries, TetrisReordered's runtimes are unboundedly better than the bounds stated in prior work.

In this paper, we focus on the task of small-footprint keyword spotting under the far-field scenario. Far-field environments are commonly encountered in real-life speech applications, and it causes serve degradation of performance due to room reverberation and various kinds of noises. Our baseline system is built on the convolutional neural network trained with pooled data of both far-field and close-talking speech. To cope with the distortions, we adopt the multi-task learning scheme with alignment loss to reduce the mismatch between the embedding features learned from different domains of data. Experimental results show that our proposed method maintains the performance on close-talking speech and achieves significant improvement on the far-field test set.

In response to the coronavirus disease (COVID-19) outbreak, there is an ever-increasing number of national governments that are rolling out contact-tracing Apps to aid the containment of the virus. The first hugely contentious issue facing the Apps is the deployment framework, i.e. centralised or decentralised. Based on this, the debate branches out to the corresponding technologies that underpin these architectures, i.e. GPS, QR codes, and Bluetooth. This work conducts a pioneering review of the above scenarios and contributes a geolocation mapping of the current deployment. The vulnerabilities and the directions of research are identified, with a special focus on the Bluetooth-based decentralised scheme.

The history of text can be traced back over thousands of years. Rich and precise semantic information carried by text is important in a wide range of vision-based application scenarios. Therefore, text recognition in natural scenes has been an active research field in computer vision and pattern recognition. In recent years, with the rise and development of deep learning, numerous methods have shown promising in terms of innovation, practicality, and efficiency. This paper aims to (1) summarize the fundamental problems and the state-of-the-art associated with scene text recognition; (2) introduce new insights and ideas; (3) provide a comprehensive review of publicly available resources; (4) point out directions for future work. In summary, this literature review attempts to present the entire picture of the field of scene text recognition. It provides a comprehensive reference for people entering this field, and could be helpful to inspire future research. Related resources are available at our Github repository: https://github.com/HCIILAB/Scene-Text-Recognition.

We establish versions of Conley's (i) fundamental theorem and (ii) decomposition theorem for a broad class of hybrid dynamical systems. The hybrid version of (i) asserts that a globally-defined "hybrid complete Lyapunov function" exists for every hybrid system in this class. Motivated by mechanics and control settings where physical or engineered events cause abrupt changes in a system's governing dynamics, our results apply to a large class of Lagrangian hybrid systems (with impacts) studied extensively in the robotics literature. Viewed formally, these results generalize those of Conley and Franks for continuous-time and discrete-time dynamical systems, respectively, on metric spaces. However, we furnish specific examples illustrating how our statement of sufficient conditions represents merely an early step in the longer project of establishing what formal assumptions can and cannot endow hybrid systems models with the topologically well characterized partitions of limit behavior that make Conley's theory so valuable in those classical settings.

Over the years, performance evaluation has become essential in computer vision, enabling tangible progress in many sub-fields. While talking-head video generation has become an emerging research topic, existing evaluations on this topic present many limitations. For example, most approaches use human subjects (e.g., via Amazon MTurk) to evaluate their research claims directly. This subjective evaluation is cumbersome, unreproducible, and may impend the evolution of new research. In this work, we present a carefully-designed benchmark for evaluating talking-head video generation with standardized dataset pre-processing strategies. As for evaluation, we either propose new metrics or select the most appropriate ones to evaluate results in what we consider as desired properties for a good talking-head video, namely, identity preserving, lip synchronization, high video quality, and natural-spontaneous motion. By conducting a thoughtful analysis across several state-of-the-art talking-head generation approaches, we aim to uncover the merits and drawbacks of current methods and point out promising directions for future work. All the evaluation code is available at: https://github.com/lelechen63/talking-head-generation-survey.

Public key encryption with equality test (PKEET) allows testing whether two ciphertexts are generated by the same message or not. PKEET is a potential candidate for many practical applications like efficient data management on encrypted databases. Potential applicability of PKEET leads to intensive research from its first instantiation by Yang et al. (CT-RSA 2010). Most of the followup constructions are secure in the random oracle model. Moreover, the security of all the concrete constructions is based on number-theoretic hardness assumptions which are vulnerable in the post-quantum era. Recently, Lee et al. (ePrint 2016) proposed a generic construction of PKEET schemes in the standard model and hence it is possible to yield the first instantiation of PKEET schemes based on lattices. Their method is to use a $2$-level hierarchical identity-based encryption (HIBE) scheme together with a one-time signature scheme. In this paper, we propose, for the first time, a direct construction of a PKEET scheme based on the hardness assumption of lattices in the standard model. More specifically, the security of the proposed scheme is reduces to the hardness of the Learning With Errors problem.

If you’re looking to grow your business online, it’s time to start setting up different types of website conversions to help your company succeed. Whether you’re looking to earn more email subscribers or sell more products, you can set conversion goals that grow your business. On this page, we’ll discuss what a conversion goal is, […]

The post Going Beyond Sales: 7 Types of Website Conversions to Optimize for on Your Website appeared first on WebFX Blog.

Summer Camps 2020 G-Prep Volleyball Camp A camp run by the Gonzaga Prep coaching staff and college-level guest coaches, offering athletes a solid fundamental base in all aspects of volleyball.…

We've come a long way since the olden days before legalization, when basically the only product on the market was the flower you got from a dealer.…

The CDC designed a flawed test for COVID-19, then took weeks to figure out a fix so state and local labs could use it. New York still doesn’t trust the test’s accuracy By Caroline Chen, Marshall Allen, Lexi Churchill and Isaac Arnsdorf Propublica…

Earlier this morning, Sleater-Kinney announced on Twitter that they're hitting the road on a co-headlining tour with Wilco this summer. Great news!…

The Spokane Comedy Club might be quiet right now, but there are still laughs to be had on Zoom, and not just from watching your co-workers try to navigate the online meeting platform. Saturday night, and again next Saturday, the comedy club is hosting Comedians Doing Comedy: A Virtual Comedy Show.…

Two beloved Spokane-based entertainers are teaming up this weekend for a good cause.…

[IMAGE-1] Crystal Bertholic has been a leader in the region's craft cocktail revival since the beginning. Before she got her start shaking, stirring and straining mixed drinks, Bertholic was steaming milk and roasting coffee; then pouring craft beers.…

[IMAGE-1] Visiting Spokane Valley is a little like when a child visits their grandparents' place: At first you don't understand why you're there, but after you leave with new toys, clothes and a full stomach, you can't wait to go back. And the Spokane Valley Mall has all of that.…

New TV ads that started airing on morning shows throughout the Spokane region are aimed at grocery shoppers, but they're not hawking deals on cabbage or Cap'n Crunch.…

Embodiments relate to a computer implemented information processing system, method and program product for data access. The information processing system includes a data store having a top tier store and at least another tier store with the top tier store including a counter for each entry of a symbol and another tier store including a representative frequency value defined for the another tier store. A sorter is also provided configured to sort the symbol in the top tier store and the another tier stores according to a value generated in the counter for the assessed symbol. The said sorter is also configured to restore entry of the symbol in the top tier store, in response to a symbol having moved from said top tier store to another tier store, by using the representative frequency value defined for said another store to which said symbol was moved.

Methods, systems, and techniques for keyword management are described. Some embodiments provide a keyword management system (“KMS”) configured to determine the effectiveness of multiple candidate keywords. In some embodiments, the KMS generates multiple candidate keywords based on an initial keyword. The KMS may then determine an effectiveness score for each of the candidate keywords, based on marketing information about those keywords. Next, the KMS may process the candidate keywords according to the determined effectiveness scores. In some embodiments, processing the candidate keywords includes applying rules that conditionally perform actions with respect to the candidate keywords, such as modifying advertising expenditures, modifying content, or the like.

An electronic device for text prediction in a virtual keyboard. The device includes a memory including an input determination module for execution by the microprocessor, the input determination module being configured to: receive signals representing input at the virtual keyboard, the virtual keyboard being divided into a plurality of subregions, the plurality of subregions including at least one subregion being associated with two or more characters and/or symbols of the virtual keyboard; identify a subregion on the virtual keyboard corresponding to the input; determine any character or symbol associated with the identified subregion; and if there is at least one determined character or symbol, provide the at least one determined character or symbol to a text prediction algorithm.

To improve the consumer experience with portable electronic devices, a user interface combines the use of capacitive sensors with tactile sensors in an input device. When a user places a finger, stylus, or other input instrument near a given key button, a capacitive sensor causes the display to display temporarily an indication of the function of that key in an enlarged format. The user may then press the associated key button to activate the desired function. In one exemplary embodiment, the capacitive sensor fixes the functionality to the function indicated in the display. In this embodiment, a tactile input applied to any key, whether the correct key, multiple keys, or a single incorrect key, results in activating the function indicated in the display as a result of the capacitive input.

Penoxsulam, 2-(2,2-difluoroethoxy)-N-(5,8-dimethoxy[1,2,4]-triazolo[1,5-c]pyrimidin-2-yl)-6-(trifluoromethyl)benzenesulfonamide, is useful in controlling broadleaf weeds and sedges in turfgrass and in vine and orchard floors.

A method for manufacturing a ceramic honeycomb structure includes kneading titania particles, alumina particles and a binder ingredient such that raw material paste including the titania particles, alumina particles and binder ingredient is prepared, forming a body made of the raw material paste and having a honeycomb structure such that the body has the honeycomb structure having multiple through-holes extending in the longitudinal direction of the body and multiple partition portions formed between the through-holes, applying sealant composition including aluminum hydroxide particles, talc particles, kaolin particles, water and organic binder to either end of each through-hole of the body in the longitudinal direction such that the honeycomb structure of the body has each through-hole sealed at one end, and sintering the body made of the raw material paste and having the honeycomb structure sealed by the sealant composition such that a ceramic body having the honeycomb structure is formed.

A tuning apparatus for a keyboard musical instrument, having a load applicator for applying a load of a predetermined value to a string set up in place, a calculating device for calculating a deviation between a displacement value of the string produced when the load is applied to the string and a preset value of displacement predetermined to give a required frequency of vibration, and a rotating device for turning a tuning pin until the deviation calculated by the calculating device is reduced to zero.

In production of a casein-type artificial key material for keyboard musical instruments, fine grains of an elastomer such as polyurethane elastomer are added to a mixture to be kneaded together so that, in the structure of the product, islanded elastomer is uniformly dispersed in the matrix of casein. Inbred brittleness of casein is much improved by inclusion of the elastomer and strong bond between casein and the elastomer well removes the danger of interface separation.

The present invention discloses a method for displaying individually on a plurality of keys of a keyboard or keypad two or more indicia representing two or more functions performed by each key. The keys are characterized in that each of the two or more indicia is provided on the key in a plurality of separated portions. The portions being positioned in a spaced positioned relationship with one another, so as not to be physically closely juxtaposed. When viewed at a predetermined angle all parts of the indicia are optically juxtaposed to create the entire indicia.

A portable electronic musical device has a keyboard disposed in a housing connected to a strap and a support plate connected thereto for suspension of housing by strap on shoulders of a person while housing is simultaneously supported on waist of person to allow person to easily move from one geographical position to another while playing instrument. Housing is pivotally connected to support plate by at least one member defining an axis around which housing is rotatable to playing of instrument and to facilitate viewing of hands of person and keys of keyboard while user is playing instrument. To further facilitate playing of instrument and visibility of hands and keys housing is curved with keyboard generally aligned therewith.