Filters








291,263 Hits in 3.7 sec

Type inference for unique pattern matching

Stijn Vansummeren
2006 ACM Transactions on Programming Languages and Systems  
We continue by solving the type inference problem for both disambiguation strategies, which consists of calculating the set of all subparts of input values a subexpression can match under the given policy  ...  Since regular expressions can be ambiguous in general, different disambiguation policies have been proposed to get a unique matching strategy.  ...  Section 2 introduces regular expression pattern matching, the importance of a disambiguation strategy to get a unique match, and the type inference problem.  ... 
doi:10.1145/1133651.1133652 fatcat:jbhrv3ffyndg5hl6krq4wdrko4

Deciphering epigenomic code for cell differentiation using deep learning

Pengyu Ni, Zhengchang Su
2019 BMC Genomics  
Both the unique histone mark patterns in each cell type and the different patterns of the same histone mark in different cell types are determined by a set of motifs with unique combinations.  ...  Sequence determinants of various histone modification patterns in different cell types can be revealed by comparative analysis of motifs learned in the CNN models for multiple cell types and histone marks  ...  Meng Niu for assisting in preprocessing the original ChIP-seq datasets, and members in the Su Lab for discussion. We also thank Dr. Polansky for providing the T cell Epigenome datasets.  ... 
doi:10.1186/s12864-019-6072-8 pmid:31510916 pmcid:PMC6739944 fatcat:jqusafsdvzgwnkrmk2bns35zbq

Hierarchical fuzzy pattern matching for the regional comparison of land use maps

Conrad Power, Alvin Simms, Roger White
2001 International Journal of Geographical Information Science  
The techniques of unique polygons mapping and hierarchical fuzzy pattern matching, where the maps are compared on both a local and global level, are combined to provide a more robust alternative approach  ...  Local matchings determine the degree of containment of each unique polygon in the template map in terms of fuzzy areal intersections.  ...  local matchings for the unique polygons.  ... 
doi:10.1080/136588100750058715 fatcat:3fm4jphqeza3djzzzt7pdu2m2a

Improving the extraction of complex regulatory events from scientific text by using ontology-based inference

Jung-jae Kim, Dietrich Rebholz-Schuhmann
2011 Journal of Biomedical Semantics  
Second, the system overall reproduces 33.1% of the transcription regulatory events contained in RegulonDB (up to 85.0% precision) and the inference module is required for 93.8% of the reproduced events  ...  Previous approaches associate lexical and syntactic resources with ontologies for the semantic analysis, but fall short in testing the benefits from the use of domain knowledge.  ...  We would also like to thank the anonymous reviewers for their valuable comments.  ... 
doi:10.1186/2041-1480-2-s5-s3 pmid:22166672 pmcid:PMC3239303 fatcat:nhy7mdaqxfcuhb7wf7ilensdcm

Auto-Tag: Tagging-Data-By-Example in Data Lakes [article]

Yeye He, Jie Song, Yue Wang, Surajit Chaudhuri, Vishal Anil, Blake Lassiter, Yaron Goland, Gaurav Malhotra
2021 arXiv   pre-print
Leveraging an index structure built offline using a lightweight scan of the data lake, which is analogous to pre-training in machine learning, Auto-Tag can infer suitable data patterns to best "describe  ...  ., semantic column-types), as the inferred metadata can enable a range of downstream applications like data governance (e.g., GDPR compliance), and dataset search.  ...  infer values of the form "CID-12345" to be a unique data-type, but cannot be sure of its meaning).  ... 
arXiv:2112.06049v1 fatcat:whuruisogvekdnysftdjvle4e4

Symbolic abstract data type inference

Michael Emmi, Constantin Enea
2016 SIGPLAN notices  
Matching Scheme Inference Our solution to the ADT inference problem relies on identifying faithful matching schemes for ADT implementations.  ...  The Symbolic ADT Inference Problem In this section we formalize a notion of abstract data type and define the corresponding refinement and inference problems.  ... 
doi:10.1145/2914770.2837645 fatcat:ecbh6wpntva2bdxdz56trhafee

Symbolic abstract data type inference

Michael Emmi, Constantin Enea
2016 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016  
Matching Scheme Inference Our solution to the ADT inference problem relies on identifying faithful matching schemes for ADT implementations.  ...  The Symbolic ADT Inference Problem In this section we formalize a notion of abstract data type and define the corresponding refinement and inference problems.  ... 
doi:10.1145/2837614.2837645 dblp:conf/popl/EmmiE16 fatcat:ig4d7tr43zcglmuw6n7rulpzzi

A Reflexive and Automated Approach to Syntactic Pattern Matching in Code Transformations

Jason Lecerf, John Brant, Thierry Goubier, Stephane Ducasse
2018 2018 IEEE International Conference on Software Maintenance and Evolution (ICSME)  
While this knowledge is time consuming to master, the syntax of the language, on the other hand, is already well known to developers and can serve as a strong foundation for pattern matching.  ...  This approach allows one to directly implement such patterns on any parser generated by a parser generation framework, without asking the pattern writer to learn the AST structure and node types.  ...  Inferred typing Inferred typing refers to approaches where patterns describe the syntax of what should be matched instead of its node type.  ... 
doi:10.1109/icsme.2018.00052 dblp:conf/icsm/LecerfBGD18 fatcat:jj2jg2is5fhw5epolap44p4ka4

Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description) [chapter]

