Query: Decision-Making Framework for Automated Driving in Highway Environments

Relevant passages:
Autonomous Driving in Urban Environments: Boss and the Urban Challenge <=SEP=> Chris Urmson, Joshua Anhalt, Drew Bagnell, Christopher Baker, Robert Bittner, M. N. Clark, John Dolan, Dave Duggins, Tugrul Galatali, Chris Geyer, Michele Gittleman, Sam Harbaugh, Martial Hebert, Thomas M. Howard, Sascha Kolski, Alonzo Kelly, Maxim Likhachev, Matt McNaughton, Nick Miller, Kevin Peterson, Brian Pilnick, Raj Rajkumar, Paul Rybski, Bryan Salesky, Young-Woo Seo, Sanjiv Singh, Jarrod Snider, Anthony Stentz, William “Red” Whittaker, Ziv Wolkowicki, and Jason Ziglar Carnegie Mellon University Pittsburgh, Pennsylvania 15213 e-mail: curmson@ri.cmu.edu

Maneuver-Based Trajectory Planning for Highly Autonomous Vehicles on Real Road With Traffic and Driver Interaction <=SEP=> This paper presents the design and first test on a simulator of a vehicle trajectory-planning algorithm that adapts to traffic on a lane-structured infrastructure such as highways. The proposed algorithm is designed to run on a fail-safe embedded environment with low computational power, such as an engine control unit, to be implementable in commercial vehicles of the near future. The target platform has a clock frequency of less than 150 MHz, 150 kB RAM of memory, and a 3-MB program memory. The trajectory planning is performed by a two-step algorithm. The first step defines the feasible maneuvers with respect to the environment, aiming at minimizing the risk of a collision. The output of this step is a target group of maneuvers in the longitudinal direction (accelerating or decelerating), in the lateral direction (changing lanes), and in the combination of both directions. The second step is a more detailed evaluation of several possible trajectories within these maneuvers. The trajectories are optimized to additional performance indicators such as travel time, traffic rules, consumption, and comfort. The output of this module is a trajectory in the vehicle frame that represents the recommended vehicle state (position, heading, speed, and acceleration) for the following seconds.

Model-Based Probabilistic Collision Detection in Autonomous Driving <=SEP=> The safety of the planned paths of autonomous cars with respect to the movement of other traffic participants is considered. Therefore, the stochastic occupancy of the road by other vehicles is predicted. The prediction considers uncertainties originating from the measurements and the possible behaviors of other traffic participants. In addition, the interaction of traffic participants, as well as the limitation of driving maneuvers due to the road geometry, is considered. The result of the presented approach is the probability of a crash for a specific trajectory of the autonomous car. The presented approach is efficient as most of the intensive computations are performed offline, which results in a lean online algorithm for real-time application.

Junior: The Stanford entry in the Urban Challenge <=SEP=> 

Classification and tracking of dynamic objects with multiple sensors for autonomous driving in urban environments <=SEP=> Future driver assistance systems are likely to use a multisensor approach with heterogeneous sensors for tracking dynamic objects around the vehicle. The quality and type of data available for a data fusion algorithm depends heavily on the sensors detecting an object. This article presents a general framework which allows the use sensor specific advantages while abstracting the specific details of a sensor. Different tracking models are used depending on the current set of sensors detecting the object. A sensor independent algorithm for classifying objects regarding their current and past movement state is presented. The described architecture and algorithms have been successfully implemented in Tartan racingpsilas autonomous vehicle for the urban grand challenge. Results are presented and discussed.

Digital color halftoning with generalized error diffusion and multichannel green-noise masks <=SEP=> In this paper, we introduce two novel techniques for digital color halftoning with green-noise--stochastic dither patterns generated by homogeneously distributing minority pixel clusters. The first technique employs error diffusion with output-dependent feedback where, unlike monochrome image halftoning, an interference term is added such that the overlapping of pixels of different colors can be regulated for increased color control. The second technique uses a green-noise mask, a dither array designed to create green-noise halftone patterns, which has been constructed to also regulate the overlapping of different colored pixels. As is the case with monochrome image halftoning, both techniques are tunable, allowing for large clusters in printers with high dot-gain characteristics, and small clusters in printers with low dot-gain characteristics.

