Integration of prior knowledge of measurement noise in kernel density classification

Samples can be measured with different precisions and reliabilities in different experiments, or even within the same experiment. These varying levels of measurement noise may deteriorate the performance of a pattern recognition system, if not treated with care. Here we seek to investigate the benefit of incorporating prior knowledge about measurement noise into system construction. We propose a kernel density classifier which integrates such prior knowledge. Instead of using an identical kernel for each sample, we transform the prior knowledge into a distinct kernel for each sample. The integration procedure is straightforward and easy to interpret. In addition, we show how to estimate the diverse measurement noise levels in a real world dataset. Compared to the basic methods, the new kernel density classifier can give a significantly better classification performance. As expected, this improvement is more obvious for small sample size datasets and large number of features.     

有线和无线宽带接入产品技术

射频存储系统的目标市场有两个，一个是宽带网络，一个是无线局域网：下图介绍的是第一公里的无线宽带接入系统。图的中央有一个中枢（hub)，它的周围是一个分布网络。这是一个包括光和电的、数据和模拟结合的网络，这种系统在中国的大城市都有广泛的部署。圆圈是飞利浦开发的一些结点、中枢和分布网络，包括放大器和光电设备。     

Gliotoxicity, reverse transcriptase activity and retroviral RNA in monocyte/macrophage culture supernatants from patients with multiple sclerosis

Utilizing cultured lenses from normal and homozygous glutathione peroxidase (GSHPx-1) knockout mice and inhibitors for GSSG Reductase (GSSG Red), 1,3-bis(2-chlorethyl)-1-nitrosourea (BCNU) and catalase (Cat), 3-aminotriazole (3-AT), the ability to degrade H2O2 was examined at two H2O2 concentrations, 300 microM and 80 microM. It was found that GSHPx-1 contributed about 15% to the H2O2 degradation. The Cat contribution was concentration dependent being about 30% at 300 microM H2O2 and approximately 8% to 15% at 80 microM H2O2. GSH loss measured as nonprotein thiol (NP-SH) was shown to be linked to most of the remaining H2O2 degradation accounting for about 54% to 72% of the H2O2 degradation at 300 microM and 80 microM, respectively. However, based on evaluation of the ability of GSH to nonenzymatically degrade H2O2, it can only account for about 36% at 300 microM and 19% at 80 microM H2O2 of the observed lens H2O2 degradation. It is, therefore, concluded that lens GSH must be involved in other reactions either directly or indirectly related to H2O2 degradation.     

A performance- and energy-oriented extended tuning process for time-step-based scientific applications

The Journal of Supercomputing - Scientific application codes are often long-running time- and energy-consuming parallel codes, and the tuning of these methods towards the characteristics of a...     

Root-restricted Kleenean rotations

We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees.     

Combination of convex theories: Modularity,deduction completeness,and explanation

Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories.     

Regaining cut admissibility in deduction modulo using abstract completion

Deduction modulo is a way to combine computation and deduction in proofs, by applying the inference rules of a deductive system (e.g. natural deduction or sequent calculus) modulo some congruence that we assume here to be presented by a set of rewrite rules. Using deduction modulo is equivalent to proving in a theory corresponding to the rewrite rules, and leads to proofs that are often shorter and more readable. However, cuts may be not admissible anymore.We define a new system, the unfolding sequent calculus, and prove its equivalence with the sequent calculus modulo, especially w.r.t. cut-free proofs. It permits to show that it is even undecidable to know if cuts can be eliminated in the sequent calculus modulo a given rewrite system.Then, to recover the cut admissibility, we propose a procedure to complete the rewrite system such that the sequent calculus modulo the resulting system admits cuts. This is done by generalizing the Knuth–Bendix completion in a non-trivial way, using the framework of abstract canonical systems.These results enlighten the entanglement between computation and deduction, and the power of abstract completion procedures. They also provide an effective way to obtain systems admitting cuts, therefore extending the applicability of deduction modulo in automated theorem proving.