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.

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.

In this article, we prove that the completeness of the Hamilton flow and essential self-dajointness are equivalent for real principal type operators on the circle. Moreover, we study spectral properties of these operators.

Let $k ,=, mathbb{Q}(sqrt[5]{n},zeta_5)$, where $n$ is a positive integer, $5^{th}$ power-free, whose $5-$class group is isomorphic to $mathbb{Z}/5mathbb{Z} imesmathbb{Z}/5mathbb{Z}$. Let $k_0,=,mathbb{Q}(zeta_5)$ be the cyclotomic field containing a primitive $5^{th}$ root of unity $zeta_5$. Let $C_{k,5}^{(sigma)}$ the group of the ambiguous classes under the action of $Gal(k/k_0)$ = $<sigma>$. The aim of this paper is to determine all integers $n$ such that the group of ambiguous classes $C_{k,5}^{(sigma)}$ has rank $1$ or $2$.

We show that the local equivalence class of the collapsed link Floer complex $cCFL^infty(L)$, together with many $Upsilon$-type invariants extracted from this group, is a concordance invariant of links. In particular, we define a version of the invariants $Upsilon_L(t)$ and $ u^+(L)$ when $L$ is a link and we prove that they give a lower bound for the slice genus $g_4(L)$. Furthermore, in the last section of the paper we study the homology group $HFL'(L)$ and its behaviour under unoriented cobordisms. We obtain that a normalized version of the $upsilon$-set, introduced by Ozsv'ath, Stipsicz and Szab'o, produces a lower bound for the 4-dimensional smooth crosscap number $gamma_4(L)$.

Let $chi_{Delta}(mathbb{R}^{n})$ denote the minimum number of colors needed to color $mathbb{R}^{n}$ so that there will not be a monochromatic equilateral triangle with side length $1$. Using the slice rank method, we reprove a result of Frankl and Rodl, and show that $chi_{Delta}left(mathbb{R}^{n} ight)$ grows exponentially with $n$. This technique substantially improves upon the best known quantitative lower bounds for $chi_{Delta}left(mathbb{R}^{n} ight)$, and we obtain [ chi_{Delta}left(mathbb{R}^{n} ight)>(1.01446+o(1))^{n}. ]

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.

We study an equivariant extension of the Batalin-Vilkovisky formalism for quantizing gauge theories. Namely, we introduce a general framework to encompass failures of the quantum master equation, and we apply it to the natural equivariant extension of AKSZ solutions of the classical master equation (CME). As examples of the construction, we recover the equivariant extension of supersymmetric Yang-Mills in 2d and of Donaldson-Witten theory.

In this paper, we are concerned with the numerical solution of one type integro-differential equation by a probability method based on the fundamental martingale of mixed Gaussian processes. As an application, we will try to simulate the estimation of ruin probability with an unknown parameter driven not by the classical L'evy process but by the mixed fractional Brownian motion.

Let $X$ (resp. $Y$) be a curve of genus 1 (resp. 2) over a base field $k$ whose characteristic does not equal 2. We give criteria for the existence of a curve $Z$ over $k$ whose Jacobian is up to twist (2,2,2)-isogenous to the products of the Jacobians of $X$ and $Y$. Moreover, we give algorithms to construct the curve $Z$ once equations for $X$ and $Y$ are given. The first of these involves the use of hyperplane sections of the Kummer variety of $Y$ whose desingularization is isomorphic to $X$, whereas the second is based on interpolation methods involving numerical results over $mathbb{C}$ that are proved to be correct over general fields a posteriori. As an application, we find a twist of a Jacobian over $mathbb{Q}$ that admits a rational 70-torsion point.

