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

Workshop on Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems

作者： Ruifeng Xu Jun Xu Xiaolong Wang Key Laboratory of Network Oriented Intelligent Computation Department of Computer Science and Technology Shenzhen Graduate School Harbin Institute of Technology Shenzhen China

ISBN: (纸本)9781618392466

This paper presents two instance-level transfer learning based algorithms for cross lingual opinion analysis by transferring useful translated opinion examples from other languages as the supplementary training data for improving the opinion classifier in target language. Starting from the union of small training data in target language and large translated examples in other languages, the Transfer AdaBoost algorithm is applied to iteratively reduce the influence of low quality translated examples. Alternatively, starting only from the training data in target language, the Transfer Self-training algorithm is designed to iteratively select high quality translated examples to enrich the training data set. These two algorithms are applied to sentence- and document-level cross lingual opinion analysis tasks, respectively. The evaluations show that these algorithms effectively improve the opinion analysis by exploiting small target language training data and large cross lingual training data.

关键词： object oriented programming languages Training data Tongue opinion Transfer (Psychology)

来源：评论

学校读者我要写书评

暂无评论

The UPV-PRHLT combination system for WMT 2011 11

The UPV-PRHLT combination system for WMT 2011

引用

Workshop on statistical machine translation

作者： Jesus Gonzalez-Rubio Francisco Casacuberta Universitat Politècnica de València

ISBN: (纸本)9781937284121

This paper presents the submissions of the pattern recognition and human language technology (PRHLT) group to the system combination task of the sixth workshop on statistical machine translation (WMT 2011). Each submissions is generated by a multi-system minimum Bayes risk (MBR) technique. Our technique uses the MBR decision rule and a linear combination of the component systems' probability distributions to search for the minimum risk translation among all the sentences in the target language.

关键词： object oriented programming languages Pattern recognition Linear Combination TSPO gene Structural Elements (Construction) decision rule Adjudication machine translation minimum statistical distribution Probability distribution Bayes

来源：评论

学校读者我要写书评

暂无评论

Scala for generic programmers Comparing Haskell and Scala support for generic programming

引用

JOURNAL OF FUNCTIONAL programming 2010年第3-4期20卷 303-352页

作者： Oliveira, Bruno C. D. S. Gibbons, Jeremy Seoul Natl Univ ROSAEC Ctr Seoul 151744 South Korea Univ Oxford Comp Lab Oxford OX1 3QD England

Datatype-generic programming (DGP) involves parametrization of programs by the shape of data, in the form of type constructors such as 'list of'. Most approaches to DGP are developed in pure functional programming languages such as Haskell. We argue that the functional object-oriented language Scala is in many ways a better choice. Not only does Scala provide equivalents of all the necessary functional programming features (such as parametric polymorphism, higher-order functions, higher-kinded type operations, and type- and constructor-classes), but it also provides the most useful features of object-oriented languages (such as subtyping, overriding, traditional single inheritance, and multiple inheritance in the form of traits). Common Haskell techniques for DGP can be conveniently replicated in Scala, whereas the extra expressivity provides some important additional benefits in terms of extensibility and reuse. We illustrate this by comparing two simple approaches in Haskell, pointing out their limitations and showing how equivalent approaches in Scala address some of these limitations. Finally, we present three case studies on how to implement in Scala real DGP approaches from the literature: Hinze's 'Generics for the Masses', Lammel and Peyton Jones's 'Scrap your Boilerplate with Class', and Gibbons's 'Origami programming'.

关键词： object oriented programming languages reuse programming Equivalent extensibility parameterization Inheritance Functional programming

来源：评论

学校读者我要写书评

暂无评论

On the observational theory of the CPS-calculus

引用

ACTA INFORMATICA 2010年第2期47卷 111-132页

作者： Merro, Massimo Univ Verona Dipartimento Informat I-37134 Verona Italy

