Relevant bibliographies by topics / Pattern expressions

Academic literature on the topic 'Pattern expressions'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Pattern expressions.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Pattern expressions"

1

Câmpeanu, Cezar, and Sheng Yu. "Pattern expressions and pattern automata." Information Processing Letters 92, no. 6 (December 2004): 267–74. http://dx.doi.org/10.1016/j.ipl.2004.09.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sakaba, Hiroko, and Takeshi Okada. "Usage Patterns and Meanings of High-Frequency English Verbs: A Multi-Word Expression Approach to Japanese High School EFL Textbook Analysis." International Journal of Applied Linguistics and English Literature 10, no. 4 (July 31, 2021): 116. http://dx.doi.org/10.7575/aiac.ijalel.v.10n.4p.116.

Full text
Abstract:
This article aims to classify the overall uses of high-frequency English verbs in a novel methodology from both a pattern and meaning perspective, which has not be done in previous studies, with special reference to TAKE and MAKE. In the pattern-based analysis, all occurrences of these two verbs were collected from Japanese EFL textbook corpus, and the usage patterns of the extracted two target verbs were categorized into three major multi-word expression types: phrasal verbs, grammatical collocations, and lexical collocations. To further investigate the patterns of uses, some multi-word units consisting of three to seven words were identified as either semi-fixed expressions or fixed expressions. After the pattern-based classification, all the multi-word expressions identified were analyzed from a semantic perspective. This analysis revealed the new finding that all uses of TAKE (352) and MAKE (374) obtained from the corpus could be successfully classified into the three major multi-word expression categories. With respect to the pattern, the proportion of major multi-word expression categories showed similar results; lexical collocations were the most frequent, and phrasal verbs were the least frequent in both target verbs’ usage. In terms of meanings, the uses of TAKE were classified in a larger number of semantic categories (42) than MAKE (25). The obtained results have an implication that the novel methodology employed in this study is a valid way to the further investigation of the usage of high-frequency English verbs.
APA, Harvard, Vancouver, ISO, and other styles
3

Pan, Xiaoyi, Boyu Chen, Heng Weng, Yongyi Gong, and Yingying Qu. "Temporal Expression Classification and Normalization From Chinese Narrative Clinical Texts: Pattern Learning Approach." JMIR Medical Informatics 8, no. 7 (July 27, 2020): e17652. http://dx.doi.org/10.2196/17652.

Full text
Abstract:
Background Temporal information frequently exists in the representation of the disease progress, prescription, medication, surgery progress, or discharge summary in narrative clinical text. The accurate extraction and normalization of temporal expressions can positively boost the analysis and understanding of narrative clinical texts to promote clinical research and practice. Objective The goal of the study was to propose a novel approach for extracting and normalizing temporal expressions from Chinese narrative clinical text. Methods TNorm, a rule-based and pattern learning-based approach, has been developed for automatic temporal expression extraction and normalization from unstructured Chinese clinical text data. TNorm consists of three stages: extraction, classification, and normalization. It applies a set of heuristic rules and automatically generated patterns for temporal expression identification and extraction of clinical texts. Then, it collects the features of extracted temporal expressions for temporal type prediction and classification by using machine learning algorithms. Finally, the features are combined with the rule-based and a pattern learning-based approach to normalize the extracted temporal expressions. Results The evaluation dataset is a set of narrative clinical texts in Chinese containing 1459 discharge summaries of a domestic Grade A Class 3 hospital. The results show that TNorm, combined with temporal expressions extraction and temporal types prediction, achieves a precision of 0.8491, a recall of 0.8328, and a F1 score of 0.8409 in temporal expressions normalization. Conclusions This study illustrates an automatic approach, TNorm, that extracts and normalizes temporal expression from Chinese narrative clinical texts. TNorm was evaluated on the basis of discharge summary data, and results demonstrate its effectiveness on temporal expression normalization.
APA, Harvard, Vancouver, ISO, and other styles
4

Ding, Wentao, Guanji Gao, Linfeng Shi, and Yuzhong Qu. "A Pattern-Based Approach to Recognizing Time Expressions." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 6335–42. http://dx.doi.org/10.1609/aaai.v33i01.33016335.

Full text
Abstract:
Recognizing time expressions is a fundamental and important task in many applications of natural language understanding, such as reading comprehension and question answering. Several newest state-of-the-art approaches have achieved good performance on recognizing time expressions. These approaches are black-boxed or based on heuristic rules, which leads to the difficulty in understanding the temporal information. On the contrary, classic rule-based or semantic parsing approaches can capture rich structural information, but their performances on recognition are not so good. In this paper, we propose a pattern-based approach, called PTime, which automatically generates and selects patterns for recognizing time expressions. In this approach, time expressions in training text are abstracted into type sequences by using fine-grained token types, thus the problem is transformed to select an appropriate subset of the sequential patterns. We use the Extended Budgeted Maximum Coverage (EBMC) model to optimize the pattern selection. The main idea is to maximize the correct token sequences matched by the selected patterns while the number of the mistakes should be limited by an adjustable budget. The interpretability of patterns and the adjustability of permitted number of mistakes make PTime a very promising approach for many applications. Experimental results show that PTime achieves a very competitive performance as compared with existing state-of-the-art approaches.
APA, Harvard, Vancouver, ISO, and other styles
5

