Filters








349,955 Hits in 2.4 sec

Towards nominal computation

Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota
2012 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12  
This paper is an attempt at defining computation in nominal sets. We present a rudimentary programming language, called Nλ.  ...  Nominal sets are a different kind of set theory, with a more relaxed notion of finiteness. They offer an elegant formalism for describing λ-terms modulo α-conversion, or automata on data words.  ...  Applying such a coding to the problem domain, one can reduce a nominal computational problem to a classical one.  ... 
doi:10.1145/2103656.2103704 dblp:conf/popl/BojanczykBKL12 fatcat:ghzi2hxx5bgbzb43cuchpqnrie

Towards nominal computation

Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota
2012 SIGPLAN notices  
This paper is an attempt at defining computation in nominal sets. We present a rudimentary programming language, called Nλ.  ...  Nominal sets are a different kind of set theory, with a more relaxed notion of finiteness. They offer an elegant formalism for describing λ-terms modulo α-conversion, or automata on data words.  ...  Applying such a coding to the problem domain, one can reduce a nominal computational problem to a classical one.  ... 
doi:10.1145/2103621.2103704 fatcat:m6jahqo55jeqldapa6vj3js33a

Towards Nominal Context-Free Model-Checking [chapter]

Pierpaolo Degano, Gian-Luigi Ferrari, Gianluca Mezzetti
2013 Lecture Notes in Computer Science  
Some properties of our languages are proved, in particular that emptiness of a context-free nominal language L is decidable, and that the intersection of L with a regular nominal language is still context-free  ...  Two kinds of automata are introduced, for recognising regular and context-free nominal languages. We compare their expressive power with that of analogous proposals in the literature.  ...  Ours is a further step towards developing methods for formally verifying computational systems that handle an unbounded number of resources. This is more and more the case nowadays, e.g.  ... 
doi:10.1007/978-3-642-39274-0_11 fatcat:ry3jwjhbhvgdtnl4jfvtr4nh2y

Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? [chapter]

Stéphane Demri
1999 Lecture Notes in Computer Science  
A nice computational property of the restriction is, for instance, that at any stage of the proof, only a finite number of potential cut-formulae needs to be taken under consideration.  ...  Indeed, we present sequent calculi for fragments of classical logic that are syntactic variants of the sequent calculi for the nominal tense logics.  ...  Our calculi admit a cut rule satisfying the following nice computational properties.  ... 
doi:10.1007/3-540-48754-9_15 fatcat:loffob4lqjay3pjisoltk2fsta

Toward treating English nominals correctly

Richard W. Sproat, Mark Y. Liberman
1987 Proceedings of the 25th annual meeting on Association for Computational Linguistics -  
We describe a program for assigning correct stress contours to nominals in English.  ...  It makes use of idiosyncratic knowledge about the stress behavior of various nominal types and general knowledge about English stress rules.  ...  Madison Avenue, Wall Street, Washington's birthday sale, error correction code logic, steel industry collective bargaining agreement, expensive toxic waste cleanup, windshield wiper blade replacement, computer  ... 
doi:10.3115/981175.981195 dblp:conf/acl/SproatL87 fatcat:n3yypkdycjgpfce4r4sykii7gi

Towards the Lemmatisation of Polish Nominal Syntactic Groups Using a Shallow Grammar [chapter]

