检索结果-内蒙古大学图书馆

Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning

作者： Hao Xiong Qun Liu Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China

ISBN: (纸本)9781627484046

In this paper, we present our system description for the CoNLL-2012 coreference resolution task on English, Chinese and Arabic. We investigate a projection-based model in which we first translate Chinese and Arabic into English, run a publicly available coreference system, and then use a new projection algorithm to map the coreferring entities back from English into mention candidates detected in the Chinese and Arabic source. We compare to a baseline that just runs the English coreference system on the supplied parses for Chinese and Arabic. Because our method does not beat the baseline system on the development set, we submit outputs generated by the baseline system as our final submission.

关键词： Arabic language English English language projection algorithms Chinese Chinese philosophy Chinese art BASELINE information technology Information and communication technology International Criminal Tribunal Coreference Resolution

来源：评论

学校读者我要写书评

暂无评论

Differential evolution with a mix of Constraint Consenus methods for solving a real-world Optimization Problem

Differential evolution with a mix of Constraint Consenus met...

引用

Congress on Evolutionary Computation

作者： Noha M. Hamza Ruhul A. Sarker Daryl L. Essam School of Engineering and Information Technology Australian Defense Force Academy University of New South Wales Canberra Australia

ISBN: (纸本)9781467315104

Over the last few decades, real world constrained optimization has become an important research topic in the evolutionary computation field. The Economic Load Dispatch is one of the well-known complex practical problems. The problem is usually represented by a non-convex constrained optimization model. In this paper, we propose to use an ensemble of three different Constraint Consensus (CC) methods within the Differential Evolution algorithm to solve the Economic Load Dispatch problem. During the evolution process, an adaptive mechanism is used to assign the infeasible solutions to each CC method with the emphasis on the best performing one. The experimental results show that the proposed algorithm is not only able to reach the 100% feasibility ratio, but that it is also able to obtain better solutions in comparison to the state-of-the-art algorithms.

关键词： Vectors Optimization projection algorithms Mathematical model Economics Generators Equations

来源：评论

学校读者我要写书评

暂无评论

Sparsity-aware adaptive filters based on ℓp-norm inspired soft-thresholding technique

Sparsity-aware adaptive filters based on ℓp-norm inspired s...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Masahiro Yukawa Yuta Tawara Masao Yamagishi Isao Yamada Department of Electrical and Electronic Engineering Niigata University Niigata Japan Department of Communications and Integrated Systems Tokyo Institute of Technology Tokyo Japan