We apply powerful proof-techniques of concurrency theory to study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition system from which we derive a (weak) labelled bisimilarity that completely characterises Morris' context-equivalence. We prove a context lemma showing that Morris' context-equivalence coincides with a simpler context-equivalence closed under a smaller class of contexts. Then we profit of the determinism of the CPS-calculus to give a simpler labelled characterisation of Morris' equivalence, in the style of Abramsky's applicative bisimilarity. We enhance our bisimulation proof-methods with up to bisimilarity and up to context proof techniques. We use our bisimulation proof techniques to investigate a few algebraic properties on diverging terms that cannot be proved using the original axiomatic semantics of the CPS-calculus.

关键词： Determinism concurrency theory object oriented programming languages Proof Fate axiomatics

来源：评论

学校读者我要写书评

暂无评论

Generic Rules for Logic Representation Transformations

Generic Rules for Logic Representation Transformations

引用

IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR)

作者： Chirila, Ciprian-Bogdan Jebelean, Calin Kniesel, Guenter Lahire, Philippe Univ Politehn Timisoara Automat & Comp Sci Fac Timisoara Romania Univ Bonn Comp Sci Dept 3 Bonn Germany Univ Nice Fac Sci Comp Sci Dept Nice France

ISBN: (纸本)9781424467259

Programs expressed using logic representations can be more easily analysed and transformed. Transformations will depend on the target language semantics. A field encapsulation refactorization will be different for a Java program and an Eiffel program. Logic based representations of programs and its metamodel allows writing generic rules capable of performing some language independent transformations like: syntactical and semantical checking, searching specific nodes, cloning node structures, replacing references, generating fact visualizations. An example is given in this sense related to the implementation of feature body exheritance mechanism of reverse inheritance class relationship in the context of Eiffel language.

关键词： Formal logic Metamodels object oriented programming languages Line of nodes Language

来源：评论

学校读者我要写书评

暂无评论

Multilingual Subjectivity: Are More languages Better? 10

Multilingual Subjectivity: Are More Languages Better?

引用

International conference on computational linguistics

作者： Carmen Banea Rada Mihalcea JanyceWiebe University of North Texas University of Pittsburgh

ISBN: (纸本)9787302234562

While subjectivity related research in other languages has increased, most of the work focuses on single languages. This paper explores the integration of features originating from multiple languages into a machine learning approach to subjectivity analysis, and aims to show that this enriched feature set provides for more effective modeling for the source as well as the target languages. We show not only that we are able to achieve over 75% macro accuracy in all of the six languages we experiment with, but also that by using features drawn from multiple languages we can construct high-precision meta-classifiers with a precision of over 83%.

关键词： Language Subjectivity object oriented programming languages cargo

来源：评论

学校读者我要写书评

暂无评论

USING CROSS-DECODER PHONE COOCURRENCES IN PHONOTACTIC LANGUAGE RECOGNITION

USING CROSS-DECODER PHONE COOCURRENCES IN PHONOTACTIC LANGUA...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Mikel Penagarikano Amparo Varona Luis Javier Rodriguez-Fuentes German Bordel GTTS Department of Electricity and Electronics University of the Basque Country Spain

ISBN: (纸本)9781424442959

Phonotactic language recognizers are based on the ability of phone decoders to produce phone sequences containing acoustic, phonetic and phonological information, which is partially dependent on the language. Input utterances are decoded and then scored by means of models for the target languages. Commonly, various decoders are applied in parallel and fused at the score level. A kind of complementarity effect is expected when fusing scores, since each decoder is assumed to extract different (and complementary) information from the input utterance. This assumption is supported by the performance improvements attained when fusing systems. However, decodings are processed in a fully uncoupled way, their time alignment (and the information that may be extracted from it) being completely lost. In this paper, a simple approach is proposed, which takes into account time alignment information, by considering cross-decoder phone coocurrences at the frame level. To evaluate the approach, a choice of open software (BUT front-end and phone decoders, SRI-LM toolkit, libSVM, FoCal) is used, and experiments are carried out on the NIST LRE2007 database. Adding phone coocurrences to the baseline phonotactic systems provides slight performance improvements, revealing the potential benefit of using cross-decoder dependencies for language modeling.

