Dalian Neusoft Institute of Information

Dalian, China

Dalian Neusoft Institute of Information

Dalian, China
SEARCH FILTERS
Time filter
Source Type

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.


Liu J.,Shenyang University of Technology | Yue Y.,University of Bedfordshire | Dong Z.,Dalian Neusoft Institute of Information | Maple C.,University of Bedfordshire | Keech M.,University of Bedfordshire
Computers and Operations Research | Year: 2011

The container loading problem, which is significant for a number of industrial sectors, aims to obtain a high space utilisation in the container while satisfying practical constraints. This paper presents a novel hybrid tabu search approach to the container loading problem. A loading heuristic is devised to incorporate heuristic strategies with a handling method for remaining spaces to generate optimal loading arrangements of boxes with stability considered. The tabu search technique, which covers the encoding, evaluation criteria and configuration of neighbourhood and candidate solutions, is used to improve the performance of the loading heuristic. Experimental results with benchmark data show that the hybrid approach provides a better space utilisation than the published approaches under the condition of all loaded boxes with one hundred percent support from below. Moreover, it is shown that the hybrid tabu search can solve problems with the constraints of weight limit and weight distribution with real world data. © 2010 Elsevier Ltd. All rights reserved.


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.


Wang F.,Dalian Maritime University | Wang F.,Dalian Neusoft Institute of Information | Lu M.,Dalian Maritime University
Computer Journal | Year: 2013

Efficient visual tracking is a challenging task in the computer vision community due to its large motion uncertainty induced by occlusion, abrupt motion or appearance changes. In this paper, we propose a Hamiltonian Markov Chain Monte Carlo (MCMC) based tracking scheme for efficient tracking within the Bayesian filtering framework, aiming at handling full or partial occlusions, abrupt motion and appearance changes. In this tracking scheme, no complex models are built for motion uncertainties. The object states are augmented by introducing a momentum item and the Hamiltonian dynamics (HD) is integrated into the traditional MCMC-based tracking method. A new object state is proposed by computing a trajectory according to HD, implemented with the Leapfrog method. The new state can be distant from the current object state but, nevertheless, has a high acceptance probability, which consequently bypasses the slow exploration of the state space suffered by traditional random-walk proposal distribution. In addition, the proposed tracking algorithm can avoid being trapped in local maxima, which is suffered by conventional MCMC-based tracking algorithms. Experimental results reveal that our approach is efficient and effective in dealing with various types of tracking scenarios compared with several alternatives. © 2013 The Author.


Guijuan S.,Dalian Neusoft Institute of Information | Gang L.,Dalian Neusoft Institute of Information
Applied Mechanics and Materials | Year: 2013

Attribute reduction is a key problem for rough set theory. While computing reduction according to the definitions is a typical NP problem. In this paper, basic concept of rough set theory is presented, one heuristic algorithm for attribution reduction based on conditional entropy is proposed. The actual application shows that the method is feasible and effective. © 2013 Trans Tech Publications Ltd, Switzerland.


Zhang N.,Dalian Neusoft Institute of Information
Applied Mechanics and Materials | Year: 2013

The data in computer is lost because of the destruction of disk partition table. To solve this problem, a data recovery solution by recovering partition table was proposed. The hard disk logical parameter was introduced. The hard disk addressing mode was analyzed. On the basis of analyzing disk partition structure, the recovery principle of MBR and EBR was proposed. After the specific process of partition table recovery was illustrated, an implement scheme was proposed and proved to be available. © (2013) Trans Tech Publications, Switzerland.


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.


Zhijun G.,Dalian Neusoft Institute of Information
Advanced Materials Research | Year: 2012

To take full advantage of multi-core processor resources, this paper examines the multi-core platform using OpenMP implementation of two kinds of pi parallel algorithms, numerical integration and Monte Carlo. The experimental results show that optimized algorithm with the OpenMP pragmas compared with the serial code has been improved speed significantly, also achieved satisfactory speedup and parallel efficiency that effectively improve the utilization of computer resources of the multi-core, parallel algorithm for the realization of Pi provides a new way of thinking. © (2012) Trans Tech Publications, Switzerland.


Wang F.,Dalian Neusoft Institute of Information
Communications in Computer and Information Science | Year: 2011

Particle filter has grown to be a standard tool for solving visual tracking problems in real world applications. This paper discusses in detail the application of particle filter in visual tracking, including single object and multiple objects tracking. Choosing a good proposal distribution for the tracking algorithm in particle filtering framework is the main focus of this paper. We also discussed the contributions related to dealing with occlusion, interaction, illumination change using improved particle filters. A conclusion is drawn in section 4. © 2011 Springer-Verlag.


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.

Loading Dalian Neusoft Institute of Information collaborators
Loading Dalian Neusoft Institute of Information collaborators