Łukasz Degórski
2012 Lecture Notes in Computer Science  
The paper presents, discusses and evaluates a set of tools to lemmatise nominal groups, based on a shallow grammar for Polish.  ...  The tools reach an overall success rate of over 58%, and almost 83% on the nominal groups that are correctly recognised by the grammar.  ...  An example of a group matching this rule is Instytut Podstaw Informatyki Polskiej Akademii Nauk `Institute (of ) Computer Science (of the) Polish Academy (of ) Sciences'.  ... 
doi:10.1007/978-3-642-25261-7_29 fatcat:mhvpiudgi5addgxahcrt7mgp4i

Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas [chapter]

David Carral, Cong Wang, Pascal Hitzler
2013 Lecture Notes in Computer Science  
Extending description logics with so-called nominal schemas has been shown to be a major step towards integrating description logics with rules paradigms.  ...  However, establishing efficient algorithms for reasoning with nominal schemas has so far been a challenge.  ...  Of course, we consider this work only to be a first step towards the development of algorithms for nominal-schema-extended description logics.  ... 
doi:10.1007/978-3-642-39666-3_6 fatcat:wpl6gjquvrdz5epifno4ynggue

Page 244 of Computational Linguistics Vol. 34, Issue 2 [page]

2008 Computational Linguistics  
Computational Linguistics Volume 34, Number 2 where the algorithm starts from the nominalized predicate vi] ("investigation”), and, because it does not have any sisters, it does not add anything to the  ...  It then goes up to its parent NP, and collects its sisters NP (#77 “police”) and DNP (Xf “toward” St “accident” JAI “cause” ff) DE”).  ... 

Mitteilungen der Schweizer Informatik Gesellschaft / 2_2015

2015 Informatik-Spektrum  
TC 10 ( 10 Computer Systems Technology). Nominations are open for this position of Swiss delegate to TC 10 Computer Systems Technology.  ...  TC 13 (Human-Computer Interac- tion). Nominations are open for this position of Swiss delegate to TC 13 Computer Systems Technology.  ... 
doi:10.1007/s00287-015-0886-9 fatcat:pgwmf2andfapxhibnh5wgqk5ma

Page 642 of Journal of Aircraft Vol. 8, Issue 8 [page]

1971 Journal of Aircraft  
In each case, the proposed guidance scheme smoothly “funnels” the aircraft back toward the nominal path and into the nominal final conditions.  ...  Again, the guidance scheme performs very satisfactorily, steering the helicopter back toward the nominal path and eventually into the nominal terminal point.  ... 

CIS Society Officers

2013 IEEE Computational Intelligence Magazine  
Established researchers are in a good position to contribute significantly towards mentoring young colleagues in developing their careers and their activities in an outstanding way so that they will be  ...  For detailed information about these awards and for nomination procedures, please take a look at the Society website: http://cis.ieee.org.  ... 
doi:10.1109/mci.2013.2264227 fatcat:thy5rawb25dntaisgs25ola6fm

Induction of formal concepts by lattice computing techniques for tunable classification

V. G. Kaburlasos, Dept. of Computer and Informatics Engineering, Eastern Macedonia and Thrace Institute of Technology, Kavala, 65404 Greece, L. Moussiades, Dept. of Computer and Informatics Engineering, Eastern Macedonia and Thrace Institute of Technology, Kavala, 65404 Greece
2014 Journal of Engineering Science and Technology Review  
More specifically, a novel Galois connection is introduced toward defining tunable metric distances as well as tunable inclusion measure functions between formal concepts induced from hybrid (i.e., nominal  ...  This work proposes an enhancement of Formal Concept Analysis (FCA) by Lattice Computing (LC) techniques.  ...  In particular, intervals of (Type-1) INs, namely Type-2 INs, might be considered toward computing with words [18] , [23] ; alternative (tunable) measure functions may be considered per nominal data dimension  ... 
doi:10.25103/ijbesar.071.01 fatcat:fhxg3hayezd4zdo64wxib7js2q

A Computer-in-the-Loop Approach for Detecting Bullies in the Classroom [chapter]

Juan F. Mancilla-Caceres, Wen Pu, Eyal Amir, Dorothy Espelage
2012 Lecture Notes in Computer Science  
An on-line computer game has been developed to aid social scientists in observing, in a non-intrusive way, children's behaviors and roles within their peer group.  ...  Reseach in computer science already takes advantage of the availability of this information, but is biased towards visible computer-mediated social networks when friendship nominations are assumed equal  ...  the computer game.  ... 
doi:10.1007/978-3-642-29047-3_17 fatcat:sxxakiz4xrbspbhkrndjvemj24

A Self-Organized Learning Model for Anomalies Detection: Application to Elderly People

Nicolas Verstaevel, Jean-Pierre George, Carole Bernon, Marie-Pierre Gleizes
2018 2018 IEEE 12th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)  
This method first models the Circadian Activity Rhythm of a set of sensors and compares it to a nominal profile to determine variations in patients' activities.  ...  For instance, we can use a simple λ function to compute and update the nominal profile.  ...  towards zero of the difference of computation of the degree of anomaly of the current situation. and [∆ min , ∆ max ], the precision p to reach. 1: Initialize randomly the weights ω * of the oracle 2:  ... 
doi:10.1109/saso.2018.00018 dblp:conf/saso/VerstaevelGBG18 fatcat:6lt2stm7rnhtzmzdxzmp7hg6ea

Towards an Increased Accuracy of Fundamental Properties of Stars: Proposing a Set of Nominal Astrophysical Parameters and Constants

A. Prša, P. Harmanec
2011 Proceedings of the International Astronomical Union  
Here, we propose to adopt a nominal set of fundamental solar parameters that will impose consistency across published works and eliminate systematics that stem from inconsistent values.  ...  Harmanec Proposal We propose to: (a) replace the solar luminosity L and radius R by the nominal values L N and R N that are by definition exact and expressed in SI units; (b) compute stellar masses in  ...  The radii of planets (most notably, Jupiter and Earth) should also be made nominal, and the following values used for extra-solar planet comparison: Jupiter: R = 71492 km, GM J = 126686535(2) km 3 s −2  ... 
doi:10.1017/s1743921311027803 fatcat:5imjyim535bntblegqjjrc7akm
« Previous Showing results 1 — 15 out of 349,955 results