We develop a distributional framework for the shearlet transform $mathcal{S}_{psi}colonmathcal{S}_0(mathbb{R}^2) omathcal{S}(mathbb{S})$ and the shearlet synthesis operator $mathcal{S}^t_{psi}colonmathcal{S}(mathbb{S}) omathcal{S}_0(mathbb{R}^2)$, where $mathcal{S}_0(mathbb{R}^2)$ is the Lizorkin test function space and $mathcal{S}(mathbb{S})$ is the space of highly localized test functions on the standard shearlet group $mathbb{S}$. These spaces and their duals $mathcal{S}_0^prime (mathbb R^2),, mathcal{S}^prime (mathbb{S})$ are called Lizorkin type spaces of test functions and distributions. We analyze the continuity properties of these transforms when the admissible vector $psi$ belongs to $mathcal{S}_0(mathbb{R}^2)$. Then, we define the shearlet transform and the shearlet synthesis operator of Lizorkin type distributions as transpose mappings of the shearlet synthesis operator and the shearlet transform, respectively. They yield continuous mappings from $mathcal{S}_0^prime (mathbb R^2)$ to $mathcal{S}^prime (mathbb{S})$ and from $mathcal{S}^prime (mathbb S)$ to $mathcal{S}_0^prime (mathbb{R}^2)$. Furthermore, we show the consistency of our definition with the shearlet transform defined by direct evaluation of a distribution on the shearlets. The same can be done for the shearlet synthesis operator. Finally, we give a reconstruction formula for Lizorkin type distributions, from which follows that the action of such generalized functions can be written as an absolutely convergent integral over the standard shearlet group.

We consider the most general class of linear inhomogeneous boundary-value problems for systems of ordinary differential equations of an arbitrary order whose solutions and right-hand sides belong to appropriate Sobolev spaces. For parameter-dependent problems from this class, we prove a constructive criterion for their solutions to be continuous in the Sobolev space with respect to the parameter. We also prove a two-sided estimate for the degree of convergence of these solutions to the solution of the nonperturbed problem.

In this paper we construct an equivariant embedding of the affine space $mathbb{A}^n$ with the translation group action into a complete non-projective algebraic variety $X$ for all $n geq 3$. The theory of toric varieties is used as the main tool for this construction. In the case of $n = 3$ we describe the orbit structure on the variety $X$.

In this short note we give a proof of the famous conjecture of Erd"{o}s-Straus for the case $nequiv13 extrm{ mod } 24.$ The Erd"{o}s--Straus conjecture states that the equation $frac{4}{n}=frac{1}{x}+frac{1}{y}+frac{1}{z}$ has positive integer solutions $x,y,z$ for every $ngeq 2$. It is open for $nequiv 1 extrm{ mod } 12$. Indeed, in all of the other cases the solutions are always easy to find. We prove that the conjecture is true for every $nequiv 13 extrm{ mod } 24$. Therefore, to solve it completely, it remains to find solutions for every $nequiv 1 extrm{ mod } 24$.

We prove that all non-degenerate relative equilibria of the planar Newtonian $n$--body problem can be continued to spaces of constant curvature $kappa$, positive or negative, for small enough values of this parameter. We also compute the extension of some classical relative equilibria to curved spaces using numerical continuation. In particular, we extend Lagrange's triangle configuration with different masses to both positive and negative curvature spaces.

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

In this paper we prove that any odd multigrid with non-zero rational offsets is regular, which means that its dual is a rhombic tiling. To prove this result we use a result on trigonometric diophantine equations.

Introduction of spectrum-sharing in 5G and subsequent generation networks demand base-station(s) with the capability to characterize the wideband spectrum spanned over licensed, shared and unlicensed non-contiguous frequency bands. Spectrum characterization involves the identification of vacant bands along with center frequency and parameters (energy, modulation, etc.) of occupied bands. Such characterization at Nyquist sampling is area and power-hungry due to the need for high-speed digitization. Though sub-Nyquist sampling (SNS) offers an excellent alternative when the spectrum is sparse, it suffers from poor performance at low signal to noise ratio (SNR) and demands careful design and integration of digital reconstruction, tunable channelizer and characterization algorithms. In this paper, we propose a novel deep-learning framework via a single unified pipeline to accomplish two tasks: 1)~Reconstruct the signal directly from sub-Nyquist samples, and 2)~Wideband spectrum characterization. The proposed approach eliminates the need for complex signal conditioning between reconstruction and characterization and does not need complex tunable channelizers. We extensively compare the performance of our framework for a wide range of modulation schemes, SNR and channel conditions. We show that the proposed framework outperforms existing SNS based approaches and characterization performance approaches to Nyquist sampling-based framework with an increase in SNR. Easy to design and integrate along with a single unified deep learning framework make the proposed architecture a good candidate for reconfigurable platforms.

