Entity

Time filter

Source Type


Liu B.Y.,Dalian Neusoft Institute of Information
Advanced Materials Research | Year: 2014

In previous work, the ontology-based algorithm of bipartite graph matching semantic web service discovery was presented. But in these algorithms, the problem of finding augment path was not resolved very well. It will affect the recall rate and precision rate of web service discovery. In order to resolve these problems, this paper proposes an ontology-based bipartite graph matching semantic web service discovery algorithm, which extends the optimal bipartite graph matching algorithm. It uses the slack function to find the augment path in the equivalent sub graph. The algorithm also contributes to the improvement of the recall rate and precision rate of the service discovery. © (2014) Trans Tech Publications, Switzerland. Source


Ito N.,Toho University | Deng T.-L.,Dalian Neusoft Institute of Information
Proceedings - 2010 3rd International Congress on Image and Signal Processing, CISP 2010 | Year: 2010

This paper proposes a variable filter-bank (VFB) for low-power digital hearing aids. This VFB is designed using digital spectral transformation. After proving transformations from a digital prototype lowpass filter into variable lowpass filter (LPF), variable bandpass filter (BPF), and variable highpass filter (HPF), we demonstrate how to optimize the parameters of the VFB for optimally fitting a given audiogram. An example will be given to show that a low-order (second-order) VFB can achieve very accurate audiogram fitting. Such a VFB requires much fewer multipliers than the conventional fixed-bandwidth filter-bank, and thus reduces power consumption significantly. ©2010 IEEE. Source


Wu Y.-H.,Dalian University of Technology | Zhai W.-D.,Dalian Neusoft Institute of Information | Cao W.-Z.,Dalian University of Technology | Li C.,Dalian University of Technology
International Journal of Theoretical Physics | Year: 2011

We revisited the quantum secure direct communication (QSDC) by using a notation (Li et al. in Phys. Lett. A 297:121, 2002; Li et al. in Int. J. Theor. Phys. 46(7):1815, 2007) and generalized QSDC to arbitrary finite dimensions, we also figured out the decoding formula for QSDC of arbitrary finite dimensions. In order to overcome the channel noisy, we present a scheme through introduce n auxilians by using quantum swapping. © 2010 Springer Science+Business Media, LLC. Source


Liu B.,Dalian Neusoft Institute of Information
Lecture Notes in Electrical Engineering | Year: 2012

The current register and discovery protocol as UDDI is a keywordbased and precisely matching service discovery mechanism and it can't describe the semantic information of a Web service. Many suitable Web services can't be discovered automatically by the traditional service discovery methods. In order to resolve these problems, this paper presents a method of semantic Web service discovery based on bipartite graph matching. It makes computers recognize semantic information of Web Services. The method contributes to the improvement of service discovery efficiency when service is retrieved in an automatic way. © Springer-Verlag Berlin Heidelberg 2012. Source


Wang F.,Dalian Maritime University | Wang F.,Dalian Neusoft Institute of Information | Lu M.,Dalian Maritime University
Proceedings - International Conference on Pattern Recognition | Year: 2012

In this paper, we propose a Hamiltonian Markov Chain Monte Carlo based tracking algorithm for abrupt motion tracking within the Bayesian filtering framework. In this tracking scheme, the object states are augmented by introducing a momentum item and the Hamiltonian Dynamics (HD) is integrated into the traditional MCMC based tracking method. The HD has some excellent properties which are crucial in constructing MCMC updates. A new object state is proposed through constructing a trajectory according to HD, implemented using the Leapfrog method. And the state proposed by the HD can keep a certain distant from the current object state but nevertheless have a high acceptance probability, which consequently bypass the slow exploration of the state space suffered by traditional random-walk proposal distribution. Experimental results reveal that our approach is efficient and effective in handling various types of abrupt motions compared to several alternatives. © 2012 ICPR Org Committee. Source

Discover hidden collaborations