Filters








19,103 Hits in 4.2 sec

Automatic autoprojection of higher order recursive equations

Anders Bondorf
1991 Science of Computer Programming  
It is based on a closure analysis [34] , which for any application point finds the set of lambda abstractions that can possibly be applied at tnat point.  ...  To exemplify this, we present arid partially evaluate four versions of an interpreter for a lambda calculus language: one written in direct style, one written in continuation passing style, one implementing  ...  Acknowledgements This work has been carried out within the Similix project, a joint work of Olivier Danvy and the author.  ... 
doi:10.1016/0167-6423(91)90035-v fatcat:egpqlshmyjbatkqvgt6xgxutbm

Selectors Make Set-Based Analysis Too Hard

Philippe Meunier, Robert Bruce Findler, Paul Steckler, Mitchell Wand
2005 Higher-Order and Symbolic Computation  
We demonstrate this claim with a full-fledged value flow analysis for case-lambda, a multi-branched version of lambda.  ...  We show how both the theoretical underpinnings and the practical implementation become too complex.  ...  for the two parts of the pair represented, or (case-λ (( . . .) ) . . .) compound labels, representing the flow of case-lambda abstractions, and containing a label for each parameter and body for each  ... 
doi:10.1007/s10990-005-4876-5 fatcat:kq6aodgq5bf2jf5l7h2jy6d2me

Automatic autoprojection of higher order recursive equations [chapter]

Anders Bondorf
1990 Lecture Notes in Computer Science  
However, a strong limitation in Lambda-mix is that static parameters of recursive functions must be induction variables [Aho, Sethi, & Ullman 86]; non-inductive variables are always dynamic.  ...  are user specified (as introduced in [Consel 88]), i.e. there is no fixed set of primitives; residual programs never duplicate computations (cf. call duplication [Sestoft 88a]); residual programs do not  ...  Acknowledgements This work has been carried out within the Similix project, a joint work of Olivier Danvy and the author. I am most grateful to Olivier for his many comments and proposals.  ... 
doi:10.1007/3-540-52592-0_56 fatcat:xpawd7jw4jfshgcncmom3eao5m

Nonlinear Growth Models in Mplusand SAS

Kevin J. Grimm, Nilam Ram
2009 Structural Equation Modeling  
The opinions expressed are those of the authors and do not represent views of the Department of Education and National Institute of Health.  ...  Kevin Grimm was also supported by the Institute of Education Sciences, U.S. Department of Education, through Grant R305B040049 to the University of Virginia when he was at that institution.  ...  , we specify a second phantom variable (phantom2), label its mean 'lambda,' and fix its variance and covariances to zero.  ... 
doi:10.1080/10705510903206055 pmid:23882134 pmcid:PMC3717396 fatcat:drylpa4tpvc3hhkisauerihnay

Data Clustering with a Relational Push-Pull Model

Adam Anthony, Marie desJardins
2007 Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007)  
We use simulated annealing to search for optimal values of the unknown model parameters, where the objective function is a Bayesian score derived from the generative model.  ...  Results describing the performance of the model are shown with artificial data as well as a subset of the Internet Movie Database.  ...  Experiment 2: Fixing the Lambda Matrix Instead of allowing inference of the lambda matrix at each iteration, these trials keep the parameter matrix fixed.  ... 
doi:10.1109/icdmw.2007.61 dblp:conf/icdm/Anthonyd07 fatcat:mkrjexyo6zbqlezvfqjanto5iu

A Sketch-Based System for Semantic Parsing [article]

Zechang Li, Yuxuan Lai, Yuxi Xie, Yansong Feng, Dongyan Zhao
2019 arXiv   pre-print
Specifically, we decompose the process into three stages: the sketch classification determines the high-level structure while the entity labeling and the matching network fill in missing details.  ...  The sketch is a high-level structure of the logical form exclusive of low-level details such as entities and predicates. In this way, we are able to optimize each part individually.  ...  Acknowledgements This work is supported in part by the NSFC (Grant No.61672057, 61672058, 61872294), the National Hi-Tech R&D Program of China (No. 2018YFB1005100).  ... 
arXiv:1909.00574v2 fatcat:75jrjm5b65hwtfr3ntedylo2vq

A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus

Gerald Penn
2004 Electronical Notes in Theoretical Computer Science  
Some basic properties of this construction are also presented, and some complexity issues related to parsing with Lambek Categorial Grammars are discussed.  ...  A graph-theoretic construction for representing the derivational side-conditions in the construction of axiomatic linkages for Lambek proof nets is presented, along with a naive algorithm that applies  ...  If is a complex category, then we distinguish Ú by saying it is a lambda-variable. A variable, Ú, that labels a formula Ú is a minus-variable.  ... 
doi:10.1016/s1571-0661(05)82589-7 fatcat:4toncaviwjb3hppeuwzvxo73xa

Volume Segmentation and Analysis of Biological Materials Using SuRVoS (Super-region Volume Segmentation) Workbench

