Sets of multiplicity and closable multipliers on group algebras

We undertake a detailed study of the sets of multiplicity in a second countable locally compact group G and their operator versions. We establish a symbolic calculus for normal completely bounded maps from the space B(L-2(G)) of bounded linear operators on L-2 (G) into the von Neumann algebra VN(G) of G and use it to show that a closed subset E subset of G is a set of multiplicity if and only if the set E* = {(s,t) is an element of G x G : ts(-1) is an element of E} is a set of operator multiplicity. Analogous results are established for M-1-sets and M-0-sets. We show that the property of being a set of multiplicity is preserved under various operations, including taking direct products, and establish an Inverse Image Theorem for such sets. We characterise the sets of finite width that are also sets of operator multiplicity, and show that every compact operator supported on a set of finite width can be approximated by sums of rank one operators supported on the same set. We show that, if G satisfies a mild approximation condition, pointwise multiplication by a given measurable function psi : G -> C defines a closable multiplier on the reduced C*-algebra G(r)*(G) of G if and only if Schur multiplication by the function N(psi): G x G -> C, given by N(psi)(s, t) = psi(ts(-1)), is a closable operator when viewed as a densely defined linear map on the space of compact operators on L-2(G). Similar results are obtained for multipliers on VN(C).

Math 412 - Topology with Applications

Highlights of Data Expedition: • Students explored daily observations of local climate data spanning the past 35 years. • Topological Data Analysis, or TDA for short, provides cutting-edge tools for studying the geometry of data in arbitrarily high dimensions. • Using TDA tools, students discovered intrinsic dynamical features of the data and learned how to quantify periodic phenomenon in a time-series. • Since nature invariably produces noisy data which rarely has exact periodicity, students also considered the theoretical basis of almost-periodicity and even invented and tested new mathematical definitions of almost-periodic functions. Summary The dataset we used for this data expedition comes from the Global Historical Climatology Network. “GHCN (Global Historical Climatology Network)-Daily is an integrated database of daily climate summaries from land surface stations across the globe.” Source: https://www.ncdc.noaa.gov/oa/climate/ghcn-daily/ We focused on the daily maximum and minimum temperatures from January 1, 1980 to April 1, 2015 collected from RDU International Airport. Through a guided series of exercises designed to be performed in Matlab, students explore these time-series, initially by direct visualization and basic statistical techniques. Then students are guided through a special sliding-window construction which transforms a time-series into a high-dimensional geometric curve. These high-dimensional curves can be visualized by projecting down to lower dimensions as in the figure below (Figure 1), however, our focus here was to use persistent homology to directly study the high-dimensional embedding. The shape of these curves has meaningful information but how one describes the “shape” of data depends on which scale the data is being considered. However, choosing the appropriate scale is rarely an obvious choice. Persistent homology overcomes this obstacle by allowing us to quantitatively study geometric features of the data across multiple-scales. Through this data expedition, students are introduced to numerically computing persistent homology using the rips collapse algorithm and interpreting the results. In the specific context of sliding-window constructions, 1-dimensional persistent homology can reveal the nature of periodic structure in the original data. I created a special technique to study how these high-dimensional sliding-window curves form loops in order to quantify the periodicity. Students are guided through this construction and learn how to visualize and interpret this information. Climate data is extremely complex (as anyone who has suffered from a bad weather prediction can attest) and numerous variables play a role in determining our daily weather and temperatures. This complexity coupled with imperfections of measuring devices results in very noisy data. This causes the annual seasonal periodicity to be far from exact. To this end, I have students explore existing theoretical notions of almost-periodicity and test it on the data. They find that some existing definitions are also inadequate in this context. Hence I challenged them to invent new mathematics by proposing and testing their own definition. These students rose to the challenge and suggested a number of creative definitions. While autocorrelation and spectral methods based on Fourier analysis are often used to explore periodicity, the construction here provides an alternative paradigm to quantify periodic structure in almost-periodic signals using tools from topological data analysis.

Inhibition of p38 pathway leads to OA-like changes in a rat animal model