PEYTON JONES, SIMON. "3 Expressions." Journal of Functional Programming 13, no. 1 (January 2003): 17–38. http://dx.doi.org/10.1017/s0956796803000510.

Full text
Abstract:
3.1 Errors 193.2 Variables, Constructors, Operators, and Literals 203.3 Curried Applications and Lambda Abstractions 213.4 Operator Applications 213.5 Sections 223.6 Conditionals 233.7 Lists 233.8 Tuples 243.9 Unit Expressions and Parenthesized Expessions 253.10 Arithmetic Sequences 253.11 List Comprehensions 253.12 Let Expressions 273.13 Case Expressions 273.14 Do Expressions 293.15 Datatypes with Field Labels 293.16 Expression Type Signatures 323.17 Pattern Matching 32
APA, Harvard, Vancouver, ISO, and other styles
6

강현화. "A study on correlation between pattern expressions and Regret expressions." Bilingual Research ll, no. 38 (October 2008): 43–68. http://dx.doi.org/10.17296/korbil.2008..38.43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Volynets, Sofia, Dmitry Smirnov, Heini Saarimäki, and Lauri Nummenmaa. "Statistical pattern recognition reveals shared neural signatures for displaying and recognizing specific facial expressions." Social Cognitive and Affective Neuroscience 15, no. 8 (August 2020): 803–13. http://dx.doi.org/10.1093/scan/nsaa110.

Full text
Abstract:
Abstract Human neuroimaging and behavioural studies suggest that somatomotor ‘mirroring’ of seen facial expressions may support their recognition. Here we show that viewing specific facial expressions triggers the representation corresponding to that expression in the observer’s brain. Twelve healthy female volunteers underwent two separate fMRI sessions: one where they observed and another where they displayed three types of facial expressions (joy, anger and disgust). Pattern classifier based on Bayesian logistic regression was trained to classify facial expressions (i) within modality (trained and tested with data recorded while observing or displaying expressions) and (ii) between modalities (trained with data recorded while displaying expressions and tested with data recorded while observing the expressions). Cross-modal classification was performed in two ways: with and without functional realignment of the data across observing/displaying conditions. All expressions could be accurately classified within and also across modalities. Brain regions contributing most to cross-modal classification accuracy included primary motor and somatosensory cortices. Functional realignment led to only minor increases in cross-modal classification accuracy for most of the examined ROIs. Substantial improvement was observed in the occipito-ventral components of the core system for facial expression recognition. Altogether these results support the embodied emotion recognition model and show that expression-specific somatomotor neural signatures could support facial expression recognition.
APA, Harvard, Vancouver, ISO, and other styles
8

Jamal, Danial. "أسلوب النداء وتعليلاته النحوية." 'Arabiyya: Jurnal Studi Bahasa Arab 9, no. 1 (June 29, 2020): 15. http://dx.doi.org/10.47498/arabiyya.v9i1.344.

Full text
Abstract:
In Arabic, every sentence containing certain expression has a unique pattern that is different from one another. And what is more unique is the reasoning aspect, where the reasoning aspect seems complicated, so it tends to be considered insignificant dan ignored. Amongst the expressions in Arabic which are full of unique patterns and their reasoning side are calling expressions (Uslub al-Nida’). The purpose of this paper is to reveal the uniqueness of the patterns contained in the calling expressions in Arabic along with the reasoning aspect which sometimes makes the Native Arabic Speakers moreover Non-Arabic Speakers trapped in some errors and confusion in saying them.
APA, Harvard, Vancouver, ISO, and other styles
9

Zheng, Wei Hao, Wei Wang, and Yi De Ma. "Facial Expression Recognition Based on the Texture Features of Global Principal Component and Local Boundary." Applied Mechanics and Materials 548-549 (April 2014): 1110–17. http://dx.doi.org/10.4028/www.scientific.net/amm.548-549.1110.

Full text
Abstract:
Facial expression recognition is a key ingredient to either emotion analysis or pattern recognition, which is also an important component in human-machine interaction. In facial expression analysis, one of the well-known methods to obtain the texture of expressions is local binary patterns (LBP) which compares pixels in local region and encodes the comparison result in forms of histogram. However, we argue that the textures of expressions are not accurate and still contain some irrelevant information, especially in the region between eyes and mouth. In this paper, we propose a compound method to recognize expressions by applying local binary patterns to global and local images processed by bidirectional principal component analysis (BDPCA) reconstruction and morphologic preprocess, respectively. It proves that our method can be applied for recognizing expressions by using texture features of global principal component and local boundary and achieves a considerable high accuracy.
APA, Harvard, Vancouver, ISO, and other styles
10

Sun, Cheuk-Kwan, Yen-Yi Zhen, Hung-I. Lu, Pei-Hsun Sung, Li-Teh Chang, Tzu-Hsien Tsai, Jiunn-Jye Sheu, et al. "Reducing TRPC1 Expression through Liposome-Mediated siRNA Delivery Markedly Attenuates Hypoxia-Induced Pulmonary Arterial Hypertension in a Murine Model." Stem Cells International 2014 (2014): 1–19. http://dx.doi.org/10.1155/2014/316214.