Michele C. Darrow, Imanol Luengo, Mark Basham, Matthew C. Spink, Sarah Irvine, Andrew P. French, Alun W. Ashton, Elizabeth M.H. Duke
2017 Journal of Visualized Experiments  
segmentation using super-and megavoxels, and cryo soft X-ray tomography (cryoSXT) of a mammalian cell line is used to demonstrate the label splitting tools.  ...  When considering the analysis of complex biological systems, the segmentation of three-dimensional image data is a time consuming and labor intensive step.  ...  Parts of this research were supported by the National Institutes of Health (NIH) grant No. (P41GM103832) We acknowledge Diamond Light Source for jointly funding Imanol Luengo under PhD STU0079.  ... 
doi:10.3791/56162 pmid:28872144 pmcid:PMC5614362 fatcat:c3f2ubwpvzdg5k3jbjge7s26na

Datatypes in L2 [chapter]

Nick Chapman, Simon Finn, Michael P. Fourman
1994 Lecture Notes in Computer Science  
We describe the axiomatisation of a subset of Standard ML's datatypes in L2 (the LAMBDA Logic).  ...  The subset includes parameterisation and mutual recursion but has restrictions on the use of function type construction. We sketch a set-theoretic model for these datatypes.  ...  Acknowledgements Our treatment builds on the work of Matt Fairtlough [1] and we are grateful to Matt for many useful discussions.  ... 
doi:10.1007/3-540-58450-1_39 fatcat:4gprnirchneuxkiutnr2spafn4

Lipid droplets as ubiquitous fat storage organelles in C. elegans

Shaobing O Zhang, Rhonda Trimble, Fengli Guo, Ho Mak
2010 BMC Cell Biology  
Moreover, we show that the recently developed post-fix Nile Red staining method labels lipid droplets exclusively.  ...  Nile Red labelled-lipid droplets are characterized by a fluorescence emission spectrum distinct from that of Nile Red labelled-LROs.  ...  This work was supported by the Stowers Institute for Medical Research and in part by Research Grant 5-FY07-662 from the March of Dimes Foundation.  ... 
doi:10.1186/1471-2121-11-96 pmid:21143850 pmcid:PMC3004847 fatcat:4lipvhwytbaabhxeftleqmxix4

Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products

Kai Bergermann, Martin Stoll, Toni Volkmer
2021 SIAM Journal on Mathematics of Data Science  
transform enable the rapid treatment of large and high-dimensional data sets.  ...  While all presented numerical experiments can be run on an average laptop computer, the linear dependence per iteration step of the runtime on the network size in all stages of our algorithm makes it scalable  ...  Since the parameter m \mathrm{ \mathrm{ \mathrm{ \mathrm{ and the bandwidth N only depend on the desired accuracy, we have a computational complexity of \scrO (n) for fixed d and fixed accuracy.  ... 
doi:10.1137/20m1352028 fatcat:3wrtqnekbnghllv6anwq5lk3wa

Learning to rank using gradient descent

Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, Greg Hullender
2005 Proceedings of the 22nd international conference on Machine learning - ICML '05  
We describe the system that won Track 1 of the Yahoo! Learning to Rank Challenge.  ...  We would also like to thank the organizers of the Yahoo! Learning to Rank Challenge for their work in running the competition.  ...  Acknowledgments We thank our other team members, Ofer Dekel and John Platt: Ofer for providing the highly optimized version of the LambdaMART code that we used, and John for a discussion leading to the  ... 
doi:10.1145/1102351.1102363 dblp:conf/icml/BurgesSRLDHH05 fatcat:gtfv2cq6sreqvnrqwye5p4jvuq

Hybrid-Lambda: simulation of multiple merger and Kingman gene genealogies in species networks and species trees [article]

Sha Zhu, James H Degnan, Sharyn J Goldstien, Bjarki Eldon
2015 biorxiv/medrxiv   pre-print
As an illustration, we apply Hybrid-Lambda to infer the time of subdivision of certain marine invertebrates under different coalescent processes.  ...  There has been increasing interest in coalescent models which admit multiple mergers of ancestral lineages; and to model hybridization and coalescence simultaneously.  ...  Hybrid-Lambda makes it possible to investigate the effect of high fecundity on biogeographic concordance among species that exhibit high fecundity and high offspring mortality, including in complex demagraphic  ... 
doi:10.1101/023465 fatcat:eozb6viq4zalverymnp2oym6pu

Hybrid-Lambda: simulation of multiple merger and Kingman gene genealogies in species networks and species trees

Sha Zhu, James H. Degnan, Sharyn J. Goldstien, Bjarki Eldon
2015 BMC Bioinformatics  
As an illustration, we apply Hybrid-Lambda to infer the time of subdivision of certain marine invertebrates under different coalescent processes.  ...  There has been increasing interest in coalescent models which admit multiple mergers of ancestral lineages; and to model hybridization and coalescence simultaneously.  ...  Hybrid-Lambda makes it possible to investigate the effect of high fecundity on biogeographic concordance among species that exhibit high fecundity and high offspring mortality, including in complex demagraphic  ... 
doi:10.1186/s12859-015-0721-y pmid:26373308 pmcid:PMC4571064 fatcat:gnkiwlhxbfht3otqopb4repqju

Control-Flow Analysis with SAT Solvers [chapter]

Steven Lyde, Matthew Might
2014 Lecture Notes in Computer Science  
efficiency of the encoding.  ...  The results of the encodings are then compared to those of a traditional implementation on several example programs.  ...  -Not all lambdas are compatible. Although the example shows lambda terms with only one parameter, the lambda terms can have any number of parameters.  ... 
doi:10.1007/978-3-642-45340-3_8 fatcat:zf7siwahgrcsno2lec6lii5l5e
« Previous Showing results 1 — 15 out of 19,103 results