Primer registro de Amana angulifera Walker, 1855 (Lepidoptera: Epicopeiidae) en la India desde el siglo XIX

Amana angulifera Walker, 1855, a diurnal moth belonging to the family Epicopeiidae, was described from India based on a previously collected specimen. Though type locality was omitted in the original description, in the last decade of the 19th century, the habitat of the moth was mentioned to be Khasi Hills of the present Meghalaya state of India. It is also recorded from Yunnan in southern part of China. After a gap of more than a century, this paper reports the presence of the species again from India, this time in the Himalayan state of Arunachal Pradesh, bordering China, filling a sampling gap within its distribution range. Further study of the moth in this region is recommended to fill the sampling gaps and assess its life cycle, population trends, abundance, phenological responses and inter-specific interactions with plants so that conservation measures may be taken up accordingly.Amana angulifera Walker, 1855, polilla diurna perteneciente a la familia Epicopeiidae, fue descrita en la India a partir de un espécimen anterior, a mediados del siglo XIX. Aunque la localidad tipo se omitió en la descripción original, en la última década del siglo XIX, se estableció que el hábitat de la polilla se situaba en las colinas Khasi del actual estado indio de Meghalaya. No obstante, durante esta década también fue registrada en Yunnan, al sur de China. Tras un intervalo de más de un siglo sin registros en la India, este trabajo presenta evidencias de la existencia de esta polilla en el estado himalayo de Arunachal Pradesh, fronterizo con China, llenando así un vacío de muestreo de décadas en su área de distribución. A partir de este hallazgo, se están llevado a cabo estudios en esta región con el fin de evaluar el ciclo vital, tendencias poblacionales, abundancia, respuestas fenológicas e interacciones interespecíficas de esta polilla con las plantas, de modo que puedan tomarse las consecuentes medidas de conservación

Climate Change and the Response of Food Truck Industry: A Study on Vancouver Visitors’ Destination

Abstract Climate change is one of today’s major challenges to the tourism sector and its subsectors, such as the food truck industry. The purpose of this study is to determine how food trucks in Vancouver, Canada are responding to climate change. Previous literature on tourism and climate change have mainly focused on accommodation sectors, nature based tourism operators, and winter tourism activities. However, there is a dearth of empirical studies on climate change perceptions and adoption in food truck operations across North America especially from Vancouver context. Therefore, this study will explore to which extent food truck industries are aware of climate change issues in their day-to-day operations, and how they are strategically responding to the change. A qualitative approach (semi-structured interviews) will be employed to collect data from a sample of food truck operators in Vancouver, one of the most popular visitor destinations in Canada

On the generalized weighted Sobolev inequality

Let $\Omega$ be an open subset of $\mathbb{R}^N.$ We identify various classes of Young functions $\Phi,\,\Psi$, and weight functions $g\in L^1_\text{loc}(\Omega)$ so that the following generalized weighted Sobolev inequality holds: \begin{equation*}\label{ineq:Orlicz} \Psi^{-1}\left(\int_{\Omega}|g(x)|\Psi( |u(x)| )dx \right)\leq C\Phi^{-1}\left(\int_{\Omega}\Phi(|\nabla u(x)|) dx \right),\,\,\,\forall\,u\in \mathcal{C}^1_c(\Omega), \end{equation*} for some $C>0$. As an application, we study the existence of non-negative solutions for certain nonlinear weighted eigenvalue problems.Comment: 27 page

Symbolic Execution for Randomized Programs

We propose a symbolic execution method for programs that can draw random samples. In contrast to existing work, our method can verify randomized programs with unknown inputs and can prove probabilistic properties that universally quantify over all possible inputs. Our technique augments standard symbolic execution with a new class of \emph{probabilistic symbolic variables}, which represent the results of random draws, and computes symbolic expressions representing the probability of taking individual paths. We implement our method on top of the \textsc{KLEE} symbolic execution engine alongside multiple optimizations and use it to prove properties about probabilities and expected values for a range of challenging case studies written in C++, including Freivalds' algorithm, randomized quicksort, and a randomized property-testing algorithm for monotonicity. We evaluate our method against \textsc{Psi}, an exact probabilistic symbolic inference engine, and \textsc{Storm}, a probabilistic model checker, and show that our method significantly outperforms both tools.Comment: 47 pages, 9 figures, to appear at OOPSLA 202