Query: Lifted Proximal Operator Machines

Relevant passages:
Reading Digits in Natural Images with Unsupervised Feature Learning <=SEP=> Detecting and reading text from natural images is a hard computer vision task that is central to a variety of emerging applications. Related problems like document character recognition have been widely studied by computer vision and machine learning researchers and are virtually solved for practical applications like reading handwritten digits. Reliably recognizing characters in more complex scenes like photographs, however, is far more difficult: the best existing methods lag well behind human performance on the same tasks. In this paper we attack the problem of recognizing digits in a real application using unsupervised feature learning methods: reading house numbers from street level photos. To this end, we introduce a new benchmark dataset for research use containing over 600,000 labeled digits cropped from Street View images. We then demonstrate the difficulty of recognizing these digits when the problem is approached with hand-designed features. Finally, we employ variants of two recently proposed unsupervised feature learning methods and find that they are convincingly superior on our benchmarks.

Learning representations by back-propagating errors <=SEP=> We describe a new learning procedure, back-propagation, for networks of neurone-like units. The procedure repeatedly adjusts the weights of the connections in the network so as to minimize a measure of the difference between the actual output vector of the net and the desired output vector. As a result of the weight adjustments, internal ‘hidden’ units which are not part of the input or output come to represent important features of the task domain, and the regularities in the task are captured by the interactions of these units. The ability to create useful new features distinguishes back-propagation from earlier, simpler methods such as the perceptron-convergence procedure1.

Mastering the game of Go with deep neural networks and tree search <=SEP=> The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.

Natural Language Processing (almost) from Scratch <=SEP=> We propose a unified neural network architecture and learning algorithm that can be applied to various natural language processing tasks including: part-of-speech tagging, chunking, named entity recognition, and semantic role labeling. This versatility is achieved by trying to avoid task-specific engineering and therefore disregarding a lot of prior knowledge. Instead of exploiting man-made input features carefully optimized for each task, our system learns internal representations on the basis of vast amounts of mostly unlabeled training data. This work is then used as a basis for building a freely available tagging system with good performance and minimal computational requirements.

Caffe: Convolutional Architecture for Fast Feature Embedding <=SEP=> Caffe provides multimedia scientists and practitioners with a clean and modifiable framework for state-of-the-art deep learning algorithms and a collection of reference models. The framework is a BSD-licensed C++ library with Python and MATLAB bindings for training and deploying general-purpose convolutional neural networks and other deep models efficiently on commodity architectures. Caffe fits industry and internet-scale media needs by CUDA GPU computation, processing over 40 million images a day on a single K40 or Titan GPU (approx 2 ms per image). By separating model representation from actual implementation, Caffe allows experimentation and seamless switching among platforms for ease of development and deployment from prototyping machines to cloud environments.
 Caffe is maintained and developed by the Berkeley Vision and Learning Center (BVLC) with the help of an active community of contributors on GitHub. It powers ongoing research projects, large-scale industrial applications, and startup prototypes in vision, speech, and multimedia.

A survey of automated material handling systems in 300-mm SemiconductorFabs <=SEP=> The fast-paced developments and technological breakthroughs in the semiconductor manufacturing industry elevates the importance of optimum utilization of resources. The newer 300-mm wafers fabs place a high level of emphasis on increasing yield and reducing cycle times. Automated material handling systems are importanttools that help us achieve these objectives. In addition, due to the increased weight and size of 300-mm wafers, an automated material handling system isa must for a 300-mm manufacturing facility. This paper discusses various approaches for automated materials handling in semiconductor manufacturing industries.

Clinical spinal instability and low back pain. <=SEP=> Clinical instability is an important cause of low back pain. Although there is some controversy concerning its definition, it is most widely believed that the loss of normal pattern of spinal motion causes pain and/or neurologic dysfunction. The stabilizing system of the spine may be divided into three subsystems: (1) the spinal column; (2) the spinal muscles; and (3) the neural control unit. A large number of biomechanical studies of the spinal column have provided insight into the role of the various components of the spinal column in providing spinal stability. The neutral zone was found to be a more sensitive parameter than the range of motion in documenting the effects of mechanical destabilization of the spine caused by injury and restabilization of the spine by osteophyle formation, fusion or muscle stabilization. Clinical studies indicate that the application of an external fixator to the painful segment of the spine can significantly reduce the pain. Results of an in vitro simulation of the study found that it was most probably the decrease in the neutral zone, which was responsible for pain reduction. A hypothesis relating the neutral zone to pain has been presented. The spinal muscles provide significant stability to the spine as shown by both in vitro experiments and mathematical models. Concerning the role of neuromuscular control system, increased body sway has been found in patients with low back pain, indicating a less efficient muscle control system with decreased ability to provide the needed spinal stability.