Full text
Abstract:
We tested the hypothesis that Lipofectamine siRNA delivery to deplete transient receptor potential cation channel (TRPC) 1 protein expression can suppress hypoxia-induced pulmonary arterial hypertension (PAH) in mice. Adult male C57BL/6 mice were equally divided into group 1 (normal controls), group 2 (hypoxia), and group 3 (hypoxia + siRNA TRPC1). By day 28, right ventricular systolic pressure (RVSP), number of muscularized arteries, right ventricle (RV), and lung weights were increased in group 2 than in group 1 and reduced in group 3 compared with group 2. Pulmonary crowded score showed similar pattern, whereas number of alveolar sacs exhibited an opposite pattern compared to that of RVSP in all groups. Protein expressions of TRPCs, HIF-1α, Ku-70, apoptosis, and fibrosis and pulmonary mRNA expressions of inflammatory markers were similar pattern, whereas protein expressions of antifibrosis and VEGF were opposite to the pattern of RVSP. Cellular markers of pulmonary DNA damage, repair, and smooth muscle proliferation exhibited a pattern similar to that of RVSP. The mRNA expressions of proapoptotic and hypertrophy biomarkers displayed a similar pattern, whereas sarcomere length showed an opposite pattern compared to that of RVSP in all groups. Lipofectamine siRNA delivery effectively reduced TRPC1 expression, thereby attenuating PAH-associated RV and pulmonary arteriolar remodeling.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Pattern expressions"

1

Porcher, Mathieu. "CAMOLUTION : Contemporary surface pattern expressions in textile design." Thesis, Högskolan i Borås, Akademin för textil, teknik och ekonomi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-13028.

Full text
Abstract:
Camolution is a project that explores the camouflage pattern in a textile designcontext. The motive is to reinterpret an obsolete concealment function andinstead, to hide and reveal visual textile aspects within the pattern. Theprimary aim of this work is to develop a contemporary camouflage patterncollection of printed and knitted textiles, and to explore the concealmentfunction through visual deceptions. The patterns were developed witha method that uses a selection of rules in colour contrasts,style influences and textile proprieties to design a series of patternexperiments. The final pattern designs were screen printed, digitalprinted and knitted, and applied as garment prototypes. This part wasdone in collaboration with the fashion brand Björn Borg. The result setsout a collection of textiles and clothes connected by three differentconcepts of misled vision. It was found that the camouflage function in thiswork was an efficient tool to advertise the brand symbols within the textiles.This work proposes an alternative design method of using the camouflageconcept in textile design, contributing with new expressions, techniquesand qualities.
APA, Harvard, Vancouver, ISO, and other styles
2

Ulus, Dogan. "Pattern Matching with Time : Theory and Applications." Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM003/document.

Full text
Abstract:
Les systèmes dynamiques présentent des comportements temporels qui peuvent être exprimés sous diverses formes séquentielles telles que des signaux, des ondes, des séries chronologiques et des suites d'événements. Détecter des motifs sur de tels comportements temporels est une tâche fondamentale pour comprendre et évaluer ces systèmes. Étant donné que de nombreux comportements du système impliquent certaines caractéristiques temporelles, le besoin de spécifier et de détecter des motifs de comportements qui implique des exigences de synchronisation, appelées motifs temporisés, est évidente.Cependant, il s'agit d'une tâche non triviale due à un certain nombre de raisons, notamment la concomitance des sous-systèmes et la densité de temps.La contribution principale de cette thèse est l'introduction et le développement du filtrage par motif temporisé, c'est-à-dire l'identification des segments d'un comportement donné qui satisfont un motif temporisé. Nous proposons des expressions rationnelles temporisées (TRE) et la logique de la boussole métrique (MCL) comme langages de spécification pour motifs temporisés. Nous développons d'abord un nouveau cadre qui abstraite le calcul des aspects liés au temps appelé l'algèbre des relations temporisées. Ensuite, nous fournissons des algorithmes du filtrage hors ligne pour TRE et MCL sur des comportements à temps dense à valeurs discrètes en utilisant ce cadre et étudions quelques extensions pratiques.Il est nécessaire pour certains domaines d'application tels que le contrôle réactif que le filtrage par motif doit être effectué pendant l'exécution réelle du système. Pour cela, nous fournissons un algorithme du filtrage en ligne pour TREs basé sur la technique classique des dérivées d'expressions rationnelles. Nous croyons que la technique sous-jacente qui combine les dérivées et les relations temporisées constitue une autre contribution conceptuelle majeure pour la recherche sur les systèmes temporisés.Nous présentons un logiciel libre Montre qui implémente nos idées et algorithmes. Nous explorons diverses applications du filtrage par motif temporisé par l'intermédiaire de plusieurs études de cas. Enfin, nous discutons des orientations futures et plusieurs questions ouvertes qui ont émergé à la suite de cette thèse
Dynamical systems exhibit temporal behaviors that can be expressed in various sequential forms such as signals, waveforms, time series, and event sequences. Detecting patterns over such temporal behaviors is a fundamental task for understanding and assessing these systems. Since many system behaviors involve certain timing characteristics, the need to specify and detect patterns of behaviors that involves timing requirements, called timed patterns, is evident. However, this is a non-trivial task due to a number of reasons including the concurrency of subsystems and density of time.The key contribution of this thesis is in introducing and developing emph{timed pattern matching}, that is, the act of identifying segments of a given behavior that satisfy a timed pattern. We propose timed regular expressions (TREs) and metric compass logic (MCL) as timed pattern specification languages. We first develop a novel framework that abstracts the computation of time-related aspects called the algebra of timed relations. Then we provide offline matching algorithms for TRE and MCL over discrete-valued dense-time behaviors using this framework and study some practical extensions.It is necessary for some application areas such as reactive control that pattern matching needs to be performed during the actual execution of the system. For that, we provide an online matching algorithm for TREs based on the classical technique of derivatives of regular expressions. We believe the underlying technique that combines derivatives and timed relations constitutes another major conceptual contribution for timed systems research.Furthermore, we present an open-source tool Montre that implements our ideas and algorithms. We explore diverse applications of timed pattern matching over several case studies using Montre. Finally we discuss future directions and several open questions emerged as a result of this thesis
APA, Harvard, Vancouver, ISO, and other styles
3