For Convolutional Neural Network-based object detection, there is a typical dilemma: the spatial information is well kept in the shallow layers which unfortunately do not have enough semantic information, while the deep layers have a high semantic concept but lost a lot of spatial information, resulting in serious information imbalance. To acquire enough semantic information for shallow layers, Feature Pyramid Networks (FPN) is used to build a top-down propagated path. In this paper, except for top-down combining of information for shallow layers, we propose a novel network called Image Pyramid Guidance Network (IPG-Net) to make sure both the spatial information and semantic information are abundant for each layer. Our IPG-Net has two main parts: the image pyramid guidance transformation module and the image pyramid guidance fusion module. Our main idea is to introduce the image pyramid guidance into the backbone stream to solve the information imbalance problem, which alleviates the vanishment of the small object features. This IPG transformation module promises even in the deepest stage of the backbone, there is enough spatial information for bounding box regression and classification. Furthermore, we designed an effective fusion module to fuse the features from the image pyramid and features from the backbone stream. We have tried to apply this novel network to both one-stage and two-stage detection models, state of the art results are obtained on the most popular benchmark data sets, i.e. MS COCO and Pascal VOC.

To implement a blockchain, we need a blockchain protocol for all the nodes to follow. To design a blockchain protocol, we need a block publisher selection mechanism and a chain selection rule. In Proof-of-Stake (PoS) based blockchain protocols, block publisher selection mechanism selects the node to publish the next block based on the relative stake held by the node. However, PoS protocols may face vulnerability to fully adaptive corruptions. In literature, researchers address this issue at the cost of performance.

In this paper, we propose a novel PoS-based blockchain protocol, QuickSync, to achieve security against fully adaptive corruptions without compromising on performance. We propose a metric called block power, a value defined for each block, derived from the output of the verifiable random function based on the digital signature of the block publisher. With this metric, we compute chain power, the sum of block powers of all the blocks comprising the chain, for all the valid chains. These metrics are a function of the block publisher's stake to enable the PoS aspect of the protocol. The chain selection rule selects the chain with the highest chain power as the one to extend. This chain selection rule hence determines the selected block publisher of the previous block. When we use metrics to define the chain selection rule, it may lead to vulnerabilities against Sybil attacks. QuickSync uses a Sybil attack resistant function implemented using histogram matching. We prove that QuickSync satisfies common prefix, chain growth, and chain quality properties and hence it is secure. We also show that it is resilient to different types of adversarial attack strategies. Our analysis demonstrates that QuickSync performs better than Bitcoin by an order of magnitude on both transactions per second and time to finality, and better than Ouroboros v1 by a factor of three on time to finality.

In this paper, we present three distributed algorithms to solve a class of generalized Nash equilibrium (GNE) seeking problems in strongly monotone games. The first one (SD-GENO) is based on synchronous updates of the agents, while the second and the third (AD-GEED and AD-GENO) represent asynchronous solutions that are robust to communication delays. AD-GENO can be seen as a refinement of AD-GEED, since it only requires node auxiliary variables, enhancing the scalability of the algorithm. Our main contribution is to prove converge to a variational GNE of the game via an operator-theoretic approach. Finally, we apply the algorithms to network Cournot games and show how different activation sequences and delays affect convergence. We also compare the proposed algorithms to the only other in the literature (ADAGNES), and observe that AD-GENO outperforms the alternative.