Marrying Uncertainty and Time in Knowledge Graphs <=SEP=> The management of uncertainty is crucial when harvesting structured content from unstructured and noisy sources. Knowledge Graphs (KGs) are a prominent example. KGs maintain both numerical and non-numerical facts, with the support of an underlying schema. These facts are usually accompanied by a confidence score that witnesses how likely is for them to hold. Despite their popularity, most of existing KGs focus on static data thus impeding the availability of timewise knowledge. What is missing is a comprehensive solution for the management of uncertain and temporal data in KGs. The goal of this paper is to fill this gap. We rely on two main ingredients. The first is a numerical extension of Markov Logic Networks (MLNs) that provide the necessary underpinning to formalize the syntax and semantics of uncertain temporal KGs. The second is a set of Datalog constraints with inequalities that extend the underlying schema of the KGs and help to detect inconsistencies. From a theoretical point of view, we discuss the complexity of two important classes of queries for uncertain temporal KGs: maximum a-posteriori and conditional probability inference. Due to the hardness of these problems and the fact that MLN solvers do not scale well, we also explore the usage of Probabilistic Soft Logics (PSL) as a practical tool to support our reasoning tasks. We report on an experimental evaluation comparing the MLN and PSL approaches.

Building Better Detection with Privileged Information <=SEP=> Modern detection systems use sensor outputs available in the deployment environment to probabilistically identify attacks. These systems are trained on past or synthetic feature vectors to create a model of anomalous or normal behavior. Thereafter, run-time collected sensor outputs are compared to the model to identify attacks (or the lack of attack). While this approach to detection has been proven to be effective in many environments, it is limited to training on only features that can be reliably collected at test-time. Hence, they fail to leverage the often vast amount of ancillary information available from past forensic analysis and post-mortem data. In short, detection systems don’t train (and thus don’t learn from) features that are unavailable or too costly to collect at run-time. In this paper, we leverage recent advances in machine learning to integrate privileged information – features available at training time, but not at run-time– into detection algorithms. We apply three different approaches to model training with privileged information; knowledge transfer, model influence, and distillation, and empirically validate their performance in a range of detection domains. Our evaluation shows that privileged information can increase detector precision and recall: we observe an average of 4.8% decrease in detection error for malware traffic detection over a system with no privileged information, 3.53% for fast-flux domain bot detection, 3.33% for malware classification, 11.2% for facial user authentication. We conclude by exploring the limitations and applications of different privileged information techniques in detection systems.

Business Models : A Discovery Driven Approach <=SEP=> The business model concept offers strategists a fresh way to consider their options in uncertain, fast-moving and unpredictable environments. In contrast to conventional assumptions, recognizing that more new business models are both feasible and actionable than ever before is creating unprecedented opportunities for today’s organizations. However, unlike conventional strategies that emphasize analysis, strategies that aim to discover and exploit new models must engage in significant experimentation and learning e a ‘discovery driven,’ rather than analytical approach.

DanQ: a hybrid convolutional and recurrent deep neural network for quantifying the function of DNA sequences <=SEP=> Modeling the properties and functions of DNA sequences is an important, but challenging task in the broad field of genomics. This task is particularly difficult for non-coding DNA, the vast majority of which is still poorly understood in terms of function. A powerful predictive model for the function of non-coding DNA can have enormous benefit for both basic science and translational research because over 98% of the human genome is non-coding and 93% of disease-associated variants lie in these regions. To address this need, we propose DanQ, a novel hybrid convolutional and bi-directional long short-term memory recurrent neural network framework for predicting non-coding function de novo from sequence. In the DanQ model, the convolution layer captures regulatory motifs, while the recurrent layer captures long-term dependencies between the motifs in order to learn a regulatory 'grammar' to improve predictions. DanQ improves considerably upon other models across several metrics. For some regulatory markers, DanQ can achieve over a 50% relative improvement in the area under the precision-recall curve metric compared to related models. We have made the source code available at the github repository http://github.com/uci-cbcl/DanQ.

The end of the end of ideology. <=SEP=> The "end of ideology" was declared by social scientists in the aftermath of World War II. They argued that (a) ordinary citizens' political attitudes lack the kind of stability, consistency, and constraint that ideology requires; (b) ideological constructs such as liberalism and conservatism lack motivational potency and behavioral significance; (c) there are no major differences in content (or substance) between liberal and conservative points of view; and (d) there are few important differences in psychological processes (or styles) that underlie liberal versus conservative orientations. The end-of-ideologists were so influential that researchers ignored the topic of ideology for many years. However, current political realities, recent data from the American National Election Studies, and results from an emerging psychological paradigm provide strong grounds for returning to the study of ideology. Studies reveal that there are indeed meaningful political and psychological differences that covary with ideological self-placement. Situational variables--including system threat and mortality salience--and dispositional variables--including openness and conscientiousness--affect the degree to which an individual is drawn to liberal versus conservative leaders, parties, and opinions. A psychological analysis is also useful for understanding the political divide between "red states" and "blue states."

A Wideband Differential-Fed Slot Antenna Using Integrated Compact Balun With Matching Capability <=SEP=> This communication proposes a wideband differential-fed slot antenna that works in its dominant mode ( λ/2 mode). The antenna has a near omnidirectional radiation pattern with vertical polarization, which is designed for near-ground wireless sensor node applications. A compact integrated T-slot balun and a loop to T-slot feeding structure are introduced to realize the differential feeding; the bandwidth is expanded to 30.7% (2.2 GHz-3.0 GHz) with a 3.8 dB peak gain. A detailed matching method without using lumped elements is proposed, which can be applied to various types of RFIC chips. A prototype is built and measured. Its differential impedance, antenna patterns, and gain are consistent with the simulation results.

Cross-Point Resistive RAM Based on Field-Assisted Superlinear Threshold Selector <=SEP=> We report a 3-D-stackable 1S1R passive cross-point resistive random access memory (RRAM). The sneak (leakage) current challenge in the cross-point RRAM integration has been overcome utilizing a field-assisted superlinear threshold selector. The selector offers high selectivity of >107, sharp switching slope of <;5 mV/decade, ability to tune the threshold voltage, stable operation at 125°C, and endurance of >1011. Furthermore, we demonstrate 1S1R integration in which the selector-subthreshold current is <;10 pA while offering >102 memory ON/OFF ratio and >106 selectivity during cycling. Combined with self-current-controlled RRAM, the 1S1R enables high-density and high-performance memory applications.

Augmented reality-based exergames for rehabilitation <=SEP=> Rehabilitation for stroke afflicted patients, through exercises tailored for individual needs, aims at relearning basic motor skills, especially in the extremities. Rehabilitation through Augmented Reality (AR) based games engage and motivate patients to perform exercises which, otherwise, maybe boring and monotonic. Also, mirror therapy allows users to observe one's own movements in the game providing them with good visual feedback. This paper presents an augmented reality based system for rehabilitation by playing four interactive, cognitive and fun Exergames (exercise and gaming).
 The system uses low-cost RGB-D cameras such as Microsoft Kinect V2 to capture and generate 3D model of the person by extracting him/her from the entire captured data and immersing it in different interactive virtual environments. Animation based limb movement enhancement along with cognitive aspects incorporated in the game can help in positive reinforcement, progressive challenges and motion improvement. Recording module of the toolkit allows future reference and facilitates feedback from the physician. 10 able-bodied users, 2 psychological experts and 2 Physical Medicine and Rehabilitation physicians evaluated the user experience and usability aspects of the exergames. Results obtained shows the games to be fun and realistic, and at the same time engaging and motivating for performing exercises.

Commonsense Reasoning in and Over Natural Language <=SEP=> ConceptNet is a very large semantic network of commonsense knowledge suitable for making various kinds of practical inferences over text. ConceptNet captures a wide range of commonsense concepts and relations like those in Cyc, while its simple semantic network structure lends it an ease-of-use comparable to WordNet. To meet the dual challenge of having to encode complex higher-order concepts, and maintaining ease-of-use, we introduce a novel use of semi-structured natural language fragments as the knowledge representation of commonsense concepts. In this paper, we present a methodology for reasoning flexibly about these semi-structured natural language fragments. We also examine the tradeoffs associated with representing commonsense knowledge in formal logic versus in natural language. We conclude that the flexibility of natural language makes it a highly suitable representation for achieving practical inferences over text, such as context finding, inference chaining, and conceptual analogy. 1 What is ConceptNet? ConceptNet (www.conceptnet.org) is the largest freely available, machine-useable commonsense resource. Structured as a network of semi-structured natural language fragments, ConceptNet presently consists of over 250,000 elements of commonsense knowledge. We were inspired dually by the range of commonsense concepts and relations in Cyc (Lenat, 1995), and by the ease-of-use of WordNet (Fellbaum, 1998), and hoped to combine the best of both worlds. As a result, we adopted the semantic network representation of WordNet, but extended the representation in several key ways. First, we extended WordNet’s lexical notion of nodes to a conceptual notion of nodes, but we kept the nodes in natural language, because one of the primary strengths of WordNet in the textual domain is that its knowledge representation is itself textual. ConceptNet’s nodes are thus natural language fragments which are semi-structured according to an ontology of allowable syntactic patterns, and accommodate both first-order concepts given as noun phrases (e.g. “potato chips”), and second-order concepts given as verb phrases (e.g. “buy potato chips”). Second, we extended WordNet’s small ontology of semantic relations, which are primarily taxonomic in nature, to include a richer set of relations appropriate to concept-level nodes. At present there are 19 semantic relations used in ConceptNet, representing categories of, inter alia, temporal, spatial, causal, and functional knowledge. By combining higher order nodes with this relational ontology, it is possible to represent richer kinds of knowledge in ConceptNet beyond what can be represented in WordNet (Fig 1.). For example, we can represent a layman’s common sense observation that “you may be hurt if you get into an accident” in ConceptNet as EffectOf(“get into accident”, “be hurt”). Note that because the knowledge representation is semi-structured natural language, there are often various ways to represent the same knowledge. This is a source of ambiguity, but as we will argue in this paper, maintaining some ambiguity lends us greater flexibility for reasoning.

Who falls for phish?: a demographic analysis of phishing susceptibility and effectiveness of interventions <=SEP=> In this paper we present the results of a roleplay survey instrument administered to 1001 online survey respondents to study both the relationship between demographics and phishing susceptibility and the effectiveness of several anti-phishing educational materials. Our results suggest that women are more susceptible than men to phishing and participants between the ages of 18 and 25 are more susceptible to phishing than other age groups. We explain these demographic factors through a mediation analysis. Educational materials reduced users' tendency to enter information into phishing webpages by 40% percent; however, some of the educational materials we tested also slightly decreased participants' tendency to click on legitimate links.

An Ensemble-of-Classifiers Based Approach for Early Diagnosis of Alzheimer's Disease: Classification Using Structural Features of Brain Images <=SEP=> Structural brain imaging is playing a vital role in identification of changes that occur in brain associated with Alzheimer's disease. This paper proposes an automated image processing based approach for the identification of AD from MRI of the brain. The proposed approach is novel in a sense that it has higher specificity/accuracy values despite the use of smaller feature set as compared to existing approaches. Moreover, the proposed approach is capable of identifying AD patients in early stages. The dataset selected consists of 85 age and gender matched individuals from OASIS database. The features selected are volume of GM, WM, and CSF and size of hippocampus. Three different classification models (SVM, MLP, and J48) are used for identification of patients and controls. In addition, an ensemble of classifiers, based on majority voting, is adopted to overcome the error caused by an independent base classifier. Ten-fold cross validation strategy is applied for the evaluation of our scheme. Moreover, to evaluate the performance of proposed approach, individual features and combination of features are fed to individual classifiers and ensemble based classifier. Using size of left hippocampus as feature, the accuracy achieved with ensemble of classifiers is 93.75%, with 100% specificity and 87.5% sensitivity.

Family issues in child anxiety: attachment, family functioning, parental rearing and beliefs. <=SEP=> Family studies have found a large overlap between anxiety disorders in family members. In addition to genetic heritability, a range of family factors may also be involved in the intergenerational transmission of anxiety. Evidence for a relationship between family factors and childhood as well as parental anxiety is reviewed. Four groups of family variables are considered: (I) attachment; (II), aspects of family functioning, such as marital conflict, co-parenting, functioning of the family as a whole, and sibling relationships; (III) parental rearing strategies; and (IV) beliefs that parents hold about their child. The reviewed literature provides evidence for an association between each of these family factors and child anxiety. However, there is little evidence as yet that identified family factors are specific to child anxiety, rather than to child psychopathology in general. Moreover, evidence for a relationship between child anxiety and family factors is predominantly cross-sectional. Therefore, whether the identified family factors cause childhood anxiety still needs to be investigated. Further research that investigates mechanisms mediating the relationship between family factors and child anxiety is also called for. Finally, parental beliefs are identified as important predictors of parental behaviour that have largely not been investigated in relation to child anxiety disorders.

Computer Architecture with Associative Processor Replacing Last-Level Cache and SIMD Accelerator <=SEP=> This study presents a computer architecture, where a last-level cache and a SIMD accelerator are replaced by an associative processor. Associative processor combines data storage and data processing, and functions as a massively parallel SIMD processor and a memory at the same time. An analytic performance model of this computer architecture is introduced. Comparative analysis supported by cycle-accurate simulation and emulation shows that this architecture may outperform a conventional computer architecture comprising a SIMD coprocessor and a shared last-level cache while consuming less power.

Improved image-based classification of Alzheimer ’ s disease using multimodality brain imaging data <=SEP=> Purpose Amyloid-PET is an accurate marker of Alzheimer's disease. However, this technique is invasive and not widely available. Here we investigated whether other neuroimaging techniques can yield similar diagnostic accuracy as PET imaging. This proof of concept study presents two approaches of analyzing multi-modality combinations of metabolic, functional and anatomical brain imaging data using kernel-based pattern recognition techniques. Methods Input images were taken from a systematically collected database of previous studies. Data included [ 18 F]FDG-PET, rs-fMRI and structural MR data of 15 controls and 25 AD patients. [ 11 C]PIB was used as reference test for classification of AD using imaging data. From rs-fMRI data, both eigenvector centrality (EC) images and default mode network (DMN) regression maps were calculated. Structural MR data was used to create gray matter (GM) maps. Intermediate results were combined and analyzed with two types of existing pattern classification software; 1) using spatial concatenation of voxel data and, 2) a regional multi-kernel approach.

What to expect from teleconferencing. <=SEP=> Like other marvels of the electronic age, teleconferencing has been both oversold and underused. Though it has many potential uses, what managers know, or think they know, about it is generally based on misconceptions. Rather than relying only on vendors of teleconferencing, potential purchasers should first decide what their communication needs are, then choose the system that suits them best. These authors explain the new teleconferencing options and give guidelines for adapting them to a particular company.

Exploring motivations for contributing to open source initiatives: The roles of contribution context and personal values <=SEP=> We explore contextual and dispositional correlates of the motivation to contribute to open source initiatives. We examine how the context of the open source project, and the personal values of contributors, are related to the types of motivations for contributing. A web-based survey was administered to 300 contributors in two prominent open source contexts: software and content. As hypothesized, software contributors placed a greater emphasis on reputation-gaining and self-development motivations, compared with content contributors, who placed a greater emphasis on altruistic motives. Furthermore, the hypothesized relationships were found between contributors’ personal values and their motivations for contributing. 2007 Elsevier Ltd. All rights reserved.

On the cognitive process of human problem solving <=SEP=> One of the fundamental human cognitive processes is problem solving. As a higher-layer cognitive process, problem solving interacts with many other cognitive processes such as abstraction, searching, learning, decision making, inference, analysis, and synthesis on the basis of internal knowledge representation by the object–attribute-relation (OAR) model. Problem solving is a cognitive process of the brain that searches a solution for a given problem or finds a path to reach a given goal. When a problem object is identified, problem solving can be perceived as a search process in the memory space for finding a relationship between a set of solution goals and a set of alternative paths. This paper presents both a cognitive model and a mathematical model of the problem solving process. The cognitive structures of the brain and the mechanisms of internal knowledge representation behind the cognitive process of problem solving are explained. The cognitive process is formally described using real-time process algebra (RTPA) and concept algebra. This work is a part of the cognitive computing project that designed to reveal and simulate the fundamental mechanisms and processes of the brain according to Wang’s layered reference model of the brain (LRMB), which is expected to lead to the development of future generation methodologies for cognitive computing and novel cognitive computers that are capable of think, learn, and perceive. 2008 Published by Elsevier B.V.

Move Evaluation in Go Using Deep Convolutional Neural Networks <=SEP=> The game of Go is more challenging than other board games, due to the difficulty of constructing a position or move evaluation function. In this paper we investigate whether deep convolutional networks can be used to directly represent and learn this knowledge. We train a large 12-layer convolutional neural network by supervised learning from a database of human professional games. The network correctly predicts the expert move in 55% of positions, equalling the accuracy of a 6 dan human player. When the trained convolutional network was used directly to play games of Go, without any search, it beat the traditional-search program GnuGo in 97% of games, and matched the performance of a state-of-the-art Monte-Carlo tree search that simulates two million positions per move.

Summarizability in OLAP and Statistical Data Bases <=SEP=> Summarizability of OLAP and Statistical Databases is an a extremely important property because violating this condition can lead to erroneous conclusions and decisions. In this paper we explore the conditions for summarizability. We introduce a framework for specifying precisely the context in which statistical objects are defined. We use a three step process to define normalized statistical objects. Using this framework, we identify three necessary conditions for summarizability. We provided specific tests for each of the conditions that can be verified either from semantic knowledge, or by checking the statistical database itself. We also provide the reasoning for our belief that these three summarizability conditions are sufficient as well.

Andromeda: Performance, Isolation, and Velocity at Scale in Cloud Network Virtualization <=SEP=> This paper presents our design and experience with Andromeda, Google Cloud Platform’s network virtualization stack. Our production deployment poses several challenging requirements, including performance isolation among customer virtual networks, scalability, rapid provisioning of large numbers of virtual hosts, bandwidth and latency largely indistinguishable from the underlying hardware, and high feature velocity combined with high availability. Andromeda is designed around a flexible hierarchy of flow processing paths. Flows are mapped to a programming path dynamically based on feature and performance requirements. We introduce the Hoverboard programming model, which uses gateways for the long tail of low bandwidth flows, and enables the control plane to program network connectivity for tens of thousands of VMs in seconds. The on-host dataplane is based around a highperformance OS bypass software packet processing path. CPU-intensive per packet operations with higher latency targets are executed on coprocessor threads. This architecture allows Andromeda to decouple feature growth from fast path performance, as many features can be implemented solely on the coprocessor path. We demonstrate that the Andromeda datapath achieves performance that is competitive with hardware while maintaining the flexibility and velocity of a software-based architecture.

Microwave antenna applications of metasurfaces <=SEP=> This paper reviews the past and current research progress in microwave antenna applications using 2D planar metamaterials or metasurfaces. Firstly, we revisit the definitions of metamaterial and metasurface, and the applications of the ultra-thin metasurfaces for low-profile printed antennas in microwave frequency regime, for the purposes of size reduction and performance enhancement. Then we summarize the different types of metasurfaces and their applications. Finally, we provide the future lookout into microwave antenna and EM related applications using metasurfaces.

A Modified Node2vec Method for Disappearing Link Prediction <=SEP=> Disappearing link prediction aims to predict the possibility of the links disappearing in the future. This paper describes the disappearing link prediction problem in scientific collaboration networks based on network embedding. We propose a novel network embedding method called TDL2vec, which is an extension of node2vec algorithm. TDL2vec generates the link embdeddings considering with the time factor. In this paper, the disappearing link prediction problem is considered as a binary classification problem, and support vector machine (SVM) is used as the classifier after link embedding. To evaluate the performance in disappearing link prediction, this paper tests the proposed method and several baseline methods on a real-world network. The experimental results show that TDL2vec achieves better performance than other baselines.

EdgeConnect: Generative Image Inpainting with Adversarial Edge Learning <=SEP=> Over the last few years, deep learning techniques have yielded significant improvements in image inpainting. However, many of these techniques fail to reconstruct reasonable structures as they are commonly over-smoothed and/or blurry. This paper develops a new approach for image inpainting that does a better job of reproducing filled regions exhibiting fine details. We propose a two-stage adversarial model EdgeConnect that comprises of an edge generator followed by an image completion network. The edge generator hallucinates edges of the missing region (both regular and irregular) of the image, and the image completion network fills in the missing regions using hallucinated edges as a priori. We evaluate our model end-to-end over the publicly available datasets CelebA, Places2, and Paris StreetView, and show that it outperforms current state-ofthe-art techniques quantitatively and qualitatively.

An Algebraic Fault Attack on the LED Block Cipher <=SEP=> In this paper we propose an attack on block ciphers where we combine techniques derived from algebraic and fault based cryptanalysis. The recently introduced block cipher LED serves us as a target for our attack. We show how to construct an algebraic representation of the encryption map and how to cast the side channel information gained from a fault injection into polynomial form. The resulting polynomial system is converted into a logical formula in conjunctive normal form and handed over to a SAT solver for reconstruction of the secret key. Following this approach we were able to mount a new, successful attack on the version of LED that uses a 64-bit secret key, requiring only a single fault injection.