Robust loss functions for boosting

Boosting is known as a gradient descent algorithm over loss functions. It is often pointed out that the typical boosting algorithm, Adaboost, is highly affected by outliers. In this letter, loss functions for robust boosting are studied. Based on the concept of robust statistics, we propose a transformation of loss functions that makes boosting algorithms robust against extreme outliers. Next, the truncation of loss functions is applied to contamination models that describe the occurrence of mislabels near decision boundaries. Numerical experiments illustrate that the proposed loss functions derived from the contamination models are useful for handling highly noisy data in comparison with other loss functions.     

A high-resolution transmission electron microscope study of a zinc oxide varistor

Investigations were made of varistor microstructure, the morphology of Bi₂O₃ at multiple ZnO grain junctions, Bi₂O₃/ZnO grain boundaries and ZnO/ZnO grain boundaries (especially whether Bi₂O₃ is present or not at the ZnO/ZnO grain boundary) by means of high-resolution transmission electron microscopy and X-ray microanalysis in the scanning transmission electron microscope. Bi₂O₃ at multiple ZnO grain junctions consists of small particles of 0.1m in diameter, and they are vitrified to some extent. It is suggested that bismuth ions dissolve into ZnO grains over a 30 nm range from a Bi₂O₃/ZnO grain boundary; however, there is no bismuth at ZnO/ZnO grain boundaries.     

Basic constructs of the SIM operating system

The basic constructs of SIMPOS (Sequential Inference Machine Programming and Operating System) are explained. SIMPOS is an operating system for a super-personal computer (SIM), based on logic programming language (a modified Prolog, called KL0). Our design principle is simplicity both in concept and structure. The entire system will be constructed using these basic constructs.     

An Extension of the Receiver Operating Characteristic Curve and AUC-Optimal Classification

While most proposed methods for solving classification problems focus on minimization of the classification error rate, we are interested in the receiver operating characteristic (ROC) curve, which provides more information about classification performance than the error rate does. The area under the ROC curve (AUC) is a natural measure for overall assessment of a classifier based on the ROC curve. We discuss a class of concave functions for AUC maximization in which a boosting-type algorithm including RankBoost is considered, and the Bayesian risk consistency and the lower bound of the optimum function are discussed. A procedure derived by maximizing a specific optimum function has high robustness, based on gross error sensitivity. Additionally, we focus on the partial AUC, which is the partial area under the ROC curve. For example, in medical screening, a high true-positive rate to the fixed lower false-positive rate is preferable and thus the partial AUC corresponding to lower false-positive rates is much more important than the remaining AUC. We extend the class of concave optimum functions for partial AUC optimality with the boosting algorithm. We investigated the validity of the proposed method through several experiments with data sets in the UCI repository.     

Colorimetric microdetermination of sulphites in foods by use of the modified rankine apparatus. IV.

Summary Detection and determination of traces of sulphites in foods was attempted by use of the modified Rankine apparatus and pararosaniline colorimetry. Replacement of alkaline titration reported previously by pararosaniline colorimetry lowered the absolute detection limit from 30 g (titration method) to 2 g. In view of clean analysis, in the color developing system, 0.1 N-sodium hydroxide was used in place of mercuric chloride solution commonly used as an absorbant of sulphites. In order to prevent oxidative decomposition of sulphites during operation, nitrogen gas was used as carrier instead of air. Dimedone and sodium azide were used for the elimination of aldehydes and nitrites, respecitvely, in the sample, which will disturb the color development of sulphites with pararosaniline-formaldehyde reagents. With this improved method, it was possible to determine the residual sulphites in frozen peeled shrimps, sugared beans and other foods with low sulphite contents accurately.

---

Colorimetrische Mikrobestimmung von Sulfiten in Lebensmitteln bei Anwendung der modifizierten IV. Rankine Apparatur