The patterns in which the syntax of different languages converges and diverges are often used to inform work on cross-lingual transfer. Nevertheless, little empirical work has been done on quantifying the prevalence of different syntactic divergences across language pairs. We propose a framework for extracting divergence patterns for any language pair from a parallel corpus, building on Universal Dependencies. We show that our framework provides a detailed picture of cross-language divergences, generalizes previous approaches, and lends itself to full automation. We further present a novel dataset, a manually word-aligned subset of the Parallel UD corpus in five languages, and use it to perform a detailed corpus study. We demonstrate the usefulness of the resulting analysis by showing that it can help account for performance patterns of a cross-lingual parser.

Moving a module in a modular robot is a very complex and error-prone process. Unlike in swarm, in the modular robots we are targeting, the moving module must keep the connection to, at least, one other module. In order to miniaturize each module to few millimeters, we have proposed a design which is using electrostatic actuator. However, this movement is composed of several attachment, detachment creating the movement and each small step can fail causing a module to break the connection. The idea developed in this paper consists in creating a new kind of deformable module allowing a movement which keeps the connection between the moving and the fixed modules. We detail the geometry and the practical constraints during the conception of this new module. We then validate the possibility of movement for a module in an existing configuration. This implies the cooperation of some of the modules placed along the path and we show in simulation that it exists a motion process to reach every free positions of the surface for a given configuration.

We propose Cotatron, a transcription-guided speech encoder for speaker-independent linguistic representation. Cotatron is based on the multispeaker TTS architecture and can be trained with conventional TTS datasets. We train a voice conversion system to reconstruct speech with Cotatron features, which is similar to the previous methods based on Phonetic Posteriorgram (PPG). By training and evaluating our system with 108 speakers from the VCTK dataset, we outperform the previous method in terms of both naturalness and speaker similarity. Our system can also convert speech from speakers that are unseen during training, and utilize ASR to automate the transcription with minimal reduction of the performance. Audio samples are available at https://mindslab-ai.github.io/cotatron, and the code with a pre-trained model will be made available soon.

Chest computed tomography (CT) becomes an effective tool to assist the diagnosis of coronavirus disease-19 (COVID-19). Due to the outbreak of COVID-19 worldwide, using the computed-aided diagnosis technique for COVID-19 classification based on CT images could largely alleviate the burden of clinicians. In this paper, we propose an Adaptive Feature Selection guided Deep Forest (AFS-DF) for COVID-19 classification based on chest CT images. Specifically, we first extract location-specific features from CT images. Then, in order to capture the high-level representation of these features with the relatively small-scale data, we leverage a deep forest model to learn high-level representation of the features. Moreover, we propose a feature selection method based on the trained deep forest model to reduce the redundancy of features, where the feature selection could be adaptively incorporated with the COVID-19 classification model. We evaluated our proposed AFS-DF on COVID-19 dataset with 1495 patients of COVID-19 and 1027 patients of community acquired pneumonia (CAP). The accuracy (ACC), sensitivity (SEN), specificity (SPE) and AUC achieved by our method are 91.79%, 93.05%, 89.95% and 96.35%, respectively. Experimental results on the COVID-19 dataset suggest that the proposed AFS-DF achieves superior performance in COVID-19 vs. CAP classification, compared with 4 widely used machine learning methods.

The de Bruijn graph, its sequences, and their various generalizations, have found many applications in information theory, including many new ones in the last decade. In this paper, motivated by a coding problem for emerging memory technologies, a set of sequences which generalize sequences in the de Bruijn graph are defined. These sequences can be also defined and viewed as constrained sequences. Hence, they will be called constrained de Bruijn sequences and a set of such sequences will be called a constrained de Bruijn code. Several properties and alternative definitions for such codes are examined and they are analyzed as generalized sequences in the de Bruijn graph (and its generalization) and as constrained sequences. Various enumeration techniques are used to compute the total number of sequences for any given set of parameters. A construction method of such codes from the theory of shift-register sequences is proposed. Finally, we show how these constrained de Bruijn sequences and codes can be applied in constructions of codes for correcting synchronization errors in the $ell$-symbol read channel and in the racetrack memory channel. For this purpose, these codes are superior in their size on previously known codes.

