1280778
Splice Site Prediction using Support Vector Machines with Context-Sensitive Kernel Functions
This paper focuses on the use of support vector machines on a typical context-dependent classification task, splice site prediction. For this type of problems, it has been shown that a context-based approach should be preferred over a transfor- mation approach because the former approach can easily incorporate statistical mea- sures or directly plug sensitivity information into distance functions. In this paper, we designed three types of context-sensitive kernel functions: polynomial-based, radial basis function-based and negative distance-based kernels. From the experimental re- sults it becomes clear that the radial basis function-based kernel with information gain weighting gets the best accuracies and can always outperform their simple non-sensitive counterparts both in accuracy and in model complexity. And with well designed fea- tures and carefully chosen context sizes, our system can predict splice sites with fairly high accuracy, which can achieve the FP95% rate, 3.94 for donor sites and 5.98 for acceptor sites, an approximate state of the art performance for the moment.
36831968
Evaluating and Comparing Biomedical Term Identification Systems
In this paper, we propose a term identification system using conditional random fields (CRFs) on two biomedical datasets. Through employing several sets of experiments, we make a comprehensive investigation for different types of features. The final experimental results reflect that with carefully designed features i.e., adding not only the individual and dynamic features but also the combinational features, our system can identify biomedical terms with fairly high accuracy on both datasets, compared with other top systems already published in the literature.
13252008
Anode-ALM: An Aggregation-Based Application Level Multicast for Media Streaming
Building application level multicast (ALM) for media streaming, we had better keep the invariability of source to-end delay (S2EDelay) of any node on the tree, so as to avoid delay jitter problem. In this paper, we proposed an aggregation-based ALM architecture, which aggregates the unstable nodes within a local area into a relative stable aggregation node Anode, and then builds tree by Anodes. Anode shields node’s dynamicity inside and behaves as a stable one outside. To build the architecture, we first proposed an Anode structure by n-dimension anti-cube, and proposed a distributed algorithm to bind the logic view and physical view of an Anode dynamically by the differentiation and assimilation operations, which maintain the integrality of the logic view while the physical view changes dynamically. Experiment results indicate that our algorithm can keep theS2EDelay invariability of the built ALM tree effectively.
27634891
Nonlinear Adaptive Blind Source Separation Based on Kernel Function
As the linear method is difficult to recover the sources from the nonlinear mixture signals, in this paper a new nonlinear adaptive blind signal separation algorithm based kernel space is proposed for general invertible nonlinearities. The received mixture signals are mapped from low dimensional space to high dimensional kernel feature space. In the feature space, the received signals form a smaller submanifold, and an orthonormal basis of the submanifold is constructed in this space, as the same time, the mixture signals are parameterized by the basis in the high dimensional kernel space. In the noiseless or noisy situation, the sources are rebuilt online processing by M-EASI and subspace tracking. The results of computer simulations are also presented.
14744630
TARGET: Two-way Web Service Router Gateway
In this paper, we present the approach and architecture of TARGET: two-way Web service router gateway, for two-way Web service interaction crossing enterprise domain and firewall. It provides a full support for asynchronous outbound operation and event notification in communication services. TARGET addresses an acute issue for Internet applications that today's enterprise NATs and firewalls only allow outbound HTTP request from the inside to the outside and block any request from the outside to the inside, which is a serious problem for two-way Web services. TARGET is a generic solution to allow two-way Web service interaction to traverse legitimately through NATs and strictly configured firewalls; and it is based on two-way SOAP message tunneling, service local registry, and service routing to bridge two-way Web service interaction. A research TARGET system has been implemented and applied to real time communication services, e.g. conferencing. Extensive experiments on TARGET are performed, and its performance with various sizes of SOAP messages is studied. The applicability and feasibility of TARGET for two-way Web service interaction is verified
1077673
Low Complexity MMSE Vector Precoding Using Lattice Reduction for MIMO Systems
In this paper, a lattice-reduction-aided (LRA) minimum mean square error (MMSE) vector precoding (VP) is proposed for multiple input multiple output (MIMO) systems. Three schemes are provided for the perturbation vector design by Babai's approximation procedures based on lattice reduction method to reduce the complexity. Performance and complexity analysis are provided. Simulation results show that the proposed schemes significantly outperform the conventional MMSE Tomlinson-Harashima precoding (THP) and the zero forcing (ZF) VP. Compared with the MMSE VP via closest-point search, our LRA approach provides a simple alternative with little performance loss.
4963124
Blind equalization Using ν- support vector regressor for constant modulus signals
The support vector machine has been recently developed for blind equalization of constant modulus signals. In this paper we propose to use a v-support vector regressor (nu-SVR) for blindly equalizing multipath channels because of the high generalization ability of the SVR for short burst sequences. A weighted least square procedure is presented for solving the blind nu-SVR equalizer. The performance of the proposed algorithm is analyzed by means of computer simulations.