Query: Automatic Defect Detection for TFT-LCD Array Process Using Quasiconformal Kernel Support Vector Data Description

Relevant passages:
Intrusion Detection with Neural Networks <=SEP=> With the rapid expansion of computer networks during the past few years, security has become a crucial issue for modern computer systems. A good way to detect illegitimate use is through monitoring unusual user activity. Methods of intrusion detection based on hand-coded rule sets or predicting commands on-line are laborous to build or not very reliable. This paper proposes a new way of applying neural networks to detect intrusions. We believe that a user leaves a ’print’ when using the system; a neural network can be used to learn this print and identify each user much like detectives use thumbprints to place people at crime scenes. If a user’s behavior does not match his/her print, the system administrator can be alerted of a possible security breech. A backpropagation neural network called NNID (Neural Network Intrusion Detector) was trained in the identification task and tested experimentally on a system of 10 users. The system was 96% accurate in detecting unusual activity, with 7% false alarm rate. These results suggest that learning user profiles is an effective way for detecting intrusions.

Training Support Vector Machines: an Application to Face Detection <=SEP=> Detection (To appear in the Proceedings of CVPR'97, June 17-19, 1997, Puerto Rico.) Edgar Osunay? Robert Freund? Federico Girosiy yCenter for Biological and Computational Learning and ?Operations Research Center Massachusetts Institute of Technology Cambridge, MA, 02139, U.S.A. Abstract We investigate the application of Support Vector Machines (SVMs) in computer vision. SVM is a learning technique developed by V. Vapnik and his team (AT&T Bell Labs.) that can be seen as a new method for training polynomial, neural network, or Radial Basis Functions classi ers. The decision surfaces are found by solving a linearly constrained quadratic programming problem. This optimization problem is challenging because the quadratic form is completely dense and the memory requirements grow with the square of the number of data points. We present a decomposition algorithm that guarantees global optimality, and can be used to train SVM's over very large data sets. The main idea behind the decomposition is the iterative solution of sub-problems and the evaluation of optimality conditions which are used both to generate improved iterative values, and also establish the stopping criteria for the algorithm. We present experimental results of our implementation of SVM, and demonstrate the feasibility of our approach on a face detection problem that involves a data set of 50,000 data points.

Network intrusion detection <=SEP=> Intrusion detection is a new, retrofit approach for providing a sense of security in existing computers and data networks, while allowing them to operate in their current "open" mode. The goal of intrusion detection is to identify unauthorized use, misuse, and abuse of computer systems by both system insiders and external penetrators. The intrusion detection problem is becoming a challenging task due to the proliferation of heterogeneous computer networks since the increased connectivity of computer systems gives greater access to outsiders and makes it easier for intruders to avoid identification. Intrusion detection systems (IDSs) are based on the beliefs that an intruder's behavior will be noticeably different from that of a legitimate user and that many unauthorized actions are detectable. Typically, IDSs employ statistical anomaly and rulebased misuse models in order to detect intrusions. A number of prototype IDSs have been developed at several institutions, and some of them have also been deployed on an experimental basis in operational systems. In the present paper, several host-based and network-based IDSs are surveyed, and the characteristics of the corresponding systems are identified. The host-based systems employ the host operating system's audit trails as the main source of input to detect intrusive activity, while most of the network-based IDSs build their detection mechanism on monitored network traffic, and some employ host audit trails as well. An outline of a statistical anomaly detection algorithm employed in a typical IDS is also included.<<ETX>>

Comparison of learning algorithms for handwritten digit recognition <=SEP=> This paper compares the performance of several classi er algorithms on a standard database of handwritten digits. We consider not only raw accuracy, but also rejection, training time, recognition time, and memory requirements.

Efficient Progressive Sampling <=SEP=> Having access to massive amounts of data does not necessarily imply that induction algorithms must use them all. Samples often provide the same accuracy with far less computational cost. However, the correct sample size rarely is obvious. We analyze methods for progressive samplingusing progressively larger samples as long as model accuracy improves. We explore several notions of efficient progressive sampling. We analyze efficiency relative to induction with all instances; we show that a simple, geometric sampling schedule is asymptotically optimal, and we describe how best to take into account prior expectations of accuracy convergence. We then describe the issues involved in instantiating an efficient progressive sampler, including how to detect convergence. Finally, we provide empirical results comparing a variety of progressive sampling methods. We conclude that progressive sampling can be remarkably efficient .

Improving Indoor Localization Using Convolutional Neural Networks on Computationally Restricted Devices <=SEP=> Indoor localization is one of the key enablers for various application and service areas that rely on precise locations of people, goods, and assets, ranging from home automation and assisted living to increased automation of production and logistic processes and wireless network optimization. Existing solutions provide various levels of precision, which also depends on the complexity of the indoor radio environment. In this paper, we propose two methods for reducing the localization error in indoor non-line-of-sight (NLoS) conditions using raw channel impulse response (CIR) information obtained from ultra-wide band radios requiring no prior knowledge about the radio environment. The methods are based on NLoS channel classification and ranging error regression models, both using convolutional neural networks (CNNs) and implemented in the TensorFlow computational framework. We first show that NLoS channel classification using raw CIR data outperforms existing approaches that are based on derived input signal features. We further demonstrate that the predicted NLoS channel state and predicted ranging error information, used in combination with least squares (LS) and weighted LS location estimation algorithms, significantly improve indoor localization performance. We also evaluate the computational performance and suitability of the proposed CNN-based algorithms on various computing platforms with a wide range of different capabilities and show that in a distributed localization system, they can also be used on computationally restricted devices.

Feature Extraction Methods for Time Series Data in SAS ® Enterprise Miner TM <=SEP=> Because time series data have a unique data structure, it is not easy to apply some existing data mining tools directly to the data. For example, in classification and clustering problems, each time point is often considered a variable and each time series is considered an observation. As the time dimension increases, the number of variables also increases, in proportion to the time dimension. Therefore, data mining tasks require some feature extraction techniques to summarize each time series in a form that has a significantly lower dimension. This paper describes various feature extraction methods for time series data that are implemented in SAS Enterprise MinerTM. INTRODUCTION Time series data mining has four major tasks: clustering, indexing, classification, and segmentation. Clustering finds groups of time series that have similar patterns. Indexing finds similar time series in order, given a query series. Classification assigns each time series to a known category by using a trained model. Segmentation partitions time series. Time series data can be considered multidimensional data; this means that there is one observation per time unit, and each time unit makes one dimension. Some common data mining techniques are used for the tasks. However, in the real world, each time series is usually a high-dimensional sequence, such as stock market data whose prices change over time or data collected by a medical device. When the time unit is seconds, the dimensions of data that accumulate in just one hour are 3,600. Moreover, the dimensions are highly correlated to one another. The number of variables in training data increases proportionally as the time dimension increases. Most existing data mining tools cannot be used efficiently on time series data without a dimension reduction. Therefore, a dimension reduction is required through feature extraction techniques that map each time series to a lower-dimensional space. The most common techniques of dimension reduction in time series are singular value decomposition (SVD), discrete Fourier transformation (DFT), discrete wavelet transformation (DWT), and line segment methods. Some classical time series analyses, such as seasonal, trend, seasonal decomposition, and correlation analyses, are also used for feature extraction. This paper shows how to use SAS Enterprise Miner to implement the feature extraction techniques. But it does not attempt to explain these time series techniques in detail and instead invites the interested reader to explore some of the literature on the subject: Keogh and Pazzani (2000a), Keogh et al. (2000), and Gavrilov et al. (2000) for time series dimensionality reduction and the TIMESERIES procedure documentation in SAS/ETS for the classical time series analyses. This paper is organized as follows. First, it explains feature extraction and dimension reduction techniques that use classical time series analysis, and then it describes feature extraction techniques that use some well-known mathematical functions for dimension reduction. Next, it demonstrates the performance of dimension reduction techniques by presenting some examples. The paper uses SAS Enterprise Miner 13.1 to demonstrate these techniques.

On Evaluation of 6D Object Pose Estimation <=SEP=> A pose of a rigid object has 6 degrees of freedom and its full knowledge is required in many robotic and scene understanding applications. Evaluation of 6D object pose estimates is not straightforward. Object pose may be ambiguous due to object symmetries and occlusions, i.e. there can be multiple object poses that are indistinguishable in the given image and should be therefore treated as equivalent. The paper defines 6D object pose estimation problems, proposes an evaluation methodology and introduces three new pose error functions that deal with pose ambiguity. The new error functions are compared with functions commonly used in the literature and shown to remove certain types of non-intuitive outcomes. Evaluation tools are provided at: https : //github.com/thodan/obj pose eval

Bach 10 Dataset---- A Versatile Polyphonic Music Dataset <=SEP=> This is a polyphonic music dataset which can be used for versatile research problems, such as Multi-pitch Estimation and Tracking, Audio-score Alignment, Source Separation, etc. This dataset consists of the audio recordings of each part and the ensemble of ten pieces of four-part J.S. Bach chorales, as well as their MIDI scores, the ground-truth alignment between the audio and the score, the ground-truth pitch values of each part and the ground-truth notes of each piece. The audio recordings of the four parts (Soprano, Alto, Tenor and Bass) of each piece are performed by violin, clarinet, saxophone and bassoon, respectively.

Deep Recurrent Regression for Facial Landmark Detection <=SEP=> We propose a novel end-to-end deep architecture for face landmark detection, based on a deep convolutional and deconvolutional network followed by carefully designed recurrent network structures. The pipeline of this architecture consists of three parts. Through the first part, we encode an input face image to resolution-preserved deconvolutional feature maps via a deep network with stacked convolutional and deconvolutional layers. Then, in the second part, we estimate the initial coordinates of the facial key points by an additional convolutional layer on top of these deconvolutional feature maps. In the last part, by using the deconvolutional feature maps and the initial facial key points as input, we refine the coordinates of the facial key points by a recurrent network that consists of multiple long short-term memory components. Extensive evaluations on several benchmark data sets show that the proposed deep architecture has superior performance against the state-of-the-art methods.

The Lone-Actor Terrorist and the TRAP-18 <=SEP=> An open source sample of 111 lone-actor terrorists from the United States and Europe were studied through the lens of the Terrorist Radicalization Assessment Protocol (TRAP-18). This investigative template consists of 8 proximal warning behaviors and 10 distal characteristics for active risk management or active monitoring, respectively, by national security threat assessors. Several aspects of criterion validity were tested in this known outcome sample. Seventy percent of the terrorists were positive for at least half or more of the indicators. When the sample was divided into Islamic extremists, right-wing extremists, and single-issue terrorists, there were no significant differences across all 18 indicators except for 4. When the sample was divided according to successful versus thwarted attackers, the successful attackers were significantly more fixated, creative, and innovative, and failed to have a prior sexually intimate pair bond. They were significantly less likely to have displayed pathway warning behavior and be dependent on a virtual community of likeminded true believers. Effect sizes were small to medium (! " 0.190–0.317). The TRAP-18 appears to have promise as an eventual structured professional judgment risk assessment instrument according to some of the individual terrorist content domains outlined by Monahan (2012, 2016).

Word and Phrase Translation with word2vec <=SEP=> Word and phrase tables are key inputs to machine translations, but costly to produce. New unsupervised learning methods represent words and phrases in a high-dimensional vector space, and these monolingual embeddings have been shown to encode syntactic and semantic relationships between language elements. The information captured by these embeddings can be exploited for bilingual translation by learning a transformation matrix that allows matching relative positions across two monolingual vector spaces. This method aims to identify high-quality candidates for word and phrase translation more costeffectively from unlabeled data. This paper expands the scope of previous attempts of bilingual translation to four languages (English, German, Spanish, and French). It shows how to process the source data, train a neural network to learn the high-dimensional embeddings for individual languages and expands the framework for testing their quality beyond the English language. Furthermore, it shows how to learn bilingual transformation matrices and obtain candidates for word and phrase translation, and assess their quality.

Feature Selection Methods: Genetic Algorithms vs. Greedy-like Search <=SEP=> This paper presents a comparison between two feature selection methods, the Importance Score (IS) which is based on a greedy-like search and a genetic algorithm-based (GA) method, in order to better understand their strengths and limitations and their area of application. The results of our experiments show a very strong relation between the nature of the data and the behavior of both systems. The Importance Score method is more efficient when dealing with little noise and small number of interacting features, while the genetic algorithms can provide a more robust solution at the expense of increased computational effort.

Fast texture synthesis using tree-structured vector quantization <=SEP=> Texture synthesis is important for many applications in computer graphics, vision, and image processing. However, it remains difficult to design an algorithm that is both efficient and capable of generating high quality results. In this paper, we present an efficient algorithm for realistic texture synthesis. The algorithm is easy to use and requires only a sample texture as input. It generates textures with perceived quality equal to or better than those produced by previous techniques, but runs two orders of magnitude faster. This permits us to apply texture synthesis to problems where it has traditionally been considered impractical. In particular, we have applied it to constrained synthesis for image editing and temporal texture generation. Our algorithm is derived from Markov Random Field texture models and generates textures through a deterministic searching process. We accelerate this synthesis process using tree-structured vector quantization.

ClothCap: seamless 4D clothing capture and retargeting <=SEP=> Designing and simulating realistic clothing is challenging. Previous methods addressing the capture of clothing from 3D scans have been limited to single garments and simple motions, lack detail, or require specialized texture patterns. Here we address the problem of capturing regular clothing on fully dressed people in motion. People typically wear multiple pieces of clothing at a time. To estimate the shape of such clothing, track it over time, and render it believably, each garment must be segmented from the others and the body. Our ClothCap approach uses a new multi-part 3D model of clothed bodies, automatically segments each piece of clothing, estimates the minimally clothed body shape and pose under the clothing, and tracks the 3D deformations of the clothing over time. We estimate the garments and their motion from 4D scans; that is, high-resolution 3D scans of the subject in motion at 60 fps. ClothCap is able to capture a clothed person in motion, extract their clothing, and retarget the clothing to new body shapes; this provides a step towards virtual try-on.

Representation and Mimesis in Generative Art : Creating Fifty Sisters <=SEP=> Fifty Sisters is a generative artwork commissioned for the Ars Electronica Museum in Linz. The work consists of fifty 1m ∞ 1m images of computer-synthesized plant-forms, algorithmically ‘grown’ from computer code using artificial evolution and generative grammars. Each plant-like form is derived from the primitive graphic elements of oil company logos. The title of the work refers to the original ‘Seven Sisters’ — a cartel of seven oil companies that dominated the global petrochemical industry and Middle East oil production from the mid–1940s until the oil crisis of the 1970s. In this paper I discuss the issue of representation in generative art and how dialogues in mimesis inform the production of a generative artwork, using Fifty Sisters as an example. I also provide information on how these concepts translate into the technical and how issues of representation necessarily pervade all computer-based generative art. C o m p u t i n g C o m m u n i c a t i o n A e s t h e t i c s a n d X . B e r g a m o , I t a l y . x c o a x . o r g

Arrays in Blitz++ <=SEP=> Numeric arrays in Blitz++ rival the eeciency of Fortran, but without any extensions to the C++ language. Blitz++ has features unavailable in Fortran 90/95, such as arbitrary transpose operations, array renaming, tensor notation, partial reductions, multicomponent arrays and stencil operators. The library handles parsing and analysis of array expressions on its own using the expression templates technique, and performs optimizations (such as loop transformations) which have until now been the responsibility of compilers.

Integration of a Wireless I/O Interface for PROFIBUS and PROFINET for Factory Automation <=SEP=> Cost related to the wiring of sensors and actuators in the manufacturing industry is rapidly increasing with the number of field devices. Complex engineering as well as cable wear and tear are important factors. For over a decade, fieldbuses have been the dominating approach to simplify installation, reduce engineering efforts, and increase reliability at the field level. The next step in this process is to introduce wireless communication in certain problematic parts of the field network. In order to do this, a reliable real-time communication system, designed to cope with the harsh environments where factory automation systems are employed, is required. The wireless interface for sensors and actuators (WISA), with its two subconcepts WISA-power and WISA-com, is such a system. This paper discusses how the WISA concept can be efficiently integrated into wired field networks for factory automation-both state-of-the-art [process fieldbus decentral peripherals (PROFIBUS DP)] and new (PROFINET IO) networks. We propose amendments to WISA, which will improve the 802.11b/g coexistence and harmonize the integration of WISA for sensor/actuator communication in, e.g., PROFINET IO systems. The suggested improvements relate to both the radio protocol in order to improve coexistence with other wireless technologies as well as concepts for the integration of WISA into the field network of PROFINET/PROFIBUS.

Dual-band circularly polarized microstrip antenna <=SEP=> A new dual-band circularly polarized microstrip antenna is presented experimentally. In this paper, using dual-radiator a new design dual-band antenna can be obtained. The frequency ratio of this design is flexible which more than 1.4.

A Transceiver Module for FMCW Radar Sensors Using 94-GHz Dot-Type Schottky Diode Mixer <=SEP=> In this study, we fabricated a 94-GHz transceiver module for a millimeter-wave (MMW) frequency modulation continuous wave (FMCW) radar sensor. The transceiver modules consist of a waveguide voltage-controlled oscillator (VCO) and Rx module using a single balanced mixer. We designed a mixer with a conversion loss of 6.4 dB, without using an amplifier. Also, the waveguide VCO consisted of an InP Gunn diode, a varactor diode, two bias posts with LPF, and a Magic Tee for the MMW radar transceiver. The fabricated VCO has a tuning range of 1280 MHz by a varactor bias of 0~20 V, 1.69% linearity range of 680 MHz, and current consumption of 154 to 157 mA. The completed module has a good conversion loss of 10.6 dB with an LO power of 11.4 dBm at 94 GHz. With this RF and LO input power, the conversion loss was maintained between 10.2-11.5 dB in the RF frequency range of 93.67-94.95 GHz.

The Spectrum Kernel: A String Kernel for SVM Protein Classification <=SEP=> We introduce a new sequence-similarity kernel, the spectrum kernel, for use with support vector machines (SVMs) in a discriminative approach to the protein classification problem. Our kernel is conceptually simple and efficient to compute and, in experiments on the SCOP database, performs well in comparison with state-of-the-art methods for homology detection. Moreover, our method produces an SVM classifier that allows linear time classification of test sequences. Our experiments provide evidence that string-based kernels, in conjunction with SVMs, could offer a viable and computationally efficient alternative to other methods of protein classification and homology detection.

A half-bridge resonant inverter with three-phase PWM rectifier for induction heating <=SEP=> A half-bridge resonant inverter with three-phase PWM rectifier for induction heating is proposed in this paper. An adjustable frequency limit is introduced to maintain the inverter's switching frequency at a value higher than the resonant frequency for zero voltage operation. In case of no work piece in the induction coil, the dc bus can be adjusted while the switching frequency of the inverter remains at the limit. The important advantages of the proposed system are reduced switching loss, small size of filter and faster response at a no load condition. The proposed technique is implemented on the created hardware setup. The inverter operates at in a frequency range of 20–40 kHz, while the three-phase PWM rectifier runs at 23.8 kHz to deliver output power at 1.5 kW.

Predicting Friends and Foes in Signed Networks Using Inductive Inference and Social Balance Theory <=SEP=> Besides the notion of friendship, trust or support in social networking sites (SNSs), quite often social interactions also reflect users' antagonistic attitude towards each other. Thus, the hidden knowledge contained in social network data can be considered as an important resource to discover the formation of such positive and negative links. In this work, an inductive learning framework is presented to suggest 'friends' and 'foes' links to individuals which envisage the social balance among users in the corresponding friends and foes networks (FFN). First we learn a model by applying C4.5, the most widely adopted decision tree based classification algorithm, to exploit the feature patterns presented in the users' FFN and utilizing it to further predict friend/foe relationship of unknown links. Secondly, a quantitative measure of social balance, balance index, is used to support our decision on the recommendation of new friends and foes links (FFL) to avoid possible imbalance in the extended FFN with newly suggested links. The proposed scheme ensures that the recommendation of new FFLs either maintains or enhances the balancing factor of the existing FFN of an individual. Experimental results show the effectiveness of our proposed schemes.

A review on 3 D micro-additive manufacturing technologies <=SEP=> New microproducts need the utilization of a diversity of materials and have complicated three-dimensional (3D) microstructures with high aspect ratios. To date, many micromanufacturing processes have been developed but specific class of such processes are applicable for fabrication of functional and true 3D microcomponents/assemblies. The aptitude to process a broad range of materials and the ability to fabricate functional and geometrically complicated 3D microstructures provides the additive manufacturing (AM) processes some profits over traditional methods, such as lithography-based or micromachining approaches investigated widely in the past. In this paper, 3D micro-AM processes have been classified into three main groups, including scalable micro-AM systems, 3D direct writing, and hybrid processes, and the key processes have been reviewed comprehensively. Principle and recent progress of each 3D micro-AM process has been described, and the advantages and disadvantages of each process have been presented.

Semantic audio content-based music recommendation and visualization based on user preference examples <=SEP=> Preference elicitation is a challenging fundamental problem when designing recommender systems. In the present work we propose a content-based technique to automatically generate a semantic representation of the user’s musical preferences directly from audio. Starting from an explicit set of music tracks provided by the user as evidence of his/her preferences, we infer high-level semantic descriptors for each track obtaining a user model. To prove the benefits of our proposal, we present two applications of our technique. In the first one, we consider three approaches to music recommendation, two of them based on a semantic music similarity measure, and one based on a semantic probabilistic model. In the second application, we address the visualization of the user’s musical preferences by creating a humanoid cartoon-like character – the Musical Avatar – automatically inferred from the semantic representation. We conducted a preliminary evaluation of the proposed technique in the context of these applications with 12 subjects. The results are promising: the recommendations were positively evaluated and close to those coming from state-ofthe-art metadata-based systems, and the subjects judged the generated visualizations to capture their core preferences. Finally, we highlight the advantages of the proposed semantic user model for enhancing the user interfaces of information filtering systems. 2012 Elsevier Ltd. All rights reserved.

An estimation of the number of cells in the human body. <=SEP=> BACKGROUND
All living organisms are made of individual and identifiable cells, whose number, together with their size and type, ultimately defines the structure and functions of an organism. While the total cell number of lower organisms is often known, it has not yet been defined in higher organisms. In particular, the reported total cell number of a human being ranges between 10(12) and 10(16) and it is widely mentioned without a proper reference.


AIM
To study and discuss the theoretical issue of the total number of cells that compose the standard human adult organism.


SUBJECTS AND METHODS
A systematic calculation of the total cell number of the whole human body and of the single organs was carried out using bibliographical and/or mathematical approaches.


RESULTS
A current estimation of human total cell number calculated for a variety of organs and cell types is presented. These partial data correspond to a total number of 3.72 × 10(13).


CONCLUSIONS
Knowing the total cell number of the human body as well as of individual organs is important from a cultural, biological, medical and comparative modelling point of view. The presented cell count could be a starting point for a common effort to complete the total calculation.

Galvanic Skin Response : A Physiological Sensor System for Affective Computing <=SEP=> system is the change in electrical properties of skin due to variation in physiological and psychological conditions. The change is caused by the degree to which a person's sweat glands are active. Psychological status of a person tends to make the glands active and this change the skin resistance. Drier the skin is, higher will be the skin resistance. This variation in skin resistance ranges from 5kΩ to 25kΩ. In the current work, a subject whose Galvanic skin response (GSR) is to be measured, has been shown/played a movie clipping, images or recorded audio signals. Depending upon the theme, emotion will be evoked in the subject. Due to the change in emotion, GSR varies. This variation in GSR is recorded for a fixed time interval. In the present work, a total of 75 subjects are selected. People from different age groups and social background, both male and female have been carefully considered. Data acquisition and analysis is carried out by using LabVIEW. The results obtained are convincing and follows the ground reality with a high level of accuracy. As the subject also gives the feedback about the emotions he/she experienced, the results obtained are validated.

VANET-cloud: a generic cloud computing model for vehicular Ad Hoc networks <=SEP=> Cloud computing is a network access model that aims to transparently and ubiquitously share a large number of computing resources. These are leased by a service provider to digital customers, usually through the Internet. Due to the increasing number of traffic accidents and dissatisfaction of road users in vehicular networks, the major focus of current solutions provided by intelligent transportation systems is on improving road safety and ensuring passenger comfort. Cloud computing technologies have the potential to improve road safety and traveling experience in ITSs by providing flexible solutions (i.e., alternative routes, synchronization of traffic lights, etc.) needed by various road safety actors such as police, and disaster and emergency services. In order to improve traffic safety and provide computational services to road users, a new cloud computing model called VANET-Cloud applied to vehicular ad hoc networks is proposed. Various transportation services provided by VANET-Cloud are reviewed, and some future research directions are highlighted, including security and privacy, data aggregation, energy efficiency, interoperability, and resource management.

A dual-polarity grappa kernel for the robust reconstruction of accelerated EPI data <=SEP=> The quality of high-resolution Echo Planar images of the human brain has improved greatly in recent years, enabled by novel multi-channel receiver coil arrays and parallel imaging. However, in regions with local field inhomogeneity, EPI artifacts limit which parts of the brain can be imaged successfully. In this work, we present evidence that certain image artifacts can be attributed to nonlinear phase errors that are present in regions of local susceptibility gradients and certain coil array elements. Because these phase errors cannot be corrected with conventional Nyquist ghost correction, we propose a new method that integrates ghost correction with parallel imaging reconstruction. The proposed Dual-Polarity GRAPPA method operates directly on raw EPI data to estimate k-space data from the under-sampled acquisition while simultaneously correcting inherent EPI phase errors. We present examples of this method successfully removing strong phase-error artifacts in high-resolution 7T EPI data.

Marble: high-throughput phenotyping from electronic health records via sparse nonnegative tensor factorization <=SEP=> The rapidly increasing availability of electronic health records (EHRs) from multiple heterogeneous sources has spearheaded the adoption of data-driven approaches for improved clinical research, decision making, prognosis, and patient management. Unfortunately, EHR data do not always directly and reliably map to phenotypes, or medical concepts, that clinical researchers need or use. Existing phenotyping approaches typically require labor intensive supervision from medical experts. We propose Marble, a novel sparse non-negative tensor factorization method to derive phenotype candidates with virtually no human supervision. Marble decomposes the observed tensor into two terms, a bias tensor and an interaction tensor. The bias tensor represents the baseline characteristics common amongst the overall population and the interaction tensor defines the phenotypes. We demonstrate the capability of our proposed model on both simulated and patient data from a publicly available clinical database. Our results show that Marble derived phenotypes provide at least a 42.8% reduction in the number of non-zero element and also retains predictive power for classification purposes. Furthermore, the resulting phenotypes and baseline characteristics from real EHR data are consistent with known characteristics of the patient population. Thus it can potentially be used to rapidly characterize, predict, and manage a large number of diseases, thereby promising a novel, data-driven solution that can benefit very large segments of the population.