Identifying Mislabeled Training Data

This paper presents a new approach to identifying and eliminating mislabeled training instances for supervised learning. The goal of this approach is to improve classification accuracies produced by learning algorithms by improving the quality of the training data. Our approach uses a set of learning algorithms to create classifiers that serve as noise filters for the training data. We evaluate single algorithm, majority vote and consensus filters on five datasets that are prone to labeling errors. Our experiments illustrate that filtering significantly improves classification accuracy for noise levels up to 30 percent. An analytical and empirical evaluation of the precision of our approach shows that consensus filters are conservative at throwing away good data at the expense of retaining bad data and that majority filters are better at detecting bad data at the expense of throwing away good data. This suggests that for situations in which there is a paucity of data, consensus filters are preferable, whereas majority vote filters are preferable for situations with an abundance of data

Mapping Crop Cycles in China Using MODIS-EVI Time Series

As the Earth’s population continues to grow and demand for food increases, the need for improved and timely information related to the properties and dynamics of global agricultural systems is becoming increasingly important. Global land cover maps derived from satellite data provide indispensable information regarding the geographic distribution and areal extent of global croplands. However, land use information, such as cropping intensity (defined here as the number of cropping cycles per year), is not routinely available over large areas because mapping this information from remote sensing is challenging. In this study, we present a simple but efficient algorithm for automated mapping of cropping intensity based on data from NASA’s (NASA: The National Aeronautics and Space Administration) MODerate Resolution Imaging Spectroradiometer (MODIS). The proposed algorithm first applies an adaptive Savitzky-Golay filter to smooth Enhanced Vegetation Index (EVI) time series derived from MODIS surface reflectance data. It then uses an iterative moving-window methodology to identify cropping cycles from the smoothed EVI time series. Comparison of results from our algorithm with national survey data at both the provincial and prefectural level in China show that the algorithm provides estimates of gross sown area that agree well with inventory data. Accuracy assessment comparing visually interpreted time series with algorithm results for a random sample of agricultural areas in China indicates an overall accuracy of 91.0% for three classes defined based on the number of cycles observed in EVI time series. The algorithm therefore appears to provide a straightforward and efficient method for mapping cropping intensity from MODIS time series data

Computer simulation of pulsed field gel runs allows the quantitation of radiation-induced double-strand breaks in yeast

A procedure for the quantification of double-strand breaks in yeast is presented that utilizes pulsed field gel electrophoresis (PFGE) and a comparison of the observed DNA mass distribution in the gel lanes with calculated distributions. Calculation of profiles is performed as follows. If double-strand breaks are produced by sparsely ionizing radiation, one can assume that they are distributed randomly in the genome, and the resulting DNA mass distribution in molecular length can be predicted by means of a random breakage model. The input data for the computation of molecular length profiles are the breakage frequency per unit length, , as adjustable parameter, and the molecular lengths of the intact chromosomes. The obtained DNA mass distributions in molecular length must then be transformed into distributions of DNA mass in migration distance. This requires a calibration of molecular length vs. migration distance that is specific for the gel lane in question. The computed profiles are then folded with a Lorentz distribution with adjusted spread parameter to account for and broadening. The DNA profiles are calculated for different breakage frequencies and for different values of , and the parameters resulting in the best fit of the calculated to the observed profile are determined

An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups

Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in extraspecial groups. Our approach is quite different from the recent algorithms presented in [17] and [2] for the Heisenberg group, the extraspecial p-group of size p3 and exponent p. Exploiting certain nice automorphisms of the extraspecial groups we define specific group actions which are used to reduce the problem to hidden subgroup instances in abelian groups that can be dealt with directly.Comment: 10 page

Economics and Business handbook

2002 handbook for the faculty of Economics and Busines

Detecting One-variable Patterns