Zusammenfassung Geringe Sulfitmengen in Lebensmitteln (geschälte Garnelen, gezuckerte Bohnen) können colorimetrisch bestimmt werden. Die neuentwickelte Methode beruht auf einer Kombination von colorimetrischer Bestimmung mittels p-Rosanilin und der Bestimmungsmethode nach Rankine. Auf diese Weise lassen sich Gehalte von 2 g noch genau bestimmen. Bei der Farbentwicklung wurde das giftige Quecksilbertetrachlorid durch 0.1 n-NaOH ersetzt, anstelle von Luft Stickstoff als Trägergas verwendet und somit eine Oxydation des Sulfits während der Bestimmung vermieden. Da Nitrit und Aldehyde die Farbentwicklung stören, wurde ihr Einfluß durch Dimedon und Natriumazid ausgeschaltet.

---

---

Studies on the Analyses of Sulphites in Foods (IV)     

Helium gas permeability of montmorillonite/epoxy nanocomposites

Helium gas permeability of silicate clay (montmorillonite) particles/epoxy nanocomposites was examined. The incorporation of increasing amounts of montmorillonite particles reduced the helium gas permeability. Based on Fick’s law, gas permeation behavior of the nanocomposite was evaluated. With the increase of montmorillonite loading, gas diffusivity decreased, while gas solubility increased. Helium diffusion behavior is in agreement to the numerical results based on the Hatta–Taya–Eshelby theory. It has been revealed that dispersion of nanoscale platelets in polymer is effective in improving gas barrier property.     

Business process integration as a solution to the implementation of supply chain management systems

In the domain of supply chain management (SCM), various software packages have been developed for planning business strategies. To solve the problem of system productivity in applying planning packages, we propose a solution concept, business process integration (BPI), which fuses workflow and enterprise application integration (EAI) technology. Two characteristic policies are included in BPI. The first is to design the minimum set of business processes for real-time information sharing with planning packages without changing other processes. The second is to integrate several systems with EAI technology and to manage their execution with a workflow tool. Based on these policies, we propose various design templates and integration adapters. Our evaluation shows that using BPI, a target system can be developed with less manpower, in less time, and with higher quality than previous methods.     

On the computational power of insertion-deletion systems

Gene insertion and deletion are basic phenomena found in DNA processing or RNA editing in molecular biology. The genetic mechanism and development based on these evolutionary transformations have been formulated as a formal system with two operations of insertion and deletion, called insertion-deletion systems (Kari and Thierrin, 1996; Kari et al., 1997).We investigate the generative power of insertion-deletion systems (InsDel systems), and show that the family INS ¹ ₁ DEL ¹ ₁ is equal to the family of recursively enumerable languages. This gives a positive answer to an open problem posed in Kari et al. (1997) where it was conjectured contrary. This revised version was published online in June 2006 with corrections to the Cover Date.     

Complete Mining of Frequent Patterns from Graphs: Mining Graph Data

Basket Analysis, which is a standard method for data mining, derives frequent itemsets from database. However, its mining ability is limited to transaction data consisting of items. In reality, there are many applications where data are described in a more structural way, e.g. chemical compounds and Web browsing history. There are a few approaches that can discover characteristic patterns from graph-structured data in the field of machine learning. However, almost all of them are not suitable for such applications that require a complete search for all frequent subgraph patterns in the data. In this paper, we propose a novel principle and its algorithm that derive the characteristic patterns which frequently appear in graph-structured data. Our algorithm can derive all frequent induced subgraphs from both directed and undirected graph structured data having loops (including self-loops) with labeled or unlabeled nodes and links. Its performance is evaluated through the applications to Web browsing pattern analysis and chemical carcinogenesis analysis.     

Shape from Shading with Interreflections Under a Proximal Light Source: Distortion-Free Copying of an Unfolded Book

We address the problem of recovering the 3D shape of an unfolded book surface from the shading information in a scanner image. This shape-from-shading problem in a real world environment is made difficult by a proximal, moving light source, interreflections, specular reflections, and a nonuniform albedo distribution. Taking all these factors into account, we formulate the problem as an iterative, non-linear optimization problem. Piecewise polynomial models of the 3D shape and albedo distribution are introduced to efficiently and stably compute the shape in practice. Finally, we propose a method to restore the distorted scanner image based on the reconstructed 3D shape. The image restoration experiments for real book surfaces demonstrate that much of the geometric and photometric distortions are removed by our method.