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

Building Sense Tagged Corpus Using Wikipedia for Supervised Word Sense Disambiguation

Procedia computer science 2018年 123卷 403-412页

作者： Abdulgabbar Saif Nazlia Omar Ummi Zakiah Zainodin Mohd Juziaddin Ab Aziz Computer-Math Department Faculty of Applied Sciences Thamar University Yemen Center for Artificial Intelligence Technology Faculty of Information Science & Technology Universiti Kebangsaan Malaysia Malaysia

Building of sense-tagged data is a main challenge for supervised techniques that achieved promising results in word sense disambiguation. The manual building of sense-tagged data is a labor and a time-consuming task because each ambiguous word has to be labeled in collected contexts by linguistic experts. Therefore, this paper proposes a knowledge-based method for building the Arabic sense-tagged corpus from Wikipedia. The method starts with mapping Arabic WordNet and Wikipedia to select the Wikipedia article for the corresponding sense in WordNet. In this mapping step, the cross-lingual method is used to measure the similarity between features of a Wikipedia article and a WordNet sense separately. Then, the incoming-links of Wikipedia articles are exploited to extract instances for the sense of each ambiguous word in WordNet. For handling the lack of instances of some articles in Wikipedia, the multiword-based technique is proposed to increase a number of instances for each concept. Experimental results show that the cross-lingual method outperforms monolingual method that is based on Arabic features only. The sense-tagged corpus is created for 50 ambiguous words yielding 148 senses with 30,961 instances.

关键词： Word Sense Disambiguation Wikipedia Arabic WordNet Alignment Text Processing Similarity Measures

来源：评论

学校读者我要写书评

暂无评论

Via-aware global routing for good VLSI manufacturability and high yield

Via-aware global routing for good VLSI manufacturability and...

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Yang Yang Tong Jing Xianlong Hong Yu Hu Qi Zhu Xiaodong Hu Guiying Yan Computer Science & Technology Department Tsinghua University Beijing China EECS Department Berkeley USA Inst Applied Math CAS Beijing China

CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called system-on-a-chip (SOC), in which physical design tool is an essential and critical part. We try to consider the via minimization problem as early as possible in physical design. We propose a routing method focusing on minimizing vias while considering mutability and wire-length constraint. That is, in the global routing phase, we minimize the number of bends, which is closely related to the number of vias. Previous work only dealt with very small nets, but our algorithm is general for the nets with any size. Experimental results show that our algorithm can greatly reduce the count of bends for various sizes of nets while meeting the constraints of congestion and wire-length.

关键词： Routing Very large scale integration Minimization Design automation System-on-a-chip Circuit optimization computer aided manufacturing computer science Integrated circuit technology Content addressable storage

来源：评论

学校读者我要写书评

暂无评论

Amplification and percolation (probabilistic Boolean functions)