Objectives The p38 mitogen-activated protein kinase (MAPK) signal transduction pathway is involved in a variety of inflammatory responses, including cytokine generation, cell differentiation proliferation and apoptosis. Here, we examined the effects of systemic p38 MAPK inhibition on cartilage cells and osteoarthritis (OA) disease progression by both in vitro and in vivo approaches. Methods p38 kinase activity was evaluated in normal and OA cartilage cells by measuring the amount of phosphorylated protein. To examine the function of p38 signaling pathway in vitro, normal chondrocytes were isolated and differentiated in the presence or absence of p38 inhibitor; SB203580 and analysed for chondrogenic phenotype. Effect of systemic p38 MAPK inhibition in normal and OA (induced by menisectomy) rats were analysed by treating animals with vehicle alone (DMS0) or p38 inhibitor (SB203580). Damage to the femur and tibial plateau was evaluated by modified Mankin score, histology and immunohistochemistry. Results Our in vitro studies have revealed that a down-regulation of chondrogenic and increase of hypertrophic gene expression occurs in the normal chondrocytes, when p38 is neutralized by a pharmacological inhibitor. We further observed that the basal levels of p38 phosphorylation were decreased in OA chondrocytes compared with normal chondrocytes. These findings together indicate the importance of this pathway in the regulation of cartilage physiology and its relevance to OA pathogenesis. At in vivo level, systematic administration of a specific p38 MAPK inhibitor, SB203580, continuously for over a month led to a significant loss of proteoglycan; aggrecan and cartilage thickness. On the other hand, SB203580 treated normal rats showed a significant increase in TUNEL positive cells, cartilage hypertrophy markers such as Type 10 collagen, Runt-related transcription factor and Matrix metalloproteinase-13 and substantially induced OA like phenotypic changes in the normal rats. In addition, menisectomy induced OA rat models that were treated with p38 inhibitor showed aggravation of cartilage damage. Conclusions In summary, this study has provided evidence that the component of the p38 MAPK pathway is important to maintain the cartilage health and its inhibition can lead to severe cartilage degenerative changes. The observations in this study highlight the possibility of using activators of the p38 pathway as an alternative approach in the treatment of OA.

‘Wanna do more math’: engaging underachieving Indigenous learners the YuMi Deadly way.

The Accelerating Indigenous Mathematics (AIM) Program offered by the YuMi Deadly Centre from QUT accelerates the mathematics learning of underperforming students in Years 8 - 10 by a) apportioning Years 2-10 Australian Curriculum: Mathematics content into three years, and b) provides a teaching approach that accelerates the mathematical learning. The philosophy of the YuMi Deadly teaching approach for mathematics is one that requires a ‘body’, ‘hand’, ‘mind’ pedagogy. This presentation will provide examples of the “‘body’, ‘hand’, ‘mind’” mathematics pedagogy. In AIM classrooms, mathematics is presented this approach is having a positive impact. Students are willing ‘to have a go’ without shame; and they develop the desire to learn and improve their numeracy.

Heb. U. (Hebrew University) - Einstein Math.

Digital image

Discovering Math APIs by Mining Unit Tests

In today's API-rich world, programmer productivity depends heavily on the programmer's ability to discover the required APIs. In this paper, we present a technique and tool, called MATHFINDER, to discover APIs for mathematical computations by mining unit tests of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code to compute the expression by mapping its subexpressions to API method calls. For each subexpression, MATHFINDER searches for a method such that there is a mapping between method inputs and variables of the subexpression. The subexpression, when evaluated on the test inputs of the method under this mapping, should produce results that match the method output on a large number of tests. We implemented MATHFINDER as an Eclipse plugin for discovery of third-party Java APIs and performed a user study to evaluate its effectiveness. In the study, the use of MATHFINDER resulted in a 2x improvement in programmer productivity. In 96% of the subexpressions queried for in the study, MATHFINDER retrieved the desired API methods as the top-most result. The top-most pseudo-code snippet to implement the entire expression was correct in 93% of the cases. Since the number of methods and unit tests to mine could be large in practice, we also implement MATHFINDER in a MapReduce framework and evaluate its scalability and response time.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.

Dos inscripciones funerarias y una estela oikomorfa en Oña (Burgos)

Edición de dos inscripciones inéditas de Oña (Burgos) y una estela oikomorfa de Poza de la Sal(Burgos)

一个面向OA的印刷汉字OCR实用系统

本文叙述一个采取以“统计模式识别”为主,以“结构模式识别”方法为辅的识别技术路线实现的以办公室自动化(OA)为应用环境的一级印刷汉字文本识别系统。该系统从实用化角度出发,采用页式文本图象扫描输入。输入后将图象文本分割成单个汉字,并根据汉字的结构特点,抽取了汉字的内层,外层,局部等多个特征。识别采用多级分类方法。识别结果形成一个国标区位码文件。系统软件建立了一种与用户间的友好界面。该系统是在IBM PC/XT上实现的,对印刷字样识别率>99％,对各类实际的办公行文其统计识别率>95％,识别速度为1～2字/秒。