In this paper, we continue our prior work on using imitation learning (IL) and model free reinforcement learning (RL) to learn driving policies for autonomous driving in urban scenarios, by introducing a model based RL method to drive the autonomous vehicle in the Carla urban driving simulator. Although IL and model free RL methods have been proved to be capable of solving lots of challenging tasks, including playing video games, robots, and, in our prior work, urban driving, the low sample efficiency of such methods greatly limits their applications on actual autonomous driving. In this work, we developed a model based RL algorithm of guided policy search (GPS) for urban driving tasks. The algorithm iteratively learns a parameterized dynamic model to approximate the complex and interactive driving task, and optimizes the driving policy under the nonlinear approximate dynamic model. As a model based RL approach, when applied in urban autonomous driving, the GPS has the advantages of higher sample efficiency, better interpretability, and greater stability. We provide extensive experiments validating the effectiveness of the proposed method to learn robust driving policy for urban driving in Carla. We also compare the proposed method with other policy search and model free RL baselines, showing 100x better sample efficiency of the GPS based RL method, and also that the GPS based method can learn policies for harder tasks that the baseline methods can hardly learn.

What Is Real-Time Conversation Analytics?

In contrast to post-call conversation analytics, which provides insights after the fact, real-time call conversation analytics can point them out at present times.

In this blog, I will walk through the essential steps to build a web app that can analyze call conversations in real-time to assist an agent. Once we’re finished, we’ll have an app which will:

Flexbox is not a single property; it's a complete module that comes with a number of features. In this article, we will look at a complete guide for CSS Flexbox.

Before going into detail, I just want to answer why we should use flexbox layout instead of a traditional way of doing layout webpage using display properties, float properties, positional properties

The Cannabis Issue People have been enjoying cannabis for recreational purposes for centuries, including in the United States since the early 1900s. That means weed was in America a good 50 years or so before the invention of rock 'n' roll.…

Summer Camps 2020 "Regional Summer Camps Hope the Pandemic Doesn't Put Activities on Pause, But Have Backup Plans Ready if it Does" …

Coronavirus Family Tree The University of Washington Virology lab, which is testing samples for coronavirus, tweeted last night.…

Back in November, we wrote about local singer-songwriter Eliza Johnson's musical project Eliza Catastrophe and her new album You, which she released on pre-loaded MP3 players. One thing we weren't able to mention in our interview — for contractual reasons — is that she had only a couple months prior auditioned for American Idol, and her performance finally aired on the ABC reality competition show Sunday night.…

Thirty years into his distinguished career as one of the world's great guitar players, Joe Bonamassa is still finding new ways to showcase his skills, explore new sounds and stretch his artistic horizons.…

Jenny Don't and the Spurs were right in the middle of recording their third full-length album when a vocal polyp put a halt to the process.…

Put pictures of 1975-era Aerosmith and 1995-era Guided By Voices next to each other and you probably wouldn’t think the bands have anything in common.…

ON INLANDER.COM NATION: Even as U.S. President Donald Trump urges states to reopen their economies, his own administration projects that the death toll from COVID-19 will spike to 3,000 people per day.…

Cops are hackers now, too.…

ON INLANDER.COM COVER: While Washington state forges alliances, Idaho battles coronavirus its own way.…

What do Arabian horses, women veterans, ceramics and the food industry have in common?…

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

Techniques for evaluation and/or retraining of a classification model built using labeled training data. In some aspects, a classification model having a first set of weights is retrained by using unlabeled input to reweight the labeled training data to have a second set of weights, and by retraining the classification model using the labeled training data weighted according to the second set of weights. In some aspects, a classification model is evaluated by building a similarity model that represents similarities between unlabeled input and the labeled training data and using the similarity model to evaluate the labeled training data to identify a subset of the plurality of items of labeled training data that is more similar to the unlabeled input than a remainder of the labeled training data.