Hansson, Malin. "Expanding textural expressions of synthetic non-woven." Thesis, Högskolan i Borås, Akademin för textil, teknik och ekonomi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-23898.

Full text
Abstract:
This degree work places itself in the field of textile design within printing and surface design. The primary motive is to explore methods of designing textural expressions of a non-woven polyester fabric which combine relief and printing techniques in order to design textiles with three-dimensional properties. The work explores possibilities on how to bring an aesthetic expression into a synthetic non-woven inlay fabric by using screen print, sublimation print and relief moulding towards an interior context. The purpose is to take advantage of the technical properties such as expansion, softness and stiffness of a non-woven polyester fabric into the design work. The design method consisted of a material-based pre-study to gain knowledge about non-woven materials and their reactions to heat, moulding possibilities and printing options. Further developments were done through workshops that explored frottage as design inspiration for final designs and gradations with halftones as a colouring method. The outcome of this degree work resulted in a collection of three textile pieces; a wall covering, a room divider and a sound absorber that are seen as prototypes for further development on how to give synthetic non-woven textiles an alternative aesthetic expression.
APA, Harvard, Vancouver, ISO, and other styles
4

Meier, Florian. ""beau platt“ : Contemporary Fashion Practice in the field of concrete and virtual visualizations of flat expressions." Thesis, Högskolan i Borås, Akademin för textil, teknik och ekonomi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-13023.

Full text
Abstract:
This work traces the visual potential of 2Dimensional space inthree dimensional garments and questions aesthetic standardsin the field of menswear. The aim is to discuss the visualconsensus of flat and spatial construction. Construction has been chosen as the key aspect for digital and analoginvestigations. It builds the main emphasis of this project and leads toa deeper visual understanding of how we perceive garments with clearborders between three - and two dimensional sections. The design process has a dual structure. 1st stage - ‚virtual investigation‘ This is where the experiments start. By using Simulation andrendering software such as ‚CLO3D‘, ‚Marvellous Designer‘ and ‚Keyshot‘the aim is to develop and unlock multiple constructionprinciples that deal with similar visual aspects. These results suggest anetwork of variations (garment types/parts, e.g. sleeve construction,trousers etc..) that need to be translated into real prototypes. 2nd stage - ‚Analog translation‘ Based on the preferred results of the 1st stage, the aim is to filter oneconstruction principle for further studies.The choice of working with the flat sleeve construction is the keyaspect and builds the fundamental for ellaborating the design process.This phase is mainly characterised by material and shape experimentsand relates to a lasting construction principle. The result suggest a spread of examples that deal with the sameconstruction principle. The examplified versions include differentmaterial qualities and differ in terms of their complexity in detailsolutions and production.The final choice works as a unit and offers different ways ofapproaching and developing the construction principle further.Especially the layering aspect in example 8 and 9 became dominantand very important for increasing the visual expression.That indication offers an imidiate and direct approach and showsthe potential within the field of 2D expressions.Nevertheless my next step would lead me back to the digital studiesto understand more about the diversity of layers in two dimensionalgarments. Eventually it would suggest both a wearable as well as aconceptual outcome.
APA, Harvard, Vancouver, ISO, and other styles
5

Kholgade, Natasha Prashant. "Recognition of human activities and expressions in video sequences using shape context descriptor /." Online version of thesis, 2009. http://hdl.handle.net/1850/10743.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Siau, Nor Zainah. "A teachable semi-automatic web information extraction system based on evolved regular expression patterns." Thesis, Loughborough University, 2014. https://dspace.lboro.ac.uk/2134/14687.

Full text
Abstract:
This thesis explores Web Information Extraction (WIE) and how it has been used in decision making and to support businesses in their daily operations. The research focuses on a WIE system based on Genetic Programming (GP) with an extensible model to enhance the automatic extractor. This uses a human as a teacher to identify and extract relevant information from the semi-structured HTML webpages. Regular expressions, which have been chosen as the pattern matching tool, are automatically generated based on the training data to provide an improved grammar and lexicon. This particularly benefits the GP system which may need to extend its lexicon in the presence of new tokens in the web pages. These tokens allow the GP method to produce new extraction patterns for new requirements.
APA, Harvard, Vancouver, ISO, and other styles
7

Košař, Vlastimil. "Implementace jednotky pro vyhledávání vzorů v FPGA." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237092.