Brigitte Pientka, Jana Dunfield
2010 Lecture Notes in Computer Science  
Our test suite includes standard examples such as the Church-Rosser theorem, type uniqueness, proofs about compiler transformations, and preservation and progress for various ML-like languages.  ...  Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules.  ...  Since our pattern match proceeds on typing derivations, we want the second component, written #q.2. The pattern match on d also establishes that E = #q.1 and S = T.  ... 
doi:10.1007/978-3-642-14203-1_2 fatcat:pcc5n6yoa5ajzds65jt6mhps4q

XDuce

Haruo Hosoya, Benjamin C. Pierce
2003 ACM Transactions on Internet Technology  
XDuce is a statically typed programming language for XML processing.  ...  XDuce also provides a flexible form of regular expression pattern matching, integrating conditional branching, tag checking, and subtree extraction, as well as dynamic typechecking.  ...  Note that the above assumption for keys guarantees that the entry yielded by this pattern match is unique.  ... 
doi:10.1145/767193.767195 fatcat:bnk4rkn6aramvgstqeypeyinoa

The Polymorphic Rewriting-calculus

Luigi Liquori, Benjamin Wack
2005 Electronical Notes in Theoretical Computer Science  
The Rho-calculus features higher-order functions (from Lambda-calculus) and pattern-matching (from Term Rewriting Systems).  ...  In this paper, we study extensively a second-order Rho-calculusà la Church (RhoF) that enjoys subject reduction, type uniqueness, and decidability of typing.  ...  The authors are sincerely grateful to Claude Kirchner for many fruitful discussions and invaluable comments about this work, and the anonymous referees for their extremely useful comments.  ... 
doi:10.1016/j.entcs.2004.06.027 fatcat:wqqg4fspfndbbctdn6ju4iaf4u

Unique Pattern Matching in Strings [article]

Stijn Vansummeren
2003 arXiv   pre-print
We continue by solving the associated type inference problem, which consists in calculating for every subexpression the set of words the subexpression can still match when these policies are in effect,  ...  It is in this context that the first and longest match policies have been proposed to disambiguate the pattern matching process.  ...  Acknowledgments I thank Jan Van den Bussche, Dirk Leinders, Wim Martens and Frank Neven for inspiring discussions and for their comments on a draft version of this paper.  ... 
arXiv:cs/0302004v1 fatcat:6sd5o5dn4ffhpkbcjt4yml7c6i

"Automating Identification of Unique Patterns, Mutation in Human DNA using Artificial Intelligence Technique"

B. Mukunthan, Author N.Nagaveni
2011 International Journal of Computer Applications  
In this novel approach the perfect blend made of bioinformatics and neural networks technique results in efficient DNA pattern analysis algorithm with utmost prediction accuracy of unique repeated patterns  ...  and mutation, computed by number of correct identification of the target for a set of given inputs.  ...  ACKNOWLEDGEMENT We like to thank Senior Scientist, Dr.K.Thangarasu of Bio-Rad Laborataries, Banaglore, India and Dr.K.Somasundaram of Amirtha University, Coimbatore, India for their assistance in conducting  ... 
doi:10.5120/3003-4038 fatcat:bwa7bv4u5nejpmzpq64jwlgl6u

Sensitivities and Specificities of Spoligotyping and Mycobacterial Interspersed Repetitive Unit-Variable-Number Tandem Repeat Typing Methods for Studying Molecular Epidemiology of Tuberculosis

A. N. Scott, D. Menzies, T.-N. Tannenbaum, L. Thibert, R. Kozak, L. Joseph, K. Schwartzman, M. A. Behr
2005 Journal of Clinical Microbiology  
The specificities of these tests were estimated as the percentages of isolates with unique IS6110 fingerprints that had unique spoligotypes and MIRU-VNTR types.  ...  The proportion of isolates estimated to be due to recent transmission was 4% by identical IS6110 patterns, 19% by near-identical IS6110 patterns, 33% by MIRU-VNTR typing, and 53% by spoligotyping.  ...  ACKNOWLEDGMENTS We thank Patrick Belisle, Dao Nguyen, Michael Purdy, and Jennifer Westley for technical assistance.  ... 
doi:10.1128/jcm.43.1.89-94.2005 pmid:15634955 pmcid:PMC540143 fatcat:rmx5bpldijdx5dvcv5eilc6eua

Excerpts from the TXL Cookbook [chapter]

James R. Cordy
2011 Lecture Notes in Computer Science  
In this paper we attempt to approach this difficulty for the TXL language in a non-traditional way -by introducing the paradigms of use for each kind of problem directly.  ...  The difficulty is not that these very general systems are ill-suited to the solution of the problems, it is that the paradigms for solving them using combinations of the system's language features are  ...  For example, the TXL variable N1 in the pattern of the following rule will match any item of type [ When the pattern is matched, variable names are bound to the corresponding item of their type in the  ... 
doi:10.1007/978-3-642-18023-1_2 fatcat:qtdvuzuzwzh5dfrnahzchbndm4
« Previous Showing results 1 — 15 out of 291,263 results