Systems and methods are disclosed that may be implemented for network management system (NMS) configuration management support for network devices using a learning and natural language processing application to capture the usage and behavior of the Command Line Interface (CLI) of a network device with the aid of a CLI knowledge model, which in one example may be ontology-based.

Methods, systems, and computer-readable media for providing topical search suggestions are provided. Topical search suggestions allow a user to receive search results related to the designated topic or subject matter. The present invention may generate multiple topics based on search input provided by a user. The search input may be a search prefix that includes one or more words entered into the search query box before the completed search query is submitted to the search engine. A search interface then presents the topics derived from the search prefix to a user before the user submits the query. In another embodiment, the user designates multiple search inputs. The present invention generates search results based on the search inputs and then presents topics extracted from the search results. In one embodiment, the topics are extracted by performing a natural language analysis of search result metadata.

The invention discloses quinoxaline derivatives or salts thereof having PDE9-inhibiting activity and being useful as treating agent of dysuria and the like, which are represented by the formula (I) in the formula, R1 and R2 each independently stands for hydrogen, halogen, alkyl, alkoxy, acyl, amino and the like,R3 stands for alkyl, aryl, saturated carbocyclic group, saturated heterocyclic group, acyl and the like,R4 stands for hydrogen, hydroxy, alkyl or amino,R5 and R8 each independently stands for hydrogen, halogen, alkyl, alkenyl, alkoxy, cyano or nitro,R6 and R7 each independently stands for hydrogen, halogen, alkyl, alkenyl, alkynyl, alkoxy, cyano, amino, carbocyclic group, heterocyclic group, COR9 or SO2R9,R9 stands for hydrogen, hydroxy, alkyl, amino, pyrrolidin-1-yl, piperidin-1-yl, pyperazin-1-yl or the like,X stands for S or O, andA1, A2 and A3 each independently stands for N or C.

The invention relates to quinazoline derivatives of formula (I), wherein m is an integer from 1 to 3; R1 represents halogeno or C1-3alkyl; X1 represents —O—; R2 is selected from one of the following three groups: 1) C1-5alkylR3, wherein R3 is piperidinyl-4-yl which may bear one or two substituents selected from hydroxy, halogeno, C1-4alkyl, C1-4hydroxyalkyl and C1-4alkoxy; 2) C2-5alkenylR3, wherein R3 is as defined herein; 3) C2-5alkynylR3, wherein R3 is as defined herein; and wherein any alkyl, alkenyl or alkynyl group may bear one or more substituents selected from hydroxy, halogeno and amino; and salts thereof; processes for their preparation; pharmaceutical compositions containing a compound of formula (I) or a pharmaceutically acceptable salt thereof as an active ingredient.

A process to prepare an improved fluid rare earth phosphate catalyst composition useful in preparing alkylene oxide adducts of organic compounds having active hydrogen atoms is provided. The catalyst is prepared by dissolving a rare earth salt in a C9-C30 active hydrogen containing organic compound and then adding phosphoric acid to the organic compound rare earth mixture.

Provided is a light-emitting glass which is applicable to, e.g., white illuminators including a light-emitting diode as a light source, and which emits light of a warm white color when irradiated with near ultraviolet light and combines long-term weatherability with high heat resistance; a light-emitting device containing same and a process for producing same. The light-emitting glass includes, as the base glass, borosilicate or silicate glass having a separated-phase structure, whereby the base glass is efficiently doped with, for example, transition metal ion clusters which emit light of a warm white color upon irradiation with near ultraviolet light. With this glass, it is possible to attain increases in excitation wavelength and emission wavelength. The glass thus emits, based on a multiple scattering effect, high-intensity light of a warm white color upon irradiation with near ultraviolet light.