Meteorological and chemical factors controlling ozone formation in Seoul during MAPS-Seoul 2015

To understand the chemical mechanisms of controlling factors in ozone (O3) formation in early summer in Seoul, a comprehensive study encompassing measurement and modeling was conducted under the Megacity Air Pollution Study-Seoul (MAPS-Seoul) campaign. From May 18 to June 12, 2015, O3 and peroxyacetyl nitrate (PAN) were measured, along with their precursors, including NOx and volatile organic compounds (VOCs), at the Korea Institute of Science and Technology, located in northeast Seoul. VOCs were sampled in a canister twice a day (at 09:30 and 15:00) and analyzed via gas chromatography. The meteorological conditions and chemical regimes of the air masses were clearly distinguished during the study period. In May, NOx concentrations were higher with more pronounced diurnal cycles of precursors and O3 under constant westerly winds. By contrast, stagnant conditions developed in June, which reduced the inflow of primary emissions from the downtown area but increased the influence from the neighboring forest under high temperatures. As a result, the ratio of O3 to odd oxygen was higher in June, indicating a less efficient removal of O3 by NOx. In the same context, the air mass was chemically more aged with a higher NO2/NOx ratio and enhanced OH reactivity of oxygenated and biogenic VOCs in June. The overall measurement results suggest that O3 formation is slightly more sensitive to VOCs than to NOx in Seoul during this season, when O3 concentrations are the highest of the year

Reducing UK-means to k-means

This paper proposes an optimisation to the UK-means algorithm, which generalises the k-means algorithm to handle objects whose locations are uncertain. The location of each object is described by a probability density function (pdf). The UK-means algorithm needs to compute expected distances (EDs) between each object and the cluster representatives. The evaluation of ED from first principles is very costly operation, because the pdf's are different and arbitrary. But UK-means needs to evaluate a lot of EDs. This is a major performance burden of the algorithm. In this paper, we derive a formula for evaluating EDs efficiently. This tremendously reduces the execution time of UK-means, as demonstrated by our preliminary experiments. We also illustrate that this optimised formula effectively reduces the UK-means problem to the traditional clustering algorithm addressed by the k-means algorithm. © 2007 IEEE.published_or_final_versionThe 7th IEEE International Conference on Data Mining (ICDM) Workshops 2007, Omaha, NE., 28-31 October 2007. In Proceedings of the 7th ICDM, 2007, p. 483-48

Clustering uncertain data using voronoi diagrams and R-tree index

We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdfs). We show that the UK-means algorithm, which generalizes the k-means algorithm to handle uncertain objects, is very inefficient. The inefficiency comes from the fact that UK-means computes expected distances (EDs) between objects and cluster representatives. For arbitrary pdfs, expected distances are computed by numerical integrations, which are costly operations. We propose pruning techniques that are based on Voronoi diagrams to reduce the number of expected distance calculations. These techniques are analytically proven to be more effective than the basic bounding-box-based technique previously known in the literature. We then introduce an R-tree index to organize the uncertain objects so as to reduce pruning overheads. We conduct experiments to evaluate the effectiveness of our novel techniques. We show that our techniques are additive and, when used in combination, significantly outperform previously known methods. © 2006 IEEE.published_or_final_versio

Distributed and scalable XML document processing architecture for E-commerce systems

XML has became a very important emerging standard for E-commerce because of its flexibility and universality. Many software designers are actively developing new systems to handle information in XML formats. We propose a generic architecture for processing XML. We have designed an XML processing system using the latest technologies, such as XML, XSLT (XML Stylesheet Language Transformation), HTTP and Java servlets. Our design is very generic, flexible, scalable, extensible, and also suitable for distributed network environments. A main application of the architecture and the system is to support data exchange in E-commerce systems.published_or_final_versio

Efficient mining of frequent item sets on large uncertain databases

The data handled in emerging applications like location-based services, sensor monitoring systems, and data integration, are often inexact in nature. In this paper, we study the important problem of extracting frequent item sets from a large uncertain database, interpreted under the Possible World Semantics (PWS). This issue is technically challenging, since an uncertain database contains an exponential number of possible worlds. By observing that the mining process can be modeled as a Poisson binomial distribution, we develop an approximate algorithm, which can efficiently and accurately discover frequent item sets in a large uncertain database. We also study the important issue of maintaining the mining result for a database that is evolving (e.g., by inserting a tuple). Specifically, we propose incremental mining algorithms, which enable Probabilistic Frequent Item set (PFI) results to be refreshed. This reduces the need of re-executing the whole mining algorithm on the new database, which is often more expensive and unnecessary. We examine how an existing algorithm that extracts exact item sets, as well as our approximate algorithm, can support incremental mining. All our approaches support both tuple and attribute uncertainty, which are two common uncertain database models. We also perform extensive evaluation on real and synthetic data sets to validate our approaches. © 1989-2012 IEEE.published_or_final_versio

Laguerre–Gauss and Hermite–Gauss soft X-ray states generated using diffractive optics

Light’s capacity to carry angular momentum is integral to our knowledge of physics and ability to probe matter. In addition to spin, photons can occupy free-space orbital angular momentum eigenstates 1,2 . Visible light orbital angular momentum is used in quantum information experiments, super-resolution microscopy, optical tweezers and angular momentum transfer to atoms in optical lattices 3,4 . Soft X-ray orbital angular momentum applications, slowed by the lack of suitable optics and the rarity of coherent X-ray sources, could enable the direct alteration of atomic states through orbital angular momentum exchange, and methods to study the electronic properties of quantum materials. We have made soft X-ray diffractive optics that generate single Laguerre–Gauss modes, observed carrying up to 30ħ angular momentum per photon, or their superpositions. We also present Hermite–Gauss diffractive optics and a soft X-ray orbital angular momentum analyser. These tools could enable both the manipulation and finer characterization of topologically complex electronic matter, such as magnetic skyrmions