关键词： Language Recognition Phone Decoding Phone Coocurrence Telephone decoders temporal registration language recognition performance boost frame level Open Software modelling languages front-ends object oriented programming languages Language

来源：评论

学校读者我要写书评

暂无评论

Automated Translation of Semantic Relationships 10

Automated Translation of Semantic Relationships

引用

International conference on computational linguistics

作者： Dmitry Davidov Ari Rappoport Hebrew University of Jerusalem

ISBN: (纸本)9787302234562

We present a method for translating semantic relationships between languages where relationships are defined as pattern clusters. Given a pattern set which represents a semantic relationship, we use the web to extract sample term pairs of this relationship. We automatically translate the obtained term pairs using multilingual dictionaries and disambiguate the translated pairs using web counts. Finally we discover the set of most relevant target language patterns for the given relationship. The obtained pattern set can be utilized for extraction of new relationship examples for the target language. We evaluate our method on 11 diverse target languages. To assess the quality of the discovered relationships, we use an automatically generated cross-lingual SAT analogy test, WordNet relationships, and concept-specific relationships, achieving high precision. The proposed framework allows fully automated cross-lingual relationship mining and construction of multilingual pattern dictionaries without relying on parallel corpora.

关键词： object oriented programming languages Web search engines Automatic translation Semantics Language Dictionaries as Topic AUTOMATIC solidification

来源：评论

学校读者我要写书评

暂无评论

Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages

引用

JOURNAL OF FUNCTIONAL programming 2009年第5期19卷 509-543页

作者： Carette, Jacques Kiselyov, Oleg Shan, Chung-Chieh McMaster Univ Hamilton ON L8S 4L8 Canada Rutgers State Univ Piscataway NJ 08855 USA

We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, generalized algebraic data types, or postprocessing to eliminate tags. The statically type-preserving interpretations include an evaluator, a compiler (or staged evaluator), a partial evaluator, and call-by-name and call-by-value continuation-passing style (CPS) transformers. Our principal technique is to encode de Bruijn or higher-order abstract syntax using combinator functions rather than data constructors. In other words, we represent object terms not in an initial algebra but using the coalgebraic structure of the lambda-calculus. Our representation also simulates inductive maps from types to types, which are required for typed partial evaluation and CPS transformations. Our encoding of an object term abstracts uniformly over the family of ways to interpret it, yet statically assures that the interpreters never get stuck. This family of interpreters thus demonstrates again that it is useful to abstract over higher-kinded types.

关键词： post-treatment data types Computer programming languages interpreters object oriented programming languages coding Language family

来源：评论

学校读者我要写书评

暂无评论

Scala and Lift - Functional Recipes for the Web

引用

IEEE INTERNET COMPUTING 2009年第3期13卷 88-92页

作者： Ghosh, Debasish Vinoski, Steve Anshinsoft Verivue

Today, there's significant interest in functional languages and frameworks that fit the Web better than imperative languages. We explore Scala, an OO-functional language on the Java virtual machine, and Lift, a framework implemented on Scala's functional features. The Scala language offers functional programming features and asynchronous message-passing concurrency alongside a statically typed model. Lift exploits this model to offer secure, higher-level abstractions to Web developers.

关键词： Internet Java concurrency control functional languages functional programming message passing object-oriented languages object-oriented programming virtual machines Java virtual machine Lift Scala World Wide Web asynchronous message-passing concurrency higher-level abstractions object-oriented-functional language actor closure functional Web functional language pattern match Pattern matching object oriented programming Functional programming World Wide Web Internets Concurrency control level of abstraction object oriented programming languages Java Virtual Machine (JVM) actor lift message passing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：