Constructive Membership Predicates as Index Types

In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of type T) in structure S, (x_TS) can not, in general, index all parts of a structure S and we generalize to a form ρS where ρ is a predicate over S. Under this scheme, (λx.True)S is the set of all indexes into S, but we show that not all subsets of indexes are expressible by strictly local predicates. Accordingly, we extend our membership predicates to predicates that retain state “from above” as well as allow “looking below”. Predicates of this form are complete in the sense that they can express every subset of indexes in S. These ideas are motivated by experience programming in Nuprl's constructive type theory and examining the constructive content of mechanically checked formal proofs involving membership predicates.     

Trench-Hall devices

A trench-Hall device sensitive to magnetic inductions parallel to the chip surface is reported in this paper. The vertically oriented active region is defined by two parallel trenches with a distance of only 2.4 μm. Deep contacts connect the active region of the device at its bottom at a depth of 20 μm. These deep contacts allow a symmetrical operating condition of the active region analogous to a lateral symmetrical Hall plate, which is favorable for dynamic offset reduction. With the presented technology, trench-Hall devices with a sensitivity of 320 V/A with a nonlinearity below 0.1% are realized. Additionally, the presented fabrication technique enables the electrically insulated cointegration of sensor and circuitry on a single CMOS chip     

Obituary

RILEM Bulletin

Obituary     

Inverse random under sampling for class imbalance problem and its application to multi-label classification

In this paper, a novel inverse random under sampling (IRUS) method is proposed for the class imbalance problem. The main idea is to severely under sample the majority class thus creating a large number of distinct training sets. For each training set we then find a decision boundary which separates the minority class from the majority class. By combining the multiple designs through fusion, we construct a composite boundary between the majority class and the minority class. The proposed methodology is applied on 22 UCI data sets and experimental results indicate a significant increase in performance when compared with many existing class-imbalance learning methods. We also present promising results for multi-label classification, a challenging research problem in many modern applications such as music, text and image categorization.     

Consensus in the presence of mortal Byzantine faulty processes

We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model “mortal Byzantine”. After discussing some application examples where this model is justified, we provide matching upper and lower bounds on the number of faulty processes, and on the required number of rounds in synchronous systems. We then continue our study by varying different system parameters. On the one hand, we consider the failure model under weaker timing assumptions, namely for partially synchronous systems and asynchronous systems with unreliable failure detectors. On the other hand, we vary the failure model in that we limit the occurrences of faulty steps that actually lead to a crash in synchronous systems.     

MPTP 0.1 - System Description

MPTP (Mizar Problems for Theorem Proving) is a system for translating the Mizar Mathematical Library (MML) into untyped first order format suitable for automated theorem provers, allowing generating theorem proving problems corresponding to MML. The first version generates about 30000 problems from complete proofs of Mizar theorems, and about 630000 problems from the simple (one-step) justifications done by the Mizar checker. We describe the design and structure of the system, some limitations, and planned future extensions.     

General view on current conveyors

We propose a new current conveyor terminology and explain how these terms are coined. Copyright © 2004 John Wiley & Sons, Ltd.     

统计不相关最佳鉴别矢量集的本质研究

对统计不相关最佳鉴别矢量集的本质进行研究，在基于总体散布矩阵特征分解的基础上，构造了一种白化变换，使得变换后的样本空间中的总体散布矩阵为单位矩阵，这样使得传统的最佳鉴别矢量集算法得到的均是具有统计不相关的最佳鉴别矢量集，从而揭示了统计不相关最佳鉴别变换的本质——白化变换加普通的线性鉴别变换。该方法的最大优点在于所获得的最优鉴别矢量同时具有正交性和统计不相关性。该方法对代数特征抽取具有普遍适用性。用ORL人脸数据库的数值实验，验证了该方法的有效性。     

Study of structure and properties of ZnO–Bi<Subscript>2</Subscript>O<Subscript>3</Subscript>–P<Subscript>2</Subscript>O<Subscript>5</Subscript> glasses

Glasses of the ternary system ZnO–Bi₂O₃–P₂O₅ were prepared and studied in two compositional series 50ZnO–xBi₂O₃–(50 − x)P₂O₅ and (50 − y)ZnO–yBi₂O₃–50P₂O₅. Two distinct glass-forming regions were found in the 50ZnO–xBi₂O₃–(50 − x)P₂O₅ glass series with x = 0–10 and 20–35 mol.% Bi₂O₃. All prepared Bi₂O₃-containing glasses reveal a high chemical durability. Small additions of Bi₂O₃ (∼5 mol.%) improve thermal stability of glasses. All glasses crystallize on heating within the temperature range of 505–583 °C. Structural studies by Raman and ³¹P MAS NMR spectroscopies showed the rapid depolymerisation of phosphate chains within the first region with x = 0–15 and the presence of isolated Q⁰ phosphate units within the second region with x = 20–35. Raman studies showed that bismuth is incorporated in the glass structure in BiO₆ units and their vibrational bands were observed within the spectral region of 350–700 cm⁻¹. The evolution of properties and the spectroscopic data are both in accordance with a network former effect of Bi₂O₃.