A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers <=SEP=> Structured-grid PDE solver frameworks parallelize over boxes, which are rectangular domains of cells or faces in a structured grid. In the Chombo framework, the box sizes are typically 163 or 323, but larger box sizes such as 1283 would result in less surface area and therefore less storage, copying, and/or ghost cells communication overhead. Unfortunately, current on-node parallelization schemes perform poorly for these larger box sizes. In this paper, we investigate 30 different inter-loop optimization strategies and demonstrate the parallel scaling advantages of some of these variants on NUMA multicore nodes. Shifted, fused, and communication-avoiding variants for 1283 boxes result in close to ideal parallel scaling and come close to matching the performance of 163 boxes on three different multicore systems for a benchmark that is a proxy for program idioms found in Computational Fluid Dynamic (CFD) codes.

A Survey of the Functional Splits Proposed for 5 G Mobile Crosshaul Networks Line <=SEP=> Pacing the way towards 5G has lead researchers and industry in the direction of centralized processing known from Cloud-Radio Access Networks (C-RAN). In C-RAN research, a variety of different functional splits is presented by different names and focusing on different directions. The functional split determines how many Base Station (BS) functions to leave locally, close to the user, with the benefit of relaxing fronthaul network bitrate and delay requirements, and how many functions to centralize with the possibility of achieving greater processing benefits. This work presents for the first time a comprehensive overview systematizing the different work directions for both research and industry, while providing a detailed description of each functional split option and an assessment of the advantages and disadvantages. This work gives an overview of where the most effort has been directed in terms of functional splits, and where there is room for further studies. The standardization currently taking place is also considered and mapped into the research directions. It is investigated how the fronthaul network will be affected by the choice of functional split, both in terms of bitrates and latency, and as the different functional splits provide different advantages and disadvantages, the option of flexible functional splits is also looked into. Keywords—Functional Split; Crosshaul; X-haul; C-RAN; Fronthaul; standardization; industry; network architecture; Please refer to the list of acronyms provided in the end of the paper, right before the references.

A Prototype Navigation System for Guiding Blind People Indoors using NXT Mindstorms <=SEP=> People with visual impairment face enormous difficulties in terms of their mobility as they do not have enough information about their location and orientation with respect to traffic and obstacles on their route. Visually impaired people can navigate unknown areas by relying on the assistance of canes, other people, or specially trained guide dogs. The traditional ways of using guide dogs and long-cane only help to avoid obstacles, not to know where they are. The research presented in this paper introduces a mobile assistant navigation prototype to locate and direct blind people indoors. Since most of the existing navigation systems developed so far for blind people employ a complex conjunction of positioning systems, video cameras, locationbased and image processing algorithms, we designed an affordable low-cost prototype navigation system for orienting and tracking the position of blind people in complex environments. The prototype system is based on the inertial navigation system and experiments have been performed on NXT Mindstorms platform.

Online Learning of Weighted Relational Rules for Complex Event Recognition <=SEP=> Systems for symbolic complex event recognition detect occurrences of events in time using a set of event definitions in the form of logical rules. The Event Calculus is a temporal logic that has been used as a basis in event recognition applications, providing among others, connections to techniques for learning such rules from data. We advance the state-of-the-art by combining an existing online algorithm for learning crisp relational structure with an online method for weight learning in Markov Logic Networks (MLN). The result is an algorithm that learns complex event patterns in the form of Event Calculus theories in the MLN semantics. We evaluate our approach on a challenging real-world application for activity recognition and show that it outperforms both its crisp predecessor and competing online MLN learners in terms of predictive performance, at the price of a small increase in training time.

