IEEE

Converting Regular Expressions to Non-Deterministic Finite Automata through an Automated Framework

Abstract: A Regular Expression, often abbreviated as Regex, are a sequence of characters that define a search pattern. An Non-deterministic Finite Automata (NFA) is a computational machine which can ...
GitHub

Powerful context-based expression parser and evaluator in C# using JEXL (Javascript Expression Language) expressions.

NOTE: This library handles the JEXL from TomFrost's JEXL library. It does NOT handle the similarly-named Apache Commons JEXL language. Expressions can be evaluated synchronously or asynchronously by ...
WXXI

Writers at risk: what to do when free expression is under threat

We sit down with Karin Deutsch Karlekar of PEN America. The organization's Writers at Risk programs advocate for journalists, advocates, and academics who face threats around the world. A recent ...
IEEE

How Expression and Context Determine Second-person Judgments of Emotion

Abstract: Within the field of Affective Computing, facial expressions have traditionally been used as a means of inferring valence and emotions. Most studies have focused on interpreting facial ...