Given a pattern $p = s_1x_1s_2x_2\cdots s_{r-1}x_{r-1}s_r$ such that $x_1,x_2,\ldots,x_{r-1}\in\{x,\overset{{}_{\leftarrow}}{x}\}$, where $x$ is a variable and $\overset{{}_{\leftarrow}}{x}$ its reversal, and $s_1,s_2,\ldots,s_r$ are strings that contain no variables, we describe an algorithm that constructs in $O(rn)$ time a compact representation of all $P$ instances of $p$ in an input string of length $n$ over a polynomially bounded integer alphabet, so that one can report those instances in $O(P)$ time.Comment: 16 pages (+13 pages of Appendix), 4 figures, accepted to SPIRE 201

Automated Classification of Airborne Laser Scanning Point Clouds

Making sense of the physical world has always been at the core of mapping. Up until recently, this has always dependent on using the human eye. Using airborne lasers, it has become possible to quickly "see" more of the world in many more dimensions. The resulting enormous point clouds serve as data sources for applications far beyond the original mapping purposes ranging from flooding protection and forestry to threat mitigation. In order to process these large quantities of data, novel methods are required. In this contribution, we develop models to automatically classify ground cover and soil types. Using the logic of machine learning, we critically review the advantages of supervised and unsupervised methods. Focusing on decision trees, we improve accuracy by including beam vector components and using a genetic algorithm. We find that our approach delivers consistently high quality classifications, surpassing classical methods

Multimodal Grasp Planner for Hybrid Grippers in Cluttered Scenes

Grasping a variety of objects is still an open problem in robotics, especially for cluttered scenarios. Multimodal grasping has been recognized as a promising strategy to improve the manipulation capabilities of a robotic system. This work presents a novel grasp planning algorithm for hybrid grippers that allows for multiple grasping modalities. In particular, the planner manages two-finger grasps, single or double suction grasps, and magnetic grasps. Grasps for different modalities are geometrically computed based on the cuboid and the material properties of the objects in the clutter. The presented framework is modular and can leverage any 6D pose estimation or material segmentation network as far as they satisfy the required interface. Furthermore, the planner can be applied to any (hybrid) gripper, provided the gripper clearance, finger width, and suction diameter. The approach is fast and has a low computational burden, as it uses geometric computations for grasp synthesis and selection. The performance of the system has been assessed with an experimental campaign in three manipulation scenarios of increasing difficulty using the objects of the YCB dataset and the DLR hybrid-compliant gripper

A Cellular Potts Model simulating cell migration on and in matrix environments

Cell migration on and through extracellular matrix plays a critical role in a wide variety of physiological and pathological phenomena, and in scaffold-based tissue engineering. Migration is regulated by a number of extracellular matrix- or cell-derived biophysical parameters, such as matrix fiber orientation, gap size, and elasticity, or cell deformation, proteolysis, and adhesion. We here present an extended Cellular Potts Model (CPM) able to qualitatively and quantitatively describe cell migratory phenotype on both two-dimensional substrates and within three-dimensional environments, in a close comparison with experimental evidence. As distinct features of our approach, the cells are represented by compartmentalized discrete objects, differentiated in the nucleus and in the cytosolic region, while the extracellular matrix is composed of a fibrous mesh and of a homogeneous fluid. Our model provides a strong correlation of the directionality of migration with the topological ECM distribution and, further, a biphasic dependence of migration on the matrix density, and in part adhesion, in both two-dimensional and three-dimensional settings. Moreover, we demonstrate that the directional component of cell movement is strongly correlated with the topological distribution of the ECM fibrous network. In the three-dimensional networks, we also investigate the effects of the matrix mechanical microstructure, observing that, at a given distribution of fibers, cell motility has a subtle bimodal relation with the elasticity of the scaffold. Finally, cell locomotion requires deformation of the cell's nucleus and/or cell-derived proteolysis of steric fibrillar obstacles within rather rigid matrices characterized by small pores, not, however, for sufficiently large pores. In conclusion, we here propose a mathematical modeling approach that serves to characterize cell migration as a biological phenomen in health, disease and tissue engineering applications. The research that led to the present paper was partially supported by a grant of the group GNFM of INdA