Deep Reinforcement Learning for Robotic Manipulation <=SEP=> Reinforcement learning holds the promise of enabling autonomous robots to learn large repertoires of behavioral skills with minimal human intervention. However, robotic applications of reinforcement learning often compromise the autonomy of the learning process in favor of achieving training times that are practical for real physical systems. This typically involves introducing hand-engineered policy representations and human-supplied demonstrations. Deep reinforcement learning alleviates this limitation by training general-purpose neural network policies, but applications of direct deep reinforcement learning algorithms have so far been restricted to simulated settings and relatively simple tasks, due to their apparent high sample complexity. In this paper, we demonstrate that a recent deep reinforcement learning algorithm based on offpolicy training of deep Q-functions can scale to complex 3D manipulation tasks and can learn deep neural network policies efficiently enough to train on real physical robots. We demonstrate that the training times can be further reduced by parallelizing the algorithm across multiple robots which pool their policy updates asynchronously. Our experimental evaluation shows that our method can learn a variety of 3D manipulation skills in simulation and a complex door opening skill on real robots without any prior demonstrations or manually designed representations.

Gradient and Curvature from Photometric Stereo Including Local Confidence Estimation <=SEP=> Photometric stereo is one technique for 3D shape determination that has been implemented in a variety of experimental settings and that has produced consistently good results. The idea is to use intensity values recorded from multiple images obtained from the same viewpoint but under different conditions of illumination. The resulting radiometric constraint makes it possible to obtain local estimates of both surface orientation and surface curvature without requiring global smoothness assumptions and without requiring prior image segmentation. This paper moves photometric stereo one step closer to practical viability by describing an experimental setting in which surface gradient estimation is achieved on full frame video data at near video frame rates (i.e., 15Hz). The implementation uses commercially available hardware. Reflectance is modeled empirically using measurements obtained from a calibration sphere. Estimation of the gradient, (p, q), requires only simple table lookup. Curvature estimation uses, in addition, the reflectance map, R(p, q). The required lookup table and reflectance maps are derived during calibration. Because reflectance is modeled empirically, no prior physical model of the reflectance characteristics of the objects to be analyzed is assumed. At the same time, if a good physical model is available, it can be retrofit to the method for implementation purposes. Photometric stereo is subject to error in the presence of cast shadows and interreflection. No purely local technique can succeed since these phenomena are inherently non-local. Nevertheless, this paper demonstrates that one can exploit the redundancy in three light source photometric stereo to, in most cases, locally detect the presence of cast shadows and interreflection. Detection is facilitated by explicitly including a local confidence estimate in the lookup table used for gradient estimation.

On Power Quality of Variable-Speed Constant-Frequency Aircraft Electric Power Systems <=SEP=> In this paper, a comprehensive model of the variable-speed constant-frequency aircraft electric power system is developed to study the performance characteristics of the system and, in particular, the system power quality over a frequency range of operation of 400 Hz to 800 Hz. A fully controlled active power filter is designed to regulate the load terminal voltage, eliminate harmonics, correct supply power factor, and minimize the effect of unbalanced loads. The control algorithm for the active power filter (APF) is based on the perfect harmonic cancellation method which provides a three-phase reference supply current in phase with its positive-sequence fundamental voltage. The proposed APF is integrated into the model of a 90-kVA advanced aircraft electric power system under VSCF operation. The performance characteristics of the system are studied with the frequency of the generator's output voltage varied from 400 Hz to 800 Hz under different loading conditions. Several case studies are presented including dc loads as well as passive and dynamic ac loads. The power quality characteristics of the studied aircraft electric power system with the proposed active filter are shown to be in compliance with the most recent military aircraft electrical standards MIL-STD-704F as well as with the IEEE Std. 519.

Anatomisation with slicing: a new privacy preservation approach for multiple sensitive attributes <=SEP=> An enormous quantity of personal health information is available in recent decades and tampering of any part of this information imposes a great risk to the health care field. Existing anonymization methods are only apt for single sensitive and low dimensional data to keep up with privacy specifically like generalization and bucketization. In this paper, an anonymization technique is proposed that is a combination of the benefits of anatomization, and enhanced slicing approach adhering to the principle of k-anonymity and l-diversity for the purpose of dealing with high dimensional data along with multiple sensitive data. The anatomization approach dissociates the correlation observed between the quasi identifier attributes and sensitive attributes (SA) and yields two separate tables with non-overlapping attributes. In the enhanced slicing algorithm, vertical partitioning does the grouping of the correlated SA in ST together and thereby minimizes the dimensionality by employing the advanced clustering algorithm. In order to get the optimal size of buckets, tuple partitioning is conducted by MFA. The experimental outcomes indicate that the proposed method can preserve privacy of data with numerous SA. The anatomization approach minimizes the loss of information and slicing algorithm helps in the preservation of correlation and utility which in turn results in reducing the data dimensionality and information loss. The advanced clustering algorithms prove its efficiency by minimizing the time and complexity. Furthermore, this work sticks to the principle of k-anonymity, l-diversity and thus avoids privacy threats like membership, identity and attributes disclosure.

Adaptive flow orientation-based feature extraction in fingerprint images <=SEP=> -A reliable method for extracting structural features from fingerprint images is presented. Viewing fingerprint images as a textured image, an orientation flow field is computed. The rest of the stages in the algorithm use the flow field to design adaptive filters for the input image. To accurately locate ridges, a waveform projection-based ridge segmentation algorithm is used. The ridge skeleton image is obtained and smoothed using morphological operators to detect the features. A large number of spurious features from the detected set of minutiae is deleted by a postprocessing stage. The performance of the proposed algorithm has been evaluated by computing a "goodness index" (GI) which compares the results of automatic extraction with manually extracted ground truth. The significance of the observed GI values is determined by comparing the index for a set of fingerprints against the GI values obtained under a baseline distribution. The detected features are observed to be reliable and accurate. Fingerprints Feature extraction Texture Flow orientation Minutiae Segmentation Skeleton

Leveraging Deep Neural Networks and Knowledge Graphs for Entity Disambiguation <=SEP=> Entity Disambiguation aims to link mentions of ambiguous entities to a knowledge base (e.g., Wikipedia). Modeling topical coherence is crucial for this task based on the assumption that information from the same semantic context tends to belong to the same topic. This paper presents a novel deep semantic relatedness model (DSRM) based on deep neural networks (DNN) and semantic knowledge graphs (KGs) to measure entity semantic relatedness for topical coherence modeling. The DSRM is directly trained on large-scale KGs and it maps heterogeneous types of knowledge of an entity from KGs to numerical feature vectors in a latent space such that the distance between two semantically-related entities is minimized. Compared with the state-ofthe-art relatedness approach proposed by (Milne and Witten, 2008a), the DSRM obtains 19.4% and 24.5% reductions in entity disambiguation errors on two publicly available datasets respectively.

Epidemic dengue/dengue hemorrhagic fever as a public health, social and economic problem in the 21st century. <=SEP=> Dengue fever/dengue hemorrhagic fever is now one of the most important public health problems in tropical developing countries and also has major economic and societal consequences.

AN AUTOMATIC SYSTEM FOR DETECTING AND COUNTING RBC AND WBC USING FUZZY LOGIC <=SEP=> Blood cell detection and counting is the initial process for detecting and diagnosing diseases. Several image processing algorithms are there for the blood cell classification and counting. The processed image helps to detect different blood related diseases. In all those algorithms several pre-processing steps are there for the process of detection and counting. Though all the algorithms give accurate results, the pre-processing steps are complex and time-consuming. This paper discusses about the RBC and WBC detection using fuzzy logic. Fuzzy logic toolbox software in MATLAB is used to develop the model on virtual platform.

Evoked-potential correlates of stimulus uncertainty. <=SEP=> The average evoked-potential waveforms to sound and light stimuli recorded from scalp in awake human subjects show differences as a function of the subject's degree of uncertainty with respect to the sensory modality of the stimulus to be presented. Differences are also found in the evoked potential as a function of whether or not the sensorymodality of the stimulus was anticipated correctly. The major waveform alteration is in the amplitude of a positive-going component which reaches peak amplitude at about 300 milliseconds.

Development of DC to Single-Phase AC Voltage Source Inverter With Active Power Decoupling Based on Flying Capacitor DC/DC Converter <=SEP=> In the present, a power decoupling method without additional component is proposed for a dc to single-phase ac converter, which consists of a flying capacitor dc/dc converter (FCC) and the voltage source inverter (VSI). In particular, a small flying capacitor in the FCC is used for both a boost operation and a double-line-frequency power ripple reduction. Thus, the dc-link capacitor value can be minimized in order to avoid the use of a large electrolytic capacitor. In addition, component design, of, e.g., the boost inductor and the flying capacitor, is clarified when the proposed control is applied. Experiments were carried out using a 1.5-kW prototype in order to verify the validity of the proposed control. The experimental results revealed that the use of the proposed control reduced the dc-link voltage ripple by 74.5%, and the total harmonic distortion (THD) of the inverter output current was less than 5%. Moreover, a maximum system efficiency of 95.4% was achieved at a load of 1.1 kW. Finally, the high power density design is evaluated by the Pareto front optimization. The power densities of three power decoupling topologies, such as a boost topology, a buck topology, and the proposed topology are compared. As a result, the proposed topology achieves the highest power density (5.3 kW/dm3) among the topologies considered herein.

Efficient Exploration in Monte Carlo Tree Search using Human Action Abstractions <=SEP=> Monte Carlo Tree Search (MCTS) is a family of methods for planning in large domains. It focuses on finding a good action for a particular state, making its complexity independent of the size of the state space. However such methods are exponential with respect to the branching factor. Effective application of MCTS requires good heuristics to arbitrate action selection during learning. In this paper we present a policy-guided approach that utilizes action abstractions, derived from human input, with MCTS to facilitate efficient exploration. We draw from existing work in hierarchical reinforcement learning, interactive machine learning and show how multi-step actions, represented as stochastic policies, can serve as good action selection heuristics. We demonstrate the efficacy of our approach in the PacMan domain and highlight its advantages over traditional MCTS.

A Survey of Music Recommendation Systems and Future Perspectives <=SEP=> Along with the rapid expansion of digital music formats, managing and searching for songs has become significant. Though music information retrieval (MIR) techniques have been made successfully in last ten years, the development of music recommender systems is still at a very early stage. Therefore, this paper surveys a general framework and state-of-art approaches in recommending music. Two popular algorithms: collaborative filtering (CF) and content-based model (CBM), have been found to perform well. Due to the relatively poor experience in finding songs in long tail and the powerful emotional meanings in music, two user-centric approaches: context-based model and emotion-based model, have been paid increasing attention. In this paper, three key components in music recommender user modelling, item profiling, and match algorithms are discussed. Six recommendation models and four potential issues towards user experience, are explained. However, subjective music recommendation system has not been fully investigated. To this end, we propose a motivation-based model using the empirical studies of human behaviour, sports education, music psychology.

Image super-resolution using gradient profile prior <=SEP=> In this paper, we propose an image super-resolution approach using a novel generic image prior - gradient profile prior, which is a parametric prior describing the shape and the sharpness of the image gradients. Using the gradient profile prior learned from a large number of natural images, we can provide a constraint on image gradients when we estimate a hi-resolution image from a low-resolution image. With this simple but very effective prior, we are able to produce state-of-the-art results. The reconstructed hi-resolution image is sharp while has rare ringing or jaggy artifacts.

DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning <=SEP=> We study the problem of learning to reason in large scale knowledge graphs (KGs). More specifically, we describe a novel reinforcement learning framework for learning multi-hop relational paths: we use a policy-based agent with continuous states based on knowledge graph embeddings, which reasons in a KG vector space by sampling the most promising relation to extend its path. In contrast to prior work, our approach includes a reward function that takes the accuracy, diversity, and efficiency into consideration. Experimentally, we show that our proposed method outperforms a path-ranking based algorithm and knowledge graph embedding methods on Freebase and Never-Ending Language Learning datasets.1

Adversarial Geometry and Lighting using a Differentiable Renderer <=SEP=> Many machine learning image classifiers are vulnerable to adversarial attacks, inputs with perturbations designed to intentionally trigger misclassification. Current adversarial methods directly alter pixel colors and evaluate against pixel norm-balls: pixel perturbations smaller than a specified magnitude, according to a measurement norm. This evaluation, however, has limited practical utility since perturbations in the pixel space do not correspond to underlying real-world phenomena of image formation that lead to them and has no security motivation attached. Pixels in natural images are measurements of light that has interacted with the geometry of a physical scene. As such, we propose a novel evaluation measure, parametric normballs, by directly perturbing physical parameters that underly image formation. One enabling contribution we present is a physically-based differentiable renderer that allows us to propagate pixel gradients to the parametric space of lighting and geometry. Our approach enables physically-based adversarial attacks, and our differentiable renderer leverages models from the interactive rendering literature to balance the performance and accuracy trade-offs necessary for a memory-efficient and scalable adversarial data augmentation workflow.

A framework for the design and integration of collaborative classroom games <=SEP=> The progress registered in the use of video games as educational tools has not yet been successfully transferred to the classroom. In an attempt to close this gap, a framework was developed that assists in the design and classroom integration of educational games. The framework addresses both the educational dimension and the ludic dimension. The educational dimension employs Bloom’s revised taxonomy to define learning objectives and applies the classroom multiplayer presential game (CMPG) pedagogical model while the ludic dimension determines the gaming elements subject to constraints imposed by the educational dimension. With a view to validating the framework, a game for teaching electrostatics was designed and experimentally implemented in a classroom context. An evaluation based on pre/post testing found that the game increased the average number of correct answers by students participating in the experiment from 6.11 to 10.00, a result found to be statistically significant. Thus validated, the framework offers a promising basis for further exploration through the development of other games and fine-tuning of its components. 2011 Elsevier Ltd. All rights reserved.

Effects of growth mode and pyruvate carboxylase on succinic acid production by metabolically engineered strains of Escherichia coli. <=SEP=> Escherichia coli NZN111, which lacks activities for pyruvate-formate lyase and lactate dehydrogenase, and AFP111, a derivative which contains an additional mutation in ptsG (a gene encoding an enzyme of the glucose phophotransferase system), accumulate significant levels of succinic acid (succinate) under anaerobic conditions. Plasmid pTrc99A-pyc, which expresses the Rhizobium etli pyruvate carboxylase enzyme, was introduced into both strains. We compared growth, substrate consumption, product formation, and activities of seven key enzymes (acetate kinase, fumarate reductase, glucokinase, isocitrate dehydrogenase, isocitrate lyase, phosphoenolpyruvate carboxylase, and pyruvate carboxylase) from glucose for NZN111, NZN111/pTrc99A-pyc, AFP111, and AFP111/pTrc99A-pyc under both exclusively anaerobic and dual-phase conditions (an aerobic growth phase followed by an anaerobic production phase). The highest succinate mass yield was attained with AFP111/pTrc99A-pyc under dual-phase conditions with low pyruvate carboxylase activity. Dual-phase conditions led to significant isocitrate lyase activity in both NZN111 and AFP111, while under exclusively anaerobic conditions, an absence of isocitrate lyase activity resulted in significant pyruvate accumulation. Enzyme assays indicated that under dual-phase conditions, carbon flows not only through the reductive arm of the tricarboxylic acid cycle for succinate generation but also through the glyoxylate shunt and thus provides the cells with metabolic flexibility in the formation of succinate. Significant glucokinase activity in AFP111 compared to NZN111 similarly permits increased metabolic flexibility of AFP111. The differences between the strains and the benefit of pyruvate carboxylase under both exclusively anaerobic and dual-phase conditions are discussed in light of the cellular constraint for a redox balance.

Cloning Cryptographic RFID <=SEP=> We develop a new, custom-built hardware for emulating contactless smartcards compliant to ISO 14443. The device is based on a modern low-cost microcontroller and can support basically all relevant (cryptographic) protocols used by contactless smartcards today, e.g., those based on AES or Triple-DES. As a proof of concept, we present a full emulation of Mifare Classic cards on the basis of our highly optimized implementation of the stream cipher Crypto1. The implementation enables the creation of exact clones of such cards, including the UID. We furthermore reverse-engineered the protocol of DESFire EV1 and realize the first emulation of DESFire and DESFire EV1 cards in the literature. We practically demonstrate the capabilities of our emulator by spoofing several real-world systems, e.g., creating a contactless payment card which allows an attacker to set the stored credit balance as desired and hence make an infinite amount of payments.

Spoken Language Recognition: From Fundamentals to Practice <=SEP=> Spoken language recognition refers to the automatic process through which we determine or verify the identity of the language spoken in a speech sample. We study a computational framework that allows such a decision to be made in a quantitative manner. In recent decades, we have made tremendous progress in spoken language recognition, which benefited from technological breakthroughs in related areas, such as signal processing, pattern recognition, cognitive science, and machine learning. In this paper, we attempt to provide an introductory tutorial on the fundamentals of the theory and the state-of-the-art solutions, from both phonological and computational aspects. We also give a comprehensive review of current trends and future research directions using the language recognition evaluation (LRE) formulated by the National Institute of Standards and Technology (NIST) as the case studies.