Coordination is essential for five reasons: preventing anarchy or chaos;efficiency;meeting global constraints;distributed information, expertise or resources;and dependencies between the agents' actions. Coordinat...
详细信息
Coordination is essential for five reasons: preventing anarchy or chaos;efficiency;meeting global constraints;distributed information, expertise or resources;and dependencies between the agents' actions. Coordination is also an important method for cooperation. Due to this significance,coordination have been paid great attention in recent years, from coordination models, mechanisms, methods, etc. to resource management. In this paper, we will survey these advances and give our view of future research direction.
Classification and regression are most interesting problems in the fields of pattern recognition. The regression problem can be changed into binary classification problem and least squares support vector machine can b...
详细信息
We propose a new visualization method WDM to classify documents by adding in the position-factors of words such as the title-factor and the first-sentence-factor based on a SOM neural network. We also discuss the sele...
详细信息
ISBN:
(纸本)1424406048
We propose a new visualization method WDM to classify documents by adding in the position-factors of words such as the title-factor and the first-sentence-factor based on a SOM neural network. We also discuss the selection of the function which is used to calculate the belong-to-probability in neurons' reflecting process. The experimental results indicate that WDM makes the boundaries of different documents greatly more clear, and thus it can produce more accurate and intuitive classification compared to the visualization methods which do not have position-factors considered
Identification of transcription factor binding sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a new ...
详细信息
Identification of transcription factor binding sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a new approach to predict TFBS. This approach uses position weight matrix (PWM) to represent binding sites and uses genetic algorithm (GA) to search the best matrix. A new coding method so called multiple-variable coding is proposed in GA. We apply it on two transcription factors rebl and mgl. The result shows that this approach can find most of the known sites, which indicates that this method is very effective
This paper describes a sub-object retrieval system based on a segmentation method. We also use dynamic partial function (DPF) and indexing by locality sensitive hashing (LSH) for improving system performance. Such a s...
详细信息
This paper describes a sub-object retrieval system based on a segmentation method. We also use dynamic partial function (DPF) and indexing by locality sensitive hashing (LSH) for improving system performance. Such a system is useful for finding a sub-object from a large image database. In order to obtain the sub-object from a sample image, we use a segmentation method to cut out the object. The system utilizes the segmentation results to capture the higher-level concept of images and gets a stable and accurate result. Experimental and comparison results, which are performed using a general purpose database containing 20,000 images, are encouraging
The complex mapping z larr z a is important in dynamical application, but it is not received as much attention in the literature as the mapping z larr z a +c, for there is not fractal structure by using escape time a...
详细信息
The complex mapping z larr z a is important in dynamical application, but it is not received as much attention in the literature as the mapping z larr z a +c, for there is not fractal structure by using escape time algorithm. This paper utilizes a new method named as distance ratio iteration method and discusses the iteration properties of the complex mapping z larr z a . The distance ratio iteration method can render the convergence region of the mapping, so the image has complex and self-similarity structure. This paper generates fractal image using distance ratio iteration method for various exponents of z larr z a and discusses their visual properties. There is rich detail fractal structure in the mapping z larr z a
Large scale terrain visualization with high- resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method ...
详细信息
Large scale terrain visualization with high- resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method based on multi-resolution storage techniques. In external memory, the terrain data set is subdivided from top to bottom to build a multi-resolution hierarchical structure based on a quad-tree. The hierarchical structure can decimate the elevation data that must be loaded into internal memory. Thus it can improve the efficiency of I/O access greatly. Moreover, in order to implement rapid data retrieval of the real time terrain flyover, an efficient indexing algorithm is proposed, in which those nodes in the hierarchical structure will be divided into several clusters in terms of the similarities of static error and the closed space constraint. In addition, a method for crack-free is also proposed here. The comprehensive experiment conducted on the GTOP30 data set shows that this approach outperforms the Block and the Hierarchy algorithms in the both ways of efficiency and simplification ratio.
Cancer classification and identification are major areas in medical research. DNA microarrays could provide useful information for cancer classification at the gene expression level. The number of genes in a microarra...
详细信息
Cancer classification and identification are major areas in medical research. DNA microarrays could provide useful information for cancer classification at the gene expression level. The number of genes in a microarray is always several thousands while the number of training samples always several dozens. In such case most of the machine learning models suffer from the overfitting and it is necessary to select a handful of most informative genes. An adaptive and iterative gene selection algorithm based on least squares support vector machines is proposed in this paper. The algorithm adopts sequential forward selection search scheme. The number of selected genes can be determined adaptively. The total number of genes processed by the proposed algorithm is smaller than that processed by other algorithms using support vector machines. Results of numerical experiments show that the proposed algorithm trains fast and achieves comparable performance on two well-known benchmark problems.
The constraint problem can be transformed to an optimization problem. Particle swarm optimization (PSO) is a new evolutionary computation technique. Even PSO has many attractive properties, but it lacks global search ...
详细信息
The constraint problem can be transformed to an optimization problem. Particle swarm optimization (PSO) is a new evolutionary computation technique. Even PSO has many attractive properties, but it lacks global search ability at the end of the run. This paper introduce a hybrid approach called the TPSO that simultaneously applies particle swarm optimization (PSO), and tabu search (TS) to create a generally well-performing search heuristics, and combat the problem of premature convergence. The new algorithm considers candidate solutions and their fitness as individuals, which are based on their recent search progress. The tabu search makes each particle to reset its record of its best position, to avoid making direction and velocity decisions on the basis of outdated information. The feasibility of the proposed method is demonstrated on Solving Geometric Constraint Problems.
暂无评论