We propose a novel sparsity-aware adaptive filtering algorithm based on iterative use of weighted soft-thresholding. The weights are determined based on a rough local approximation of the ℓ p norm (0

关键词： Signal to noise ratio Signal processing algorithms Echo cancellers Least squares approximation projection algorithms

来源：评论

学校读者我要写书评

暂无评论

On an iterative method for basis pursuit with application to echo cancellation with sparse impulse responses

On an iterative method for basis pursuit with application to...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Pratik Shah Steven L. Grant Jacob Benesty Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO USA INRS-EMT University of Quebec Montreal QUE Canada

Basis pursuit has been shown to be an effective method of solving inverse problems with a small amount of data when the system to be determined has a sparse representation. Adaptive filters fall under this general category of problems. Here, we use the echo cancellation context to introduce a method of solving the basis pursuit problem with an iterative method based on the proportionate normalized affine projection algorithm (PAPA). Earlier, it has been shown that PAPA can be derived from a basis pursuit perspective. Here we refine the assumptions made in those derivations and show that an iterative form of PAPA yields the same results as basis pursuit without resorting to the simplex method. The resulting algorithm has extremely fast convergence for adaptive filters with very sparse impulse responses. Simulations using the new iterative approach are also presented.

关键词： Iterative methods Adaptive filters Convergence Vectors Echo cancellers Signal to noise ratio projection algorithms

来源：评论

学校读者我要写书评

暂无评论

Dictionary adaptation for online prediction of time series data with kernels

Dictionary adaptation for online prediction of time series d...

引用

IEEE/SP Workshop on Statistical Signal Processing (SSP)

作者： Chafic Saidé Régis Lengellé Paul Honeine Cédric Richard Roger Achkar Institut Charles Delaunay (UMR CNRS 6279) Université de technologie de Troyes France Laboratoire H. Fizeau (UMR CNRS) Université de Nice Sophia-Antipolis France American University of Science and Technology Beirut Lebanon

During the last few years, kernel methods have been very useful to solve nonlinear identification problems. The main drawback of these methods resides in the fact that the number of elements of the kernel development, i.e., the size of the dictionary, increases with the number of input data, making the solution not suitable for online problems especially time series applications. Recently, Richard, Bermudez and Honeine investigated a method where the size of the dictionary is controlled by a coherence criterion. In this paper, we extend this method by adjusting the dictionary elements in order to reduce the residual error and/or the average size of the dictionary. The proposed method is implemented for time series prediction using the kernel-based affine projection algorithm.

关键词： Dictionaries Kernel Coherence Time series analysis Vectors projection algorithms Approximation error

来源：评论

学校读者我要写书评

暂无评论

projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions

引用

OPTIMIZATION METHODS & SOFTWARE 2011年第1期26卷 23-46页

作者： Henrion, Didier Malick, Jerome Univ Toulouse CNRS LAAS Toulouse France Czech Tech Univ Fac Elect Engn CR-16635 Prague Czech Republic Univ Grenoble CNRS Lab Jean Kuntzmann Grenoble France

This paper presents a projection-based approach for solving conic feasibility problems. To find a point in the intersection of a cone and an affine subspace, we simply project a point onto this intersection. This projection is computed by dual algorithms operating a sequence of projections onto the cone and generalizing the alternating projection method. We release an easy-to-use Matlab package implementing an elementary dual-projection algorithm. Numerical experiments show that, for solving some semidefinite feasibility problems, the package is competitive with sophisticated conic programming software. We also provide a particular treatment for semidefinite feasibility problems modelling polynomial sum-of-squares decomposition problems.

关键词： convex cones semidefinite programming projection algorithms positive polynomials least-squares problems

来源：评论

学校读者我要写书评

暂无评论

Divide and Concur and Difference-Map BP Decoders for LDPC Codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第2期57卷 786-802页

作者： Yedidia, Jonathan S. Wang, Yige Draper, Stark C. Mitsubishi Elect Res Labs Cambridge MA 02139 USA Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA

The "Divide and Concur" (DC) algorithm introduced by Gravel and Elser can be considered a competitor to the belief propagation (BP) algorithm, in that both algorithms can be applied to a wide variety of constraint satisfaction, optimization, and inference problems. We show that DC can be interpreted as a message-passing algorithm on a "normal" factor graph. The "difference-map" dynamics of the DC algorithm enables it to avoid "traps" which may be related to the "trapping sets" or "pseudo-codewords" that plague BP decoders of low-density parity check (LDPC) codes in the error-floor regime. We investigate two decoders for LDPC codes based on these ideas. The first decoder is based directly on DC, while the second decoder borrows the important "difference-map" concept from the DC algorithm and translates it into a BP-like decoder. We show that this "difference-map belief propagation" (DMBP) decoder has dramatically improved error-floor performance compared to standard BP decoders, while maintaining a similar computational complexity. We present simulation results for LDPC codes comparing DC and DMBP decoders with other decoders based on sum-product BP, linear programming, and mixed-integer linear programming. We also describe the close relation of the DMBP decoder to reweighted min-sum algorithms, including those recently proposed by Ruozzi and Tatikonda.

关键词： Belief propagation (BP) error floors graphical models iterative algorithms low-density parity check (LDPC) decoding projection algorithms reweighted max-product reweighted min-sum

来源：评论

学校读者我要写书评

暂无评论

A Proportionate Affine projection Algorithm Using Dichotomous Coordinate Descent Iterations

A Proportionate Affine Projection Algorithm Using Dichotomou...

引用

10th International Symposium on Signals, Circuits and Systems (ISSCS)

作者： Stanciu, Cristian Anghel, Cristian Paleologu, Constantin Benesty, Jacob Albu, Felix Ciochina, Silviu Univ Politehn Bucuresti Telecommun Dept Bucharest Romania Univ Quebec INRS EMT Montreal PQ Canada

ISBN: (纸本)9781457702013

This paper proposes a low-complexity proportionate affine projection algorithm (PAPA) suitable for echo cancellation. It is known that proportionate-type algorithms exploit the sparseness character of the echo path in order to achieve faster convergence and tracking as compared to the conventional algorithms. The proposed algorithm results as a combination between a recently proposed "memory"-PAPA (MPAPA) and an iterative technique for solving the matrix inversion problem, i.e., the dichotomous coordinate descent (DCD) with a leading element. Simulations performed in the context of network echo cancellation indicate the good performance of the proposed algorithm.

关键词： Complexity theory Context Convergence Echo cancellers History projection algorithms Speech convergence dichotomous coordinate descent Iterations echo path echo suppression iterative methods low-complexity proportionate affine projection algorithm matrix inversion matrix inversion problem memory proportionate affine projection algorithm network echo cancellation tracking

来源：评论

学校读者我要写书评

暂无评论

Uninformative variable elimination for improvement of successive projections algorithm on spectral multivariable selection with different calibration algorithms for the rapid and non-destructive determination of protein content in dried laver

引用

ANALYTICAL METHODS 2011年第8期3卷 1790-1796页

作者： Wu, Di Chen, Xiaojing Zhu, Xiangou Guan, Xiaochun Wu, Guichu Wenzhou Univ Coll Phys & Elect Engn Informat Chashan Univ Town Wenzho 325035 Zhejiang Prov Peoples R China Zhejiang Univ Coll Biosyst Engn & Food Sci Hangzhou 310058 Zhejiang Peoples R China

The potential of using partial least square based uninformative variable elimination algorithm (UVEPLS) on successive projections algorithm (SPA) for spectral multivariable selection was evaluated. A case study was done on the visible and shortwave-near infrared (Vis-SNIR) spectroscopy for the rapid and non-destructive determination of protein content in dried laver. Three calibration algorithms, namely multiple linear regression (MLR), partial least square regression (PLS) and least-square support vector machine (LS-SVM), were used for the model establishment based on the selected variables of SPA, UVEPLS and UVEPLS-SPA, respectively. A total of 175 samples were prepared for the calibration (n = 117) and prediction (n = 58) sets. The performances of different pretreatments were compared. Both linear calibration algorithms of MLR and PLS and non-linear calibration algorithms of LS-SVM with linear kernel and RBF kernel obtained similar results based on certain variable selection strategies of SPA, UVEPLS and UVEPLS-SPA. The average improvement percentage of RPD values of four calibration algorithms was 38.66% by calculating SPA on UVEPLS processed variables. Therefore there was much improvement of using UVEPLS on SPA spectral multivariable selection with both linear and nonlinear calibration algorithms in this case. Moreover, the RPD values of both linear and non-linear models based on the thirteen selected variables of UVEPLS-SPA show that coarse quantitative predictions of the protein determination in dried laver is possible based on Vis-SNIR spectra. We hope that the results obtained in this study will help both further chemometric (multivariate selection and calibration analysis) investigations and investigations in the sphere of applied vibrational (Near infrared, Mid-infrared and Raman) spectroscopy of sophisticated multicomponent systems.

关键词： protein content Multivariable projection algorithms algorithms non-destructive Nori protein determination Variable

来源：评论

学校读者我要写书评

暂无评论

Mpemba-Like Behavior in Carbon Nanotube Resonators

引用

METALLURGICAL AND MATERIALS TRANSACTIONS A-PHYSICAL METALLURGY AND MATERIALS SCIENCE 2011年第13期42A卷 3907-3912页

作者： Greaney, P. Alex Lani, Giovanna Cicero, Giancarlo Grossman, Jeffrey C. MIT Dept Mat Sci & Engn Cambridge MA 02139 USA Ecole Polytech Solides Irradies Lab F-91128 Palaiseau France Polytech Torino INFM I-10129 Turin Italy Polytech Torino Dept Phys I-10129 Turin Italy

Surprising Mpemba-like dissipation is observed during computer simulated ring-down of the flexural modes of a single-walled carbon nanotube resonator. Vibrations are made to decay to zero faster by adding a larger initial excitation. We liken this counterintuitive observation to the well-known Mpemba effect in which hot water freezes faster that cold water. In both cases, the system seems to pose a memory of its thermal history;a paradoxical result that is reconciled if the dissipative state of the system is not described uniquely by the system's average temperature. A vibrational mode projection algorithm is used to track the dissipation pathway, showing that dissipation is dependent strongly on the development of an athermal phonon population. The implications of Mpemba-like behavior in more general, and continuously driven, nanomechanical systems are discussed.

关键词： thermal history flexural mode Resonator Device Component ring-down Computers Depletion Carbon Nanotubes Vibrations modes projection algorithms cold water

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：