Full text
Abstract:
This term project focuses on algorithms for pattern matching used in modern IDS. The main focus is on regular expression matching. It deals with methods based on deterministic and nondeterministic finite automata, hybrid methods and with method based on regular expressions as programing langue for specialised processors. Implementation of pattern matching units based on some of described methodologies is described in next part. Methodology for resource consumption estimation is also described. Developed software system for unit generation is described in the next part. In the final part results are presented and discused.
APA, Harvard, Vancouver, ISO, and other styles
8

Álvaro, Muñoz Francisco. "Mathematical Expression Recognition based on Probabilistic Grammars." Doctoral thesis, Universitat Politècnica de València, 2015. http://hdl.handle.net/10251/51665.

Full text
Abstract:
[EN] Mathematical notation is well-known and used all over the world. Humankind has evolved from simple methods representing countings to current well-defined math notation able to account for complex problems. Furthermore, mathematical expressions constitute a universal language in scientific fields, and many information resources containing mathematics have been created during the last decades. However, in order to efficiently access all that information, scientific documents have to be digitized or produced directly in electronic formats. Although most people is able to understand and produce mathematical information, introducing math expressions into electronic devices requires learning specific notations or using editors. Automatic recognition of mathematical expressions aims at filling this gap between the knowledge of a person and the input accepted by computers. This way, printed documents containing math expressions could be automatically digitized, and handwriting could be used for direct input of math notation into electronic devices. This thesis is devoted to develop an approach for mathematical expression recognition. In this document we propose an approach for recognizing any type of mathematical expression (printed or handwritten) based on probabilistic grammars. In order to do so, we develop the formal statistical framework such that derives several probability distributions. Along the document, we deal with the definition and estimation of all these probabilistic sources of information. Finally, we define the parsing algorithm that globally computes the most probable mathematical expression for a given input according to the statistical framework. An important point in this study is to provide objective performance evaluation and report results using public data and standard metrics. We inspected the problems of automatic evaluation in this field and looked for the best solutions. We also report several experiments using public databases and we participated in several international competitions. Furthermore, we have released most of the software developed in this thesis as open source. We also explore some of the applications of mathematical expression recognition. In addition to the direct applications of transcription and digitization, we report two important proposals. First, we developed mucaptcha, a method to tell humans and computers apart by means of math handwriting input, which represents a novel application of math expression recognition. Second, we tackled the problem of layout analysis of structured documents using the statistical framework developed in this thesis, because both are two-dimensional problems that can be modeled with probabilistic grammars. The approach developed in this thesis for mathematical expression recognition has obtained good results at different levels. It has produced several scientific publications in international conferences and journals, and has been awarded in international competitions.
[ES] La notación matemática es bien conocida y se utiliza en todo el mundo. La humanidad ha evolucionado desde simples métodos para representar cuentas hasta la notación formal actual capaz de modelar problemas complejos. Además, las expresiones matemáticas constituyen un idioma universal en el mundo científico, y se han creado muchos recursos que contienen matemáticas durante las últimas décadas. Sin embargo, para acceder de forma eficiente a toda esa información, los documentos científicos han de ser digitalizados o producidos directamente en formatos electrónicos. Aunque la mayoría de personas es capaz de entender y producir información matemática, introducir expresiones matemáticas en dispositivos electrónicos requiere aprender notaciones especiales o usar editores. El reconocimiento automático de expresiones matemáticas tiene como objetivo llenar ese espacio existente entre el conocimiento de una persona y la entrada que aceptan los ordenadores. De este modo, documentos impresos que contienen fórmulas podrían digitalizarse automáticamente, y la escritura se podría utilizar para introducir directamente notación matemática en dispositivos electrónicos. Esta tesis está centrada en desarrollar un método para reconocer expresiones matemáticas. En este documento proponemos un método para reconocer cualquier tipo de fórmula (impresa o manuscrita) basado en gramáticas probabilísticas. Para ello, desarrollamos el marco estadístico formal que deriva varias distribuciones de probabilidad. A lo largo del documento, abordamos la definición y estimación de todas estas fuentes de información probabilística. Finalmente, definimos el algoritmo que, dada cierta entrada, calcula globalmente la expresión matemática más probable de acuerdo al marco estadístico. Un aspecto importante de este trabajo es proporcionar una evaluación objetiva de los resultados y presentarlos usando datos públicos y medidas estándar. Por ello, estudiamos los problemas de la evaluación automática en este campo y buscamos las mejores soluciones. Asimismo, presentamos diversos experimentos usando bases de datos públicas y hemos participado en varias competiciones internacionales. Además, hemos publicado como código abierto la mayoría del software desarrollado en esta tesis. También hemos explorado algunas de las aplicaciones del reconocimiento de expresiones matemáticas. Además de las aplicaciones directas de transcripción y digitalización, presentamos dos propuestas importantes. En primer lugar, desarrollamos mucaptcha, un método para discriminar entre humanos y ordenadores mediante la escritura de expresiones matemáticas, el cual representa una novedosa aplicación del reconocimiento de fórmulas. En segundo lugar, abordamos el problema de detectar y segmentar la estructura de documentos utilizando el marco estadístico formal desarrollado en esta tesis, dado que ambos son problemas bidimensionales que pueden modelarse con gramáticas probabilísticas. El método desarrollado en esta tesis para reconocer expresiones matemáticas ha obtenido buenos resultados a diferentes niveles. Este trabajo ha producido varias publicaciones en conferencias internacionales y revistas, y ha sido premiado en competiciones internacionales.
[CAT] La notació matemàtica és ben coneguda i s'utilitza a tot el món. La humanitat ha evolucionat des de simples mètodes per representar comptes fins a la notació formal actual capaç de modelar problemes complexos. A més, les expressions matemàtiques constitueixen un idioma universal al món científic, i s'han creat molts recursos que contenen matemàtiques durant les últimes dècades. No obstant això, per accedir de forma eficient a tota aquesta informació, els documents científics han de ser digitalitzats o produïts directament en formats electrònics. Encara que la majoria de persones és capaç d'entendre i produir informació matemàtica, introduir expressions matemàtiques en dispositius electrònics requereix aprendre notacions especials o usar editors. El reconeixement automàtic d'expressions matemàtiques té per objectiu omplir aquest espai existent entre el coneixement d'una persona i l'entrada que accepten els ordinadors. D'aquesta manera, documents impresos que contenen fórmules podrien digitalitzar-se automàticament, i l'escriptura es podria utilitzar per introduir directament notació matemàtica en dispositius electrònics. Aquesta tesi està centrada en desenvolupar un mètode per reconèixer expressions matemàtiques. En aquest document proposem un mètode per reconèixer qualsevol tipus de fórmula (impresa o manuscrita) basat en gramàtiques probabilístiques. Amb aquesta finalitat, desenvolupem el marc estadístic formal que deriva diverses distribucions de probabilitat. Al llarg del document, abordem la definició i estimació de totes aquestes fonts d'informació probabilística. Finalment, definim l'algorisme que, donada certa entrada, calcula globalment l'expressió matemàtica més probable d'acord al marc estadístic. Un aspecte important d'aquest treball és proporcionar una avaluació objectiva dels resultats i presentar-los usant dades públiques i mesures estàndard. Per això, estudiem els problemes de l'avaluació automàtica en aquest camp i busquem les millors solucions. Així mateix, presentem diversos experiments usant bases de dades públiques i hem participat en diverses competicions internacionals. A més, hem publicat com a codi obert la majoria del software desenvolupat en aquesta tesi. També hem explorat algunes de les aplicacions del reconeixement d'expressions matemàtiques. A més de les aplicacions directes de transcripció i digitalització, presentem dues propostes importants. En primer lloc, desenvolupem mucaptcha, un mètode per discriminar entre humans i ordinadors mitjançant l'escriptura d'expressions matemàtiques, el qual representa una nova aplicació del reconeixement de fórmules. En segon lloc, abordem el problema de detectar i segmentar l'estructura de documents utilitzant el marc estadístic formal desenvolupat en aquesta tesi, donat que ambdós són problemes bidimensionals que poden modelar-se amb gramàtiques probabilístiques. El mètode desenvolupat en aquesta tesi per reconèixer expressions matemàtiques ha obtingut bons resultats a diferents nivells. Aquest treball ha produït diverses publicacions en conferències internacionals i revistes, i ha sigut premiat en competicions internacionals.
Álvaro Muñoz, F. (2015). Mathematical Expression Recognition based on Probabilistic Grammars [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/51665
TESIS
APA, Harvard, Vancouver, ISO, and other styles
9

Freitas, Fernando de Almeida. "Reconhecimento automático de expressões faciais gramaticais na língua brasileira de sinais." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/100/100131/tde-10072015-100311/.

Full text
Abstract:
O Reconhecimento das Expressões Faciais tem atraído bastante a atenção dos pesquisadores nas últimas décadas, principalmente devido às suas ponteciais aplicações. Nas Línguas de Sinais, por serem línguas de modalidade visual-espacial e não contarem com o suporte sonoro da entonação, as Expressões Faciais ganham uma importância ainda maior, pois colaboram também para formar a estrutura gramatical da língua. Tais expressões são chamadas Expressões Faciais Gramaticais e estão presentes nos níveis morfológico e sintático das Línguas de Sinais, elas ganham destaque no processo de reconhecimento automático das Línguas de Sinais, pois colaboram para retirada de ambiguidades entre sinais que possuem parâmetros semelhantes, como configuração de mãos e ponto de articulação, além de colaborarem na composição do sentido semântico das sentenças. Assim, este projeto de pesquisa em nível de mestrado tem por objetivo desenvolver um conjunto de modelos de reconhecimento de padrões capazes de resolver o problema de intepretação automática de Expressões Faciais Gramaticais, usadas no contexto da Língua de Sinais Brasileira (Libras), considerando-as em Nível Sintático.
The facial expression recognition has attracted most of the researchers attention over the last years, because of that it can be very useful in many applications. The Sign Language is a spatio-visual language and it does not have the speech intonation support, so Facial Expression gain relative importance to convey grammatical information in a signed sentence and they contributed to morphological and/or syntactic level to a Sign Language. Those expressions are called Grammatical Facial Expression and they cooperate to solve the ambiguity between signs and give meaning to sentences. Thus, this research project aims to develop models that make possible to recognize automatically Grammatical Facial Expressions from Brazilian Sign Language (Libras)
APA, Harvard, Vancouver, ISO, and other styles
10

Voth, Stephanie. "MICROBIAL DNA RECEPTOR EXPRESSION IN CHRONIC PERIODONTITIS." VCU Scholars Compass, 2013. http://scholarscompass.vcu.edu/etd/3129.

Full text
Abstract:
AIM: The aim of this study was to determine the expression of microbial nucleic acid receptors including Toll like receptor 9 “TLR-9”, DNA-dependent activator of interferon-regulatory factors “DAI” and absent in melanoma “AIM-2” in chronic periodontitis (P) versus healthy (H) tissues. METHODS: 33 chronic periodontitis (P) and 27 periodontally-healthy (H) gingival biopsies were included. The gene and protein expression for each receptor was determined using real-time quantitative PCR and immunohistochemistry. RESULTS: Our results revealed statistically significant up-regulation of TLR-9 (p<0.006) and DAI (p<0.001) gene expression in P tissues compared to H sites. We were also able to demonstrate significant correlation among three DNA receptors (p<0.05). Immunohistochemistry further confirmed the expression of DNA sensors in gingival tissues. CONCLUSION: This study highlights a possible role for nucleic acid sensing in periodontal inflammation. Further investigations will determine whether cytoplasmic receptors and their ligands can be targeted to improve clinical outcomes in periodontitis.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Pattern expressions"

1

Morgan, Fran. Simple expression quilts. Paducah: American Quilter's Society, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

1958-, Kimura Ren, ed. Genetic inheritance patterns. New York: Nova Science Publishers, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Theresa, Capuana, and Donnally Helen, eds. Expressions of love: Woman's day prizewinning cross-stitch samplers. New York: Sedgewood Press, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Carter, Sandra E., and Vaughan T. Bailey. Facial expressions: Dynamic patterns, impairments and social perceptions. Hauppauge, N.Y: Nova Science Publisher's, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

John, Mason. Expressing generality. Milton Keynes: Centre for Mathematics Education, Open University, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Expression patterns of matrix genes during human skeletal development. Stuttgart: Gustav Fischer, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yoshida, Etsuko. Referring expressions in English and Japanese: Patterns of use in dialogue processing. Amsterdam: John Benjamins Pub. Co., 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Grubbs, Daisy. The art and craft of quilting: A beginner's guide to patchwork design, color, and expression. New York: Watson-Guptill Publications, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tomomatsu, Etsuko. 200 essential Japanese expressions: A guide to correct usage of key sentence patterns. Tokyo: ALC Press, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ross, Kathryn Anne. Snare specific antibodies reveal distinct patterns of snare expression in the mammalian brain. Ottawa: National Library of Canada, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Pattern expressions"

1

Paulus, Dietrich W. R., and Joachim Hornegger. "Expressions, Statements, Functions." In Pattern Recognition and Image Processing in C++, 42–57. Wiesbaden: Vieweg+Teubner Verlag, 1995. http://dx.doi.org/10.1007/978-3-322-87867-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kozen, Dexter C. "Pattern Matching and Regular Expressions." In Automata and Computability, 44–48. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1844-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chang, Chia-Hsiang, and Robert Paige. "From regular expressions to DFA's using compressed NFA's." In Combinatorial Pattern Matching, 90–110. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56024-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chan, Kam-Fai, and Dit-Yan Yeung. "Towards efficient structural analysis of mathematical expressions." In Advances in Pattern Recognition, 437–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0033264.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bourbakis, N., and P. Kakumanu. "Skin-based Face Detection-Extraction and Recognition of Facial Expressions." In Applied Pattern Recognition, 3–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-76831-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ilie, Lucian, and Sheng Yu. "Constructing NFAs by Optimal Use of Positions in Regular Expressions." In Combinatorial Pattern Matching, 279–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45452-7_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hammal, Z., A. Caplier, and M. Rombaut. "Belief Theory Applied to Facial Expressions Classification." In Pattern Recognition and Image Analysis, 183–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11552499_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ferreira, Margarida, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, and Ruben Martins. "FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions." In Tools and Algorithms for the Construction and Analysis of Systems, 152–69. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_9.

Full text
Abstract:
AbstractForm validators based on regular expressions are often used on digital forms to prevent users from inserting data in the wrong format. However, writing these validators can pose a challenge to some users.We present Forest, a regular expression synthesizer for digital form validations. Forest produces a regular expression that matches the desired pattern for the input values and a set of conditions over capturing groups that ensure the validity of integer values in the input. Our synthesis procedure is based on enumerative search and uses a Satisfiability Modulo Theories (SMT) solver to explore and prune the search space. We propose a novel representation for regular expressions synthesis, multi-tree, which induces patterns in the examples and uses them to split the problem through a divide-and-conquer approach. We also present a new SMT encoding to synthesize capture conditions for a given regular expression. To increase confidence in the synthesized regular expression, we implement user interaction based on distinguishing inputs.We evaluated Forest on real-world form-validation instances using regular expressions. Experimental results show that Forest successfully returns the desired regular expression in 70% of the instances and outperforms Regel, a state-of-the-art regular expression synthesizer.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Xin, Yang Wang, Yang Xu, Ji Zhang, and Xueyan Zhong. "Extending Graph Pattern Matching with Regular Expressions." In Lecture Notes in Computer Science, 111–29. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59051-2_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Brāzma, Alvis. "Learning of regular expressions by pattern matching." In Lecture Notes in Computer Science, 392–403. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59119-2_194.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Pattern expressions"

1

Skelley, J., R. Fischer, A. Sarma, and B. Heisele. "Recognizing Expressions in a New Database Containing Played and Natural Expressions." In 18th International Conference on Pattern Recognition (ICPR'06). IEEE, 2006. http://dx.doi.org/10.1109/icpr.2006.975.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Castagnoli, Sara. "Extracting MWEs from Italian corpora: A case study for refining the POS-pattern methodology." In Proceedings of the 10th Workshop on Multiword Expressions (MWE). Stroudsburg, PA, USA: Association for Computational Linguistics, 2014. http://dx.doi.org/10.3115/v1/w14-0809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Luo, Ruotian, and Gregory Shakhnarovich. "Comprehension-Guided Referring Expressions." In 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2017. http://dx.doi.org/10.1109/cvpr.2017.333.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tilevich, Eli, and Myoungkyu Song. "Reusable enterprise metadata with pattern-based structural expressions." In the Eighth International Conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1739230.1739234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ahmed, Washef, Soma Mitra, Kunal Chanda, and Debasis Mazumdar. "Assisting the autistic with improved facial expression recognition from mixed expressions." In 2013 Fourth National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics (NCVPRIPG). IEEE, 2013. http://dx.doi.org/10.1109/ncvpripg.2013.6776229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cotogni, Marco, Claudio Cusano, and Antonino Nocera. "Recursive Recognition of Offline Handwritten Mathematical Expressions." In 2020 25th International Conference on Pattern Recognition (ICPR). IEEE, 2021. http://dx.doi.org/10.1109/icpr48806.2021.9413076.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kanaujia, A., and D. Metaxas. "Recognizing Facial Expressions by Tracking Feature Shapes." In 18th International Conference on Pattern Recognition (ICPR'06). IEEE, 2006. http://dx.doi.org/10.1109/icpr.2006.976.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Peng, Qingshan Liu, and Dimitris N. Metaxas. "Exploring facial expressions with compositional features." In 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2010. http://dx.doi.org/10.1109/cvpr.2010.5539978.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fan, Wenfei, Jianzhong Li, Shuai Ma, Nan Tang, and Yinghui Wu. "Adding regular expressions to graph reachability and pattern queries." In 2011 IEEE International Conference on Data Engineering (ICDE 2011). IEEE, 2011. http://dx.doi.org/10.1109/icde.2011.5767858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ramirez Rivera, Adin, Jorge A. Rojas Castillo, and Oksam Chae. "Recognition of face expressions using Local Principal Texture Pattern." In 2012 19th IEEE International Conference on Image Processing (ICIP 2012). IEEE, 2012. http://dx.doi.org/10.1109/icip.2012.6467433.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Pattern expressions"

1

O'Connell, Peter. Can Gene Expression Pattern Analysis Predict Recurrence in Node-Negative Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, December 2002. http://dx.doi.org/10.21236/ada427708.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Immaneni, Anand, and Peter O'Connell. Can Gene Expression Pattern Analysis Predict Recurrence in Node-Negative Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, June 2003. http://dx.doi.org/10.21236/ada417924.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

O'Malley, Karen L. Fundamental Patterns Underlying Neurotoxicity Revealed by DNA Microarray Expression Profiling. Fort Belvoir, VA: Defense Technical Information Center, September 2002. http://dx.doi.org/10.21236/ada409422.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

O'Malley, Karen L. Fundamental Patterns Underlying Neurotoxicity Revealed by DNA Microarray Expression Profiling. Fort Belvoir, VA: Defense Technical Information Center, September 2004. http://dx.doi.org/10.21236/ada429295.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brufsky, Adam M. Determination of a Unique Pattern of Gene Expression in Node Positive Breast Cancer Using Serial Analysis of Gene Expression (SAGE). Fort Belvoir, VA: Defense Technical Information Center, June 2002. http://dx.doi.org/10.21236/ada417855.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Brufsky, Adam M. Determination of a Unique Pattern of Gene Expression in Node Positive Breast Cancer Using Serial Analysis of Gene Expression (SAGE). Fort Belvoir, VA: Defense Technical Information Center, July 2003. http://dx.doi.org/10.21236/ada424196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Stoica, Gerald E. Gene Regulation and Expression Pattern of the Growth Factor Pleiotrophin in Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, September 2003. http://dx.doi.org/10.21236/ada420767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Das, Rina, Chanaka Mendis, Zhengyin Yan, Roger Neill, and Thomas Boyle. Alterations in Gene Expression Show Unique Patterns in Response to Toxic Agents. Fort Belvoir, VA: Defense Technical Information Center, October 1998. http://dx.doi.org/10.21236/ada410117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Szallasi, Zoltan. Generative Model Based Statistical Analysis of Gene Expression Patterns in Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, March 2004. http://dx.doi.org/10.21236/ada426459.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Szallasi, Zoltan. Generative Model Based Statistical Analysis of Gene Expression Patterns in Breast Cancer. Fort Belvoir, VA: Defense Technical Information Center, August 2002. http://dx.doi.org/10.21236/ada412180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Pattern expressions' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography