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

12th International Conference on Recent Advances in Natural Language Processing, RANLP 2019

作者： Ansari, Ebrahim Žabokrtský, Zdeněk Mahmoudi, Mohammad Haghdoost, Hamid Vidra, Jonáš Institute of Formal and Applied Linguistics Faculty of Mathematics and Physics Charles University Czech Republic Department of Computer Science and Information Technology Institute for Advanced Studies in Basic Sciences Iran

ISBN: (纸本)9789544520557

Morphological segmentation of words is the process of dividing a word into smaller units called morphemes;it is tricky especially when a morphologically rich or polysynthetic language is under question. In this work, we designed and evaluated several Recurrent Neural Network (RNN) based models as well as various other machine learning based approaches for the morphological segmentation task. We trained our models using annotated segmentation lexicons. To evaluate the effect of the training data size on our models, we decided to create a large hand-annotated morphologically segmented corpus of Persian words, which is, to the best of our knowledge, the first and the only segmentation lexicon for the Persian language. In the experimental phase, using the hand-annotated Persian lexicon and two smaller similar lexicons for Czech and Finnish languages, we evaluated the effect of the training data size, different hyper-parameters settings as well as different RNN-based models. © 2019 Association for Computational Linguistics (ACL). All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

A constructive algorithm for the Lovász Local Lemma on permutations

A constructive algorithm for the Lovász Local Lemma on perm...

引用

25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014

作者： Harris, David G. Srinivasan, Aravind Department of Applied Mathematics University of Maryland College Park MD 20742 United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park MD 20742 United States

ISBN: (纸本)9781611973389

While there has been significant progress on algorithmic aspects of the Lovasz Local Lemma (LLL) in recent years, a noteworthy exception is when the LLL is used in the context of random permutations: The "lopsided" version of the LLL is usually at play here, and we do not yet have subexponential-time algorithms. We resolve this by developing a randomized polynomial-time algorithm for such applications. A noteworthy application is for Latin Transversals: The best-known general result here (Bissacot et al., improving on Erdos and Spencer), states that any n × n matrix in which each entry appears at most (27/256)n times, has a Latin transversal. We present the first polynomial-time algorithm to construct such a transversal. Our approach also yields RNC algorithms: for Latin transversals, as well as the first efficient ones for the strong chromatic number and (special cases of) acyclic edge-coloring. Copyright © 2014 by the Society for Industrial and applied mathematics.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Improved bounds and algorithms for graph cuts and network reliability

Improved bounds and algorithms for graph cuts and network re...

引用

25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014

ISBN: (纸本)9781611973389

Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial approximation scheme to estimate the probability that a graph G becomes disconnected, given that its edges are removed independently with probability p. This algorithm runs in O(n5+o(1)Ε-3) time to obtain an estimate within relative error e. We improve this runtime in two key ways, one algorithmic and one graph-theoretic. From an algorithmic point of view, there is a certain key sub-problem encountered by Karger, for which a generic estimation procedure is employed. We show that this sub-problem has a special structure for which a much more efficient algorithm can be used. From a graph-theoretic point of view, we show better bounds on the number of edge cuts which are likely to fail. Karger's analysis depends on bounds for various graph parameters;we show that these bounds cannot be simultaneously tight. We describe a new graph parameter, which simultaneously influences all the bounds used by Karger, and use it to obtain much tighter estimates of the behavior of the cuts of G. These techniques allow us to improve the runtime to n 3+o(1)Ε-2, which is essentially best-possible for the meta-approach proposed by Karger;our results also rigorously prove certain experimental observations of Karger & Tai (Proc. ACM-SIAM Symposium on Discrete Algorithms, 1997). A key driver of Karger's approach (and other cut- related results) is his earlier bound on the number of small cuts: we also show how to improve this when the min-cut size is "small" and odd, augmenting, in part, a result of Bixby (Bull. AMS, 1974). Copyright © 2014 by the Society for Industrial and applied mathematics.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Algorithmic and enumerative aspects of the moser-tardos distribution 27

Algorithmic and enumerative aspects of the moser-tardos dist...

引用

27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016

作者： Harris, David G. Srinivasan, Aravind Department of Applied Mathematics University of Maryland College ParkMD20742 United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States

ISBN: (纸本)9781510819672

Moser & Tardos have developed a powerful algorithmic approach (henceforth "MT") to the Lovasz Local Lemma (LLL);the basic operation done in MT and its variants is a search for "bad" events in a current configuration. In the initial stage of MT, the variables are set independently. We examine the distributions on these variables which arise during intermediate stages of MT. We show that these configurations have a more or less "random" form, building further on the "MT-distribution" concept of Haeu-pler et al. in understanding the (intermediate and) output distribution of MT. This has a variety of algorithmic applications;the most important is that bad events can be found relatively quickly, improving upon MT across the complexity spectrum: it makes some polynomial-time algorithms sub-linear (e.g., for Latin transversals, which are of basic combinatorial interest), gives lower-degree polynomial run-times in some settings, transforms certain super-polynomial-time algorithms into polynomial-time ones, and leads to Las Vegas algorithms for some coloring problems for which only Monte Carlo algorithms were known. We show that in certain conditions when the LLL condition is violated, a variant of the MT algorithm can still produce a distribution which avoids most of the bad events. We show in some cases this MT variant can run faster than the original MT algorithm itself, and develop the first-known criterion for the case of the asymmetric LLL. This can be used to find partial Latin transversals-improving upon earlier bounds of Stein (1975)-among other applications. We furthermore give applications in enumeration, showing that most applications (where we aim for all or most of the bad events to be avoided) have many. © Copyright (2016) by SIAM: Society for Industrial and applied mathematics.

关键词： Mathematical transformations

来源：评论

学校读者我要写书评

暂无评论

Solving semantic problems in" chaff and winnowing" by using cryptography

Solving semantic problems in" chaff and winnowing" by using ...

引用

2007 International Conference on Security and Management, SAM'07

作者： Mohamadrezaei, Sara Bigham, Bahram Sadeghi Department of Information Technology Institute for Advanced Studies in Basic Sciences Zanjan Iran Department of Applied Mathematics Faculty of Mathematics and Computer Science Amirkabir University of Technology No. 424 Hafez Ave. Tehran Iran

ISBN: (纸本)1601320485

The need to secure the Internet is clear to everyone consequently more and more mechanisms to provide security and enhance it at different layers and different applications are being developed. Thus we want to introduce a new and secure method in network security. In this article at first we will survey" chaff and winnowing" method and cryptography method. Then we will discuss about their advantages and disadvantages and we will introduce a new method which it can solve the "chaff and winnowing" method's semantic challenges and make cryptography method safer. This new method uses the advantages of both methods and tries to omit the disadvantages of before methods to make a secure method for general using. Also this method is efficiency in confidentially and authentication problems.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Partial resampling to approximate covering integer programs 27

Partial resampling to approximate covering integer programs

引用

27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016

作者： Chen, Antares Harris, David G. Srinivasan, Aravind University of California Berkeley United States Department of Applied Mathematics University of Maryland College ParkMD20742 United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States

ISBN: (纸本)9781510819672

We consider positive covering integer programs, which generalize set cover and which have attracted a long line of research developing (randomized) approximation algorithms. Srinivasan (2006) gave a rounding algorithm based on the FKG inequality for systems which are "column-sparse." This algorithm may return an integer solution in which the variables get assigned large (integral) values;Kol-liopoulos & Young (2005) modified this algorithm to limit the solution size, at the cost of a worse approximation ratio. We develop a new rounding scheme based on the Partial Resampling variant of the Lovasz Local Lemma developed by Harris k. Srinivasan (2013). This achieves an approximation ratio of 1 + in(δ1+1)/αmin+O)√log;(δ1+1/αmin) minimum covering constraint and δ1 is the maximum -norm of any column of the covering matrix (whose entries are scaled to lie in [0, 1]);we also show nearly-matching inapproximability and integrality-gap lower bounds. Our approach improves asymptotically, in several different ways, over known results. First, it replaces δo, the maximum number of nonzeroes in any column (from the result of Srinivasan) by δ1 which is always-and can be much-smaller than δo;this is the first such result in this context. Second, our algorithm automatically handles multi-criteria programs;we achieve improved approximation ratios compared to the algorithm of Srinivasan, and give, for the first time when the number of objective functions is large, polynomial-time algorithms with good multi-criteria approximations. We also significantly improve upon the upper-bounds of Kolliopoulos & Young when the integer variables are required to be within (1 + ∈) of some given upper-bounds, and show nearly-matching inapproximability. © Copyright (2016) by SIAM: Society for Industrial and applied mathematics.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution 16

Algorithmic and Enumerative Aspects of the Moser-Tardos Dist...

引用

Annual ACM-Society for Industrial and applied Mathmatics Symposium on Discrete Algorithms

作者： David G. Harris Aravind Srinivasan Department of Applied Mathematics University of Maryland Department of Computer Science and Institute for Advanced Computer Studies University of Maryland

ISBN: (纸本)9781510819672

Moser & Tardos have developed a powerful algorithmic approach (henceforth "MT") to the Lovasz Local Lemma (LLL); the basic operation done in MT and its variants is a search for "bad" events in a current configuration. In the initial stage of MT, the variables are set independently. We examine the distributions on these variables which arise during intermediate stages of MT. We show that these configurations have a more or less "random" form, building further on the "MT-distribution" concept of Haeupler et al. in understanding the (intermediate and) output distribution of MT. This has a variety of algorithmic applications; the most important is that bad events can be found relatively quickly, improving upon MT across the complexity spectrum: it makes some polynomial-time algorithms sub-linear (e.g., for Latin transversals, which are of basic combinatorial interest), gives lower-degree polynomial run-times in some settings, transforms certain super-polynomialtime algorithms into polynomial-time ones, and leads to Las Vegas algorithms for some coloring problems for which only Monte Carlo algorithms were known. We show that in certain conditions when the LLL condition is violated, a variant of the MT algorithm can still produce a distribution which avoids most of the bad events. We show in some cases this MT variant can run faster than the original MT algorithm itself, and develop the first-known criterion for the case of the asymmetric LLL. This can be used to find partial Latin transversals - improving upon earlier bounds of Stein (1975) - among other applications. We furthermore give applications in enumeration, showing that most applications (where we aim for all or most of the bad events to be avoided) have many more solutions than known before by proving that the MT-distribution has "large" Renyi entropy and hence that its support-size is large.

关键词： Lovasz Local Lemma Moser-Tardos algorithm LLL-distribution MT-distribution Graph coloring Satisfiability Latin transversals Combinatorial enumeration machine translation MT colored graph computability low light algorithms

来源：评论

学校读者我要写书评

暂无评论

A constructive algorithm for the Lovasz Local Lemma on permutations 14

A constructive algorithm for the Lovasz Local Lemma on permu...

引用

Annual ACM-Society for Industrial and applied Mathmatics Symposium on Discrete Algorithms

作者： David G. Harri Aravind Srinivasan Department of Applied Mathematics University of Maryland Department of Computer Science and Institute for Advanced Computer Studies University of Maryland

ISBN: (纸本)9781611973389

While there has been significant progress on algorithmic aspects of the Lovasz Local Lemma (LLL) in recent years, a noteworthy exception is when the LLL is used in the context of random permutations: the "lopsided" version of the LLL is usually at play here, and we do not yet have sub-exponential-time algorithms. We resolve this by developing a randomized polynomial-time algorithm for such applications. A noteworthy application is for Latin Transversals: the best-known general result here (Bissacot et al., improving on Erdos and Spencer), states that any n × n matrix in which each entry appears at most (27=256)n times, has a Latin transversal. We present the first polynomial-time algorithm to construct such a transversal. Our approach also yields RNC algorithms: for Latin transversals, as well as the first efficient ones for the strong chromatic number and (special cases of) acyclic edge-coloring.

关键词： low light Constructive Algorithm Permutation Transverse Lemma Latin algorithms

来源：评论

学校读者我要写书评

暂无评论

Paddy Plant Disease Recognition, Risk Analysis, and Classification Using Deep Convolution Neuro-Fuzzy Network

引用

Journal of Mobile Multimedia 2022年第2期18卷 325-348页

作者： Vinoth Kumar, V. Karthick Raghunath, K.M. Rajesh, N. Venkatesan, Muthukumaran Joseph, Rose Bindu Thillaiarasu, N. School of Computer Science and Engineering Jain (Deemed to be University) Bangalore India Department of Computer Science and Engineering MVJ College of Engineering Bangalore India University of Technology and Applied Science Shinas Oman Department of mathematics School of Applied Sciences REVA University Karnataka Bengaluru India Department of Mathematics Christ Academy Institute for Advanced Studies Bangalore India School of Computing and Information Technology REVA University Bengaluru India

A significant number of the world’s population is dependent on rice for survival. In addition to sugarcane and corn, rice is said to be the third most growing staple food in the world. As a consequence of intensive usage of man-made fertilizers, paddy plant diseases have also risen at a faster pace in current history. Exploring the possible disease spread and classifying to detect the consequent impact at an early stage will prevent the loss and improve rice production. The core task of this research is to recognize and quantify different kinds of infections (disease) affecting the paddy plant crop, such as brown spots, bacterial blight, and leaf blasts. Both detection and recognition are carried out based on the risk analysis of paddy crop leaf images. We suggest a Deep Convolutional Neuro-Fuzzy Method (DCNFM) that combines one of the advanced machine learning variant, namely deep convolutional neural networks (DCNNs) and uncertainty handler called fuzzy logic. The synthesis has the benefits of both fuzzy logic and DCNNs when dealing with unstructured data, extracting essential features from imprecise and ambiguous datasets. From the crop field, continuous image data are captured through image sensors and fed as a primary input to the proposed model to analyze the risk and then later to classify them for precise recognition/detection of the disease. The detection/recognition rate of the DCNFM is found to be 98.17% which is comparatively found to be effective in comparison with the traditional CNN model. © 2021 River Publishers

关键词： Accuracy Blast Bronzing Convolution neuro-fuzzy Crown rot Disease classification Head blight Paddy

来源：评论

学校读者我要写书评

暂无评论

Multi-layered vector spaces for classifying and analyzing biological sequences

Multi-layered vector spaces for classifying and analyzing bi...

引用

3rd International Conference on Bioinformatics and Computational Biology 2011, BICoB 2011

作者： Akkoç, Can Johnsten, Tom Benton, Ryan Institute of Applied Mathematics Middle East Technical University Ankara Turkey School of Computer and Info Sciences University of South Alabama Mobile AL United States Center for Advanced Computer Studies University of Louisiana at Lafayette Lafayette LA United States University of South Alabama Department of Mathematics and Statistics Mobile AL United States

ISBN: (纸本)9781617823886

A finite sequence drawn from a finite alphabet is disassembled into m-step ordered pairs with pair elements separated by m steps. Allowing multiple values for m=1, 2, , k leads to a multiplicity of ordered pairs that function as building blocks in the construction of multi-layered feature vectors to represent the sequence. Index positions of the leading elements in each ordered pair serve as scalar components of the feature vector for capturing spatial/temporal structures at the local level. Such representation provides a fertile mathematical space in data mining for discovering potentially interesting patterns in sequential data. Experiments on the classification problem involving two classes, Eukaryota and Euglenozoa returned encouraging results, with 96% overall accuracy in identifying the class for each bio-sequence in the two groups.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：