This paper presents the results of the handwriting segmentation contest that was organized in the context of ICDAR2007. The aim of this contest was to use well established evaluation practices and procedures in order ...
This paper presents the results of the handwriting segmentation contest that was organized in the context of ICDAR2007. The aim of this contest was to use well established evaluation practices and procedures in order to record recent advances in off-line handwriting segmentation. Two benchmarking datasets (one for text line and one for word segmentation) were used in a common evaluation platform in order to test and compare all submitted algorithms for handwritten document segmentation in realistic circumstances. The results of the evaluation of five algorithms submitted by participants as well as of two state-of-the-art algorithms are presented. The performance evaluation method is based on counting the number of matches between the text lines or words detected by the algorithms and the text line or words of the ground truth.
This paper describes annotations for the Corpus of Spontaneous Japanese. The information we annotated to the corpus includes morphemes, clause units, dependency structures, summaries, and discourse structures. They ar...
详细信息
This paper describes annotations for the Corpus of Spontaneous Japanese. The information we annotated to the corpus includes morphemes, clause units, dependency structures, summaries, and discourse structures. They are integrated in the form of XML. Morphological information was semi-automatically annotated to the transcribed text by reducing the human labor cost within the framework of morphological annotation that we proposed. Next, clause unites were detected based on the morphological information as basic units for our annotation. Then, dependency structures, summaries, discourse structures were annotated based on the clause units.
Four primal discontinuous Galerkin methods are applied to solve reactive transport problems, namely, Oden-BabuSka-Baumann DG （OBB-DG）, non-symmetric interior penalty Galerkin （NIPG）, symmetric interior penalty Gal...
详细信息
Four primal discontinuous Galerkin methods are applied to solve reactive transport problems, namely, Oden-BabuSka-Baumann DG （OBB-DG）, non-symmetric interior penalty Galerkin （NIPG）, symmetric interior penalty Galerkin （SIPG）, and incomplete interior penalty Galerkin （IIPG）. A unified a posteriori residual-type error estimation is derived explicitly for these methods. From the computed solution and given data, explicit estimators can be computed efficiently and directly, which can be used as error indicators for adaptation. Unlike in the reference [10], we obtain the error estimators in L^2 （L^2） norm by using duality techniques instead of in L^2（H^1） norm.
Inspired by the success of the projected Barzilai-Borwein (PBB) method for largescale box-constrained quadratic programming, we propose and analyze the monotone projected gradient methods in this paper. We show by exp...
详细信息
Inspired by the success of the projected Barzilai-Borwein (PBB) method for largescale box-constrained quadratic programming, we propose and analyze the monotone projected gradient methods in this paper. We show by experiments and analyses that for the new methods,it is generally a bad option to compute steplengths based on the negative gradients. Thus in our algorithms, some continuous or discontinuous projected gradients are used instead to compute the steplengths. Numerical experiments on a wide variety of test problems are presented, indicating that the new methods usually outperform the PBB method.
A master/worker paradigm for executing large-scale parallel discrete event simulation programs over network-enabled computational resources is proposed and evaluated. In contrast to conventional approaches to parallel...
详细信息
The （3＋1）-dimensional Jimbo-Miwa （JM） equation is solved approximately by using the conformal invariant asymptotic expansion approach presented by Ruan. By solving the new （3＋1）-dimensional integrable models, ...
详细信息
The （3＋1）-dimensional Jimbo-Miwa （JM） equation is solved approximately by using the conformal invariant asymptotic expansion approach presented by Ruan. By solving the new （3＋1）-dimensional integrable models, which are conformal invariant and possess Painlevé property, the approximate solutions are obtained for the JM equation, containing not only one-soliton solutions but also periodic solutions and multi-soliton solutions. Some approximate solutions happen to be exact and some approximate solutions can become exact by choosing relations between the parameters properly.
After the stress function and the normal derivative on the boundary for the plane problem of exterior circular domain are expanded into Laurent series, comparing them with the Laurent series of the complex stress func...
详细信息
After the stress function and the normal derivative on the boundary for the plane problem of exterior circular domain are expanded into Laurent series, comparing them with the Laurent series of the complex stress function and making use of some formulas in Fourier series and the convolutions, the boundary integral formula of the stress function is derived further. Then the stress function can be obtained directly by the integration of the stress function and its normal derivative on the boundary. Some examples are given. It shows that the boundary integral formula of the stress function is convenient to be used for solving the elastic plane problem of exterior circular domain.
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable c...
详细信息
ISBN:
(纸本)1595934332
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop two transactional data clustering specific evaluation metrics based on the concept of large transactional items and the coverage density respectively. Third, we implement the weighted coverage density clustering algorithm and the two clustering validation metrics using a fully automated transactional clustering framework, called SCALE (Sampling, Clustering structure Assessment, cLustering and domain-specific Evaluation). The SCALE framework is designed to combine the weighted coverage density measure for clustering over a sample dataset with self-configuring methods that can automatically tune the two important parameters of the clustering algorithms: (1) the candidates of the best number K of clusters;and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner. Copyright 2006 ACM.
A stationary convection-diffusion problem with a small parameter multiplying the highest derivative is considered. The problem is discretized on a uniform rectangular grid by the central-difference scheme. A new class...
详细信息
暂无评论