Amplification and percolation (probabilistic Boolean functio...

引用

Annual IEEE Symposium on Foundations of computer science

作者： M. Dubiner U. Zwick Department of Applied Math Tel-Aviv University Tel-Aviv Israel Department of Computer Science Tel-Aviv University Tel-Aviv Israel

The authors extend R.B. Boppana's results (1989) in two ways. They first show that his two lower bounds hold for general read-once formulae, not necessarily monotone, that may even include exclusive-or gates. They are then able to join his two lower bounds together and show that any read-once, not necessarily monotone, formula that amplifies (p-/sup 1///sub n/,p+/sup 1///sub n/) to (2/sup -n/,1-2/sup -n/) has size of at least Omega (n/sup alpha +2/). This result does not follow from Boppana's arguments and it shows that the amount of amplification achieved by L.G. Valiant (1984) is the maximal achievable using read-once formulae.< >

关键词： Boolean functions computer science Relays computer network reliability Polynomials Circuit simulation

来源：评论

学校读者我要写书评

暂无评论

Time Varying Nonlinear Policy Gradients

Time Varying Nonlinear Policy Gradients

引用

IEEE Annual Conference on Decision and Control

作者： Evangelos A. Theodorou Krishnamurthy Dvijotham Emo Todorov School of Aerospace Engineering Georgia Institute of Technology Atlanta Department of Computer Science and Engineering University of Washington Seattle Departments of Computer Science and Engineering and Applied Math University of Washington Seattle

ISBN: (纸本)9781467357159

We derive Policy Gradients(PGs) with time varying parameterizations for nonlinear diffusion processes affine in noise. The resulting policies have the form of reward weighted gradient. The analysis is in continuous time and includes the case of linear and nonlinear parameterizations. Examples on stochastic control problems for diffusions processes are provided.

关键词： Trajectory Linear programming Noise Diffusion processes Aerodynamics Educational institutions Equations

来源：评论

学校读者我要写书评

暂无评论

No feasible interpolation for TC/sup 0/-Frege proofs

No feasible interpolation for TC/sup 0/-Frege proofs

引用

Annual IEEE Symposium on Foundations of computer science

作者： M.L. Bonet T. Pitassi R. Raz Department of LSI Universidad Politécnica de Cataluña Barcelona Spain Department of Computer Science University of Arizona Tucson USA Department of Applied Math Weizmann Institute of Science USA

The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this paper, we show that this method cannot be used to obtain lower bounds for Frege systems, or even for TC/sup 0/-Frege systems. More specifically, we show that unless factoring is feasible, neither Frege nor TC/sup 0/-Frege has the feasible interpolation property. In order to carry out our argument, we show how to carry out proofs of many elementary axioms/theorems of arithmetic in polynomial-size TC/sup 0/-Frege. In particular, we show how to carry out the proof for the Chinese Remainder Theorem, which may be of independent interest. As a corollary, we obtain that TC/sup 0/-Frege as well as any proof system that polynomially simulates it, is not automatizable (under a hardness assumption).

关键词： Interpolation Polynomials Circuits Arithmetic Artificial intelligence Business process re-engineering Radio access networks Large scale integration computer science Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Improving Dense Linear Equation Solver on Hybrid CPU-GPU System

Improving Dense Linear Equation Solver on Hybrid CPU-GPU Sys...

引用

International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

作者： Zhichao Cao Shiming Xu Wei Xue Wenguang Chen Department Computer Science & Technology Tsinghua University Beijing China Delft Institute Applied Math Technical University Delft Delft Netherlands

In recent years, GPU (Graphic Processor Unit) has become an import accelerator for conventional applications. User has to program in GPU-based environments, such as CUDA, and it usually requires detailed tuning for good performances. Also since GPU has high Single Precision (SP) performance while its Double Precision (DP) performance falls short, it has limited application in scientific computing. In this paper, our algorithm aims at accelerating the solving of dense linear equation on hybrid CPU-GPU system. We adopt iterative refinement to utilize the high SP capability of GPUs while achieving DP precision requirements. Specifically, we implement algorithm with utilize both GPU and CPU for computation-intensive parts by overlapping computations. Its performance reaches up to 236 GFLOP/s, which is by far better than the result achieved by DP-only algorithms.

关键词： Equations Iterative algorithms Linear systems Graphics Scientific computing Performance analysis Algorithm design and analysis Parallel processing Acceleration Numerical stability

来源：评论

学校读者我要写书评

暂无评论

Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

Approximating the value of two power proof systems, with app...

引用

Israel Symposium on the Theory of Computing and Systems

作者： U. Feige M. Goemans Department of Applied Mathematics and Computer Sci Weizmann Institute of Science Rehovot Israel Department of Math M.I.T. Cambridge MA USA

It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this paper, we show that two prover proof systems are also convenient starting points for establishing easiness of approximation results. Our approach combines the Feige-Lovasz (STOC92) semidefinite programming relaxation of one-round two-prover proof systems, together with rounding techniques for the solutions of semidefinite programs, as introduced by Goemans and Williamson (STOC94). As a consequence of our approach, we present improved approximation algorithms for MAX 2SAT and MAX DICUT. The algorithms are guaranteed to deliver solutions within a factor of 0.931 of the optimum for MAX 2SAT and within a factor of 0.859 for MAX DICUT, improving upon the guarantees of 0.878 and 0.796 of Goemans and Williamson (1994).< >

关键词： Contracts Approximation algorithms Liver National electric code Prototypes Polynomials

来源：评论

学校读者我要写书评

暂无评论

Administration and academic staff performance management system using content management system (CMS) technologies

Administration and academic staff performance management sys...

引用

International Conference on Electronics, computer and Computation (ICECCO)

作者： Moussa Mahamat Boukar Isa Muslu Department of Computer Science Nigerian Turkish Nile University Abuja Nigeria Department of Applied Math. International Ataturk Alatoo University Bishkek Kyrgyzstan

Content management systems (CMS) provide an optimal solution by organizing information and, mostly, creating and managing an enterprises knowledge. This paper aims to construct an interactive dynamic system base on CMS technologies, on which a range of problems concerning the administration and academic aspects of a university management system can be analyzed and certain policies for overcoming these problems can be tested and improved. This pilot was developed to explore the versatility of content management system (CMS) and to use the technology of CMS as precursor to handle content of a full blown automation of administration and academic performance management system.

关键词： Content management Educational institutions Instruments Information management Automation Companies

来源：评论

学校读者我要写书评

暂无评论

Asynchronous resource discovery in peer to peer networks

Asynchronous resource discovery in peer to peer networks

引用

Reliable Distributed Systems

作者： S. Kutten D. Peleg Faculty of Industrial Engineering & Management Technion-Israel Institute of Technology Haifa Israel Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network (e.g., an Internet site). A vertex (peer) can communicate with another vertex directly if and only if it knows a certain routing information to that other vertex. Hence, it is critical for peers to convey this routing information to each other. The problem was formalized by Harchol-Balter et al. (1999). The routing information needed for a vertex to reach another peer is that peer's identifier (e.g., IP address). A logical directed edge represents the fact that the peer at the tail of the edge knows the IP address of the one at its head. A number of algorithms were developed by Harchol-Balter et al. for this problem in the model of a synchronous network over a weakly connected directed graph. The best of these algorithms was randomized. Subsequently, a deterministic algorithm for the problem on synchronous networks with improved complexity was presented by Kutten et al. (2001). The current paper extends this deterministic algorithm to the environment of asynchronous networks, maintaining similar complexities (translated to the asynchronous model). These are lower than the complexities that would be needed to synchronize the system. The main technical difficulty in a directed, weakly connected system is to ensure that vertices take consistent steps, even if their knowledge about each other is not symmetric, and even if there is no timeout mechanism (which does exist in synchronous systems) to assist in that.

关键词： Intelligent networks Routing Web server IP networks Context Tail Peer to peer computing Internet computer industry computer network management

来源：评论

学校读者我要写书评

暂无评论

Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs

Low Acceptance Agreement Tests via Bounded-Degree Symplectic...

引用

Annual IEEE Symposium on Foundations of computer science

作者： Yotam Dikstein Irit Dinur Alexander Lubotzky Computer Science and Discrete Mathematics Institute for Advanced Study Princeton New Jersey USA Dept. of Applied Math and Computer Science The Weizmann Institute of Science Rehovot Israel Department of Mathematics The Weizmann Institute of Science Rehovot Israel

ISBN: (数字)9798331516741

ISBN: (纸本)9798331516758

We solve the derandomized direct product testing question in the low acceptance regime, by constructing new high dimensional expanders that have no small connected covers. We show that our complexes have swap cocycle expansion, which allows us to deduce the agreement theorem by relying on previous work. Derandomized direct product testing, also known as agreement testing, is the following problem. Let $X$ be a family of k-element subsets of $[N]$ and let $\{f_{s}:s\rightarrow\Sigma\vert s\in X\}$ be an ensemble of local functions, each defined over a subset $s\subset\lceil N$ . Suppose that we run the following so-called agreement test: choose a random pair of sets $s_{1}, s_{2}\in X$ that intersect on $\sqrt{k}$ elements, and accept if $f_{s_{1}}, f_{s_{2}}$ agree on the elements in $s_{1}\cap s_{2}$ . We denote the success probability of this test by Agree $\{f_{s}\})$ Given that Agree $(\{f_{s}\})=\varepsilon > 0$ is there a global function $G:[N]\rightarrow\Sigma$ such that $f_{s}=G\vert _{s}$ for a non-negligible fraction of $s\in X\ ?$ We construct a family $X$ of k-subsets of $[N]$ such that $\vert X\vert =O(N)$ , and such that it satisfies the low acceptance agreement theorem. Namely, $\text{Agree}\left(\left\{f_s\right\}\right)>\varepsilon \Longrightarrow \exists G:[N] \rightarrow \Sigma, \quad \underset{s}{\mathbb{P}}\left[\left.f_s \stackrel{0.99}{\approx} G\right\vert_s\right] \geqslant \text{poly}(\varepsilon)$ . A key idea is to replace the well-studied LSV complexes by symplectic high dimensional expanders (HDXs). The family $X$ is just the k-faces of the new symplectic HDXs. The latter serve our needs better since their fundamental group satisfies the congruence subgroup property, which implies that they lack small covers. We also give a polynomial-time algorithm to construct this family of sym-plectic HDXs.

关键词： computer science Testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：