39007433
Presentations of K-Trivial Reals and Kolmogorov Complexity
For given real α ∈ {0,1}∞, a presentation V of α is a prefix-free and recursively enumerable subset of {0,1}* such that $\alpha = \Sigma_{\sigma\epsilon\nu}2^{-|\sigma|}$. So, α has a presentation iff α is a left-r.e. real.
35293254
Quasi-complements of the cappable degrees
Say that a nonzero c. e. degree b is a quasi-complement of a c. e. degree a if a ∩ b = 0 and a ∪ b is high. It is well-known (due to Shore) that each cappable degree has a high quasi-complement. However, by the existence of the almost deep degrees, there are nonzero cappable degrees having no low quasi-complements. In this paper, we prove that any nonzero cappable degree has a low2 quasi-complement. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
1961392
Degrees of Weakly Computable Reals
This paper studies the degrees of weakly computable reals. It is shown that certain types of limit-recursive reals are Turing incomparable to all weakly computable reals except the recursive and complete ones. Furthermore, it is shown that an r.e. Turing degree is array-recursive iff every real in it is weakly computable.
1638130
Bounding computably enumerable degrees in the Ershov hierarchy
Nanyang Technol Univ, Sch Math & Phys Sci, Div Math Sci, Singapore 639798, Singapore. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Natl Univ Singapore, Dept Math, Singapore 119260, Singapore.
7723209
1-Generic splittings of computably enumerable degrees
Say a set G⊆ω is 1-generic if for any e∈ω, there is a string σ⊂G such that {e}σ(e)↓ or ∀τ⊇σ({e}τ(e)↑). It is known that 0′ can be split into two 1-generic degrees. In this paper, we generalize this and prove that any nonzero computably enumerable degree can be split into two 1-generic degrees. As a corollary, no two computably enumerable degrees bound the same class of 1-generic degrees.
18609322
On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal
We show that minimal pairs exist in the quotient structure of $\mathcal{R}$ modulo the ideal of noncuppable degrees.
1594579
GPSS Simulation Study of Quality Inspection System
1975159
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a context-dependent (also application-, data-, and user-dependent) way. In this paper, we propose to learn a distance function by capturing the nonlinear relationships among contextual information provided by the application, data, or user. We show that through a process called the "kernel trick," such nonlinear relationships can be learned efficiently in a projected space. Theoretically, we substantiate that our method is both sound and optimal. Empirically, using several datasets and applications, we demonstrate that our method is effective and useful.
1677219
Application of Smodels in Quartet Based Phylogeny Construction
Evolution is an important sub-area of study in biological science, where given a set of taxa, the goal is to reconstruct their evolutionary history, or phylogeny. One very recent approach is to predict a local phylogeny for every subset of 4 taxa, called a quartet topology, and then to assemble a phylogeny for the whole set of taxa satisfying these predicted quartet topologies. In general, the predicted quartet topologies might not always agree with each other, and thus the objective function becomes to satisfy a maximum number of them. This is the well known Maximum Quartet Consistency (MQC) problem. In the past, the MQC problem has been solved by dynamic programming and the so-called fixed-parameter method. Recently, we have proposed to solve the MQC in answer set programming. In this note, we summarize the theoretical results of this approach and report new experimental results for the purpose of comparison, which show that our approach in answer set programming is favored over the existing approaches based on dynamic programming and fixed-parameter method. In particular, some of the hard instances (where the error ratio is high) that were not reported to be solved in other approaches can now be solved in our approach.
9960122
Dynamic Zone-Balancing of Topology-Aware Peer-to-Peer Networks
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefits on performance have been recognized, an uneven overlay zone distribution has emerged. Recent work has shown that topology-aware neighbor selection during construction can aggravate the unbalance of zone distribution while it reduces routing path length. The imbalance in zone sizes may lead to performance decrease and an unfair load distribution. 
 
In this paper, we present an even topology-aware peer-to-peer network based on De Bruijn Graph by developing a dynamic zone-balancing approach.
18331143
Kronecker Factorization for Speeding up Kernel Machines
In kernel machines, such as kernel principal component analysis (KPCA), Gaussian Processes (GPs), and Support Vector Machines (SVMs), the computational complexity of finding a solution is O(n), where n is the number of training instances. To reduce this expensive computational complexity, we propose using Kronecker factorization, which approximates a positive definite kernel matrix by the Kronecker product of two smaller positive definite matrices. This approximation can speed up the calculation of the kernel-matrix inverse or eigendecomposition involved in kernel machines. When the two factorized matrices have about the same dimensions, the computational complexity is improved from O(n) to O(n). We propose two methods to carry out Kronecker factorization and apply them to speed up KPCA. In Experiments show that our methods can drastically reduce the computation time of kernel machines without any significant degradation in their effectiveness.