title: Above the Clouds: A Berkeley View of Cloud Computing

text: Cloud Computing, the long-held dream of computing as a utility, has the potential to transform a large part of the IT industry, making software even more attractive as a service and shaping the way IT hardware is designed and purchased. Developers with innovative ideas for new Internet services no longer require the large capital outlays in hardware to deploy their service or the human expense to operate it. They need not be concerned about overprovisioning for a service whose popularity does not meet their predictions, thus wasting costly resources, or underprovisioning for one that becomes wildly popular, thus missing potential customers and revenue. Moreover, companies with large batch-oriented tasks can get results as quickly as their programs can scale, since using 1000 servers for one hour costs no more than using one server for 1000 hours. This elasticity of resources, without paying a premium for large scale, is unprecedented in the history of IT. Cloud Computing refers to both the applications delivered as services over the Internet and the hardware and systems software in the datacenters that provide those services. The services themselves have long been referred to as Software as a Service (SaaS). The datacenter hardware and software is what we will call a Cloud. When a Cloud is made available in a pay-as-you-go manner to the general public, we call it a Public Cloud; the service being sold is Utility Computing. We use the term Private Cloud to refer to internal datacenters of a business or other organization, not made available to the general public. Thus, Cloud Computing is the sum of SaaS and Utility Computing, but does not include Private Clouds. People can be users or providers of SaaS, or users or providers of Utility Computing. We focus on SaaS Providers (Cloud Users) and Cloud Providers, which have received less attention than SaaS Users. From a hardware point of view, three aspects are new in Cloud Computing.


title: 2.4 to 61 GHz Multiband Double-Directional Propagation Measurements in Indoor Office Environments

text: This paper presents the details and results of double-directional propagation measurements carried out in two indoor office environments: a semi-open, cubicle-type office space and a more traditional work environment with closed offices. The measurements cover seven frequency bands from 2.4 to 61 GHz, permitting the propagation characteristics to be compared over a wide range of candidate radio frequencies for next-generation mobile wireless systems, including ultra high frequency and millimeter-wave bands. A novel processing algorithm is introduced for the expansion of multiband measurement data into sets of discrete multipath components. Based on the resulting multipath parameter estimates, models are presented for frequency-dependent path loss, shadow fading, copolarization ratio, delay spread, and angular spreads, along with their interfrequency correlations. Our results indicate a remarkably strong consistency in multipath structure over the entire frequency range considered.


title: A review of content-based image retrieval systems in medical applications - clinical benefits and future directions

text: Content-based visual information retrieval (CBVIR) or content-based image retrieval (CBIR) has been one on the most vivid research areas in the field of computer vision over the last 10 years. The availability of large and steadily growing amounts of visual and multimedia data, and the development of the Internet underline the need to create thematic access methods that offer more than simple text-based queries or requests based on matching exact database fields. Many programs and tools have been developed to formulate and execute queries based on the visual or audio content and to help browsing large multimedia repositories. Still, no general breakthrough has been achieved with respect to large varied databases with documents of differing sorts and with varying characteristics. Answers to many questions with respect to speed, semantic descriptors or objective image interpretations are still unanswered. In the medical field, images, and especially digital images, are produced in ever-increasing quantities and used for diagnostics and therapy. The Radiology Department of the University Hospital of Geneva alone produced more than 12,000 images a day in 2002. The cardiology is currently the second largest producer of digital images, especially with videos of cardiac catheterization ( approximately 1800 exams per year containing almost 2000 images each). The total amount of cardiologic image data produced in the Geneva University Hospital was around 1 TB in 2002. Endoscopic videos can equally produce enormous amounts of data. With digital imaging and communications in medicine (DICOM), a standard for image communication has been set and patient information can be stored with the actual image(s), although still a few problems prevail with respect to the standardization. In several articles, content-based access to medical images for supporting clinical decision-making has been proposed that would ease the management of clinical data and scenarios for the integration of content-based access methods into picture archiving and communication systems (PACS) have been created. This article gives an overview of available literature in the field of content-based access to medical image data and on the technologies used in the field. Section 1 gives an introduction into generic content-based image retrieval and the technologies used. Section 2 explains the propositions for the use of image retrieval in medical practice and the various approaches. Example systems and application areas are described. Section 3 describes the techniques used in the implemented systems, their datasets and evaluations. Section 4 identifies possible clinical benefits of image retrieval systems in clinical practice as well as in research and education. New research directions are being defined that can prove to be useful. This article also identifies explanations to some of the outlined problems in the field as it looks like many propositions for systems are made from the medical domain and research prototypes are developed in computer science departments using medical datasets. Still, there are very few systems that seem to be used in clinical practice. It needs to be stated as well that the goal is not, in general, to replace text-based retrieval methods as they exist at the moment but to complement them with visual search tools.


title: Wavelet based real-time smoke detection in video

text: A method for smoke detection in video is proposed. It is assumed the camera monitoring the scene is stationary. Since the smoke is semi-transparent, edges of image frames start loosing their sharpness and this leads to a decrease in the high frequency content of the image. To determine the smoke in the field of view of the camera, the background of the scene is estimated and decrease of high frequency energy of the scene is monitored using the spatial wavelet transforms of the current and the background images. Edges of the scene are especially important because they produce local extrema in the wavelet domain. A decrease in values of local extrema is also an indicator of smoke. In addition, scene becomes grayish when there is smoke and this leads to a decrease in chrominance values of pixels. Periodic behavior in smoke boundaries and convexity of smoke regions are also analyzed. All of these clues are combined to reach a final decision.


title: Short-Circuit Current of Wind Turbines With Doubly Fed Induction Generator

text: The short-circuit current contribution of wind turbines has not received much attention so far. This paper considers the short-circuit behavior, especially the short-circuit current of wind turbines with a doubly fed induction generator. Mostly, these wind turbines have a crowbar to protect the power electronic converter that is connected to the rotor windings of the induction generator. First, the maximum value of the short-circuit current of a conventional induction machine is determined. The differences between a crowbar-protected doubly fed induction generator and a conventional induction generator are highlighted and approximate equations for the maximum short-circuit current of a doubly fed induction generator are determined. The values obtained in this way are compared to the values obtained from time domain simulations. The differences are less then 15%


title: Game Theory in Wireless Networks: A Tutorial

text: The behavior of a given wireless device may affect the communication capabilities of a neighboring device, notably because the radio communication channel is usually shared in wireless networks. In this tutorial, we carefully explain how situations of this kind can be modelled by making use of game theory. By leveraging on four simple running examples, we introduce the most fundamental concepts of non-cooperative game theory. This approach should help students and scholars to quickly master this fascinating analytical tool without having to read the existing lengthy, economics-oriented books. It should also assist them in modelling problems of their own.


title: Cryptography and cryptanalysis for embedded systems

text: A growing number of devices of daily use are equipped with computing capabilities. Today, already more than 98 % of all manufactured microprocessors are employed in embedded applications , leaving less than 2 % to traditional computers. Many of these embedded devices are enabled to communicate amongst each other and form networks. A side effect of the rising interconnectedness is a possible vulnerability of these embedded systems. Attacks that have formerly been restricted to PCs can suddenly be launched against cars, tickets, ID cards or even pacemakers. At the same time the security awareness of users and manufacturers of such systems is much lower than in classical PC environments. This renders security one key aspect of embedded systems design and for most pervasive computing applications. As embedded systems are usually deployed in large numbers, costs are a main concern of system developers. Hence embedded security solutions have to be cheap and efficient. Many security services such as digital signatures can only be realized by public key cryptography. Yet, public key schemes are in terms of computation orders of magnitude more expensive than private key cryptosystems. At the same time the prevailing schemes rely on very similar security assumptions. If one scheme gets broken, almost all cryptosystems employing asymmetric cryptography become useless. The first part of this work explores alternatives to the prevailing public key cryptosystems. Two alternative signature schemes and one public key encryption scheme from the family of post quantum cryptosystems are explored. Their security relies on different assumptions so that a break of one of the prevailing schemes does not affect the security of the studied alternatives. The main focus lies on the implementational aspects of these schemes for embedded systems. One actual outcome is that, contrary to common belief, the presented schemes provide similar and in some cases even better performance than the prevailing schemes. The presented solutions include a highly scalable software implementation of the Merkle signature scheme aimed at low-cost microprocessors. For signatures in hardware an FPGA framework for implementing a family of signature schemes based on multivariate quadratic equations is presented. Depending on the chosen scheme, multivariate quadratic signatures show better performance than elliptic curves in terms of area consumption and performance. The McEliece cryptosystem is an alternative public key encryption scheme which was believed to be infeasible on embedded platforms due to its large key size. This work shows that by applying certain …


title: Recall of childhood trauma: a prospective study of women's memories of child sexual abuse.

text: One hundred twenty-nine women with previously documented histories of sexual victimization in childhood were interviewed and asked detailed questions about their abuse histories to answer the question "Do people actually forget traumatic events such as child sexual abuse, and if so, how common is such forgetting?" A large proportion of the women (38%) did not recall the abuse that had been reported 17 years earlier. Women who were younger at the time of the abuse and those who were molested by someone they knew were more likely to have no recall of the abuse. The implications for research and practice are discussed. Long periods with no memory of abuse should not be regarded as evidence that the abuse did not occur.


title: Blind Identification of Underdetermined Mixtures by Simultaneous Matrix Diagonalization

text: In this paper, we study simultaneous matrix diagonalization-based techniques for the estimation of the mixing matrix in underdetermined independent component analysis (ICA). This includes a generalization to underdetermined mixtures of the well-known SOBI algorithm. The problem is reformulated in terms of the parallel factor decomposition (PARAFAC) of a higher-order tensor. We present conditions under which the mixing matrix is unique and discuss several algorithms for its computation.


title: The Internet of Things: A Review of Enabled Technologies and Future Challenges

text: The Internet of Things (IoT) is an emerging classical model, envisioned as a system of billions of small interconnected devices for posing the state-of-the-art findings to real-world glitches. Over the last decade, there has been an increasing research concentration in the IoT as an essential design of the constant convergence between human behaviors and their images on Information Technology. With the development of technologies, the IoT drives the deployment of across-the-board and self-organizing wireless networks. The IoT model is progressing toward the notion of a cyber-physical world, where things can be originated, driven, intermixed, and modernized to facilitate the emergence of any feasible association. This paper provides a summary of the existing IoT research that underlines enabling technologies, such as fog computing, wireless sensor networks, data mining, context awareness, real-time analytics, virtual reality, and cellular communications. Also, we present the lessons learned after acquiring a thorough representation of the subject. Thus, by identifying numerous open research challenges, it is presumed to drag more consideration into this novel paradigm.


title: THE RESTORATIVE BENEFITS OF NATURE : TOWARD AN INTEGRATIVE

text: Directed attention plays an important role in human information processing; its fatigue, in turn, has far reaching consequences. Attention Restoration Theory provides an analysis of the kinds of experiences that lead to recovery from such fatigue. Natural environments turn out to be particularly rich in the character istics necessary for restorative experiences. An integrative framework is proposed that places both directed attention and stress in the larger context of human-environment relationships. © 1995 Academic Press Limited


title: Intracranial EEG and human brain mapping

text: This review is an attempt to highlight the value of human intracranial recordings (intracranial electro-encephalography, iEEG) for human brain mapping, based on their technical characteristics and based on the corpus of results they have already yielded. The advantages and limitations of iEEG recordings are introduced in detail, with an estimation of their spatial and temporal resolution for both monopolar and bipolar recordings. The contribution of iEEG studies to the general field of human brain mapping is discussed through a review of the effects observed in the iEEG while patients perform cognitive tasks. Those effects range from the generation of well-localized evoked potentials to the formation of large-scale interactions between distributed brain structures, via long-range synchrony in particular. A framework is introduced to organize those iEEG studies according to the level of complexity of the spatio-temporal patterns of neural activity found to correlate with cognition. This review emphasizes the value of iEEG for the study of large-scale interactions, and describes in detail the few studies that have already addressed this point.


title: Survey on Hadoop and Introduction to YARN Amogh

text: Big Data, the analysis of large quantities of data to gain new insight has become a ubiquitous phrase in recent years. Day by day the data is growing at a staggering rate. One of the efficient technologies that deal with the Big Data is Hadoop, which will be discussed in this paper. Hadoop, for processing large data volume jobs uses MapReduce programming model. Hadoop makes use of different schedulers for executing the jobs in parallel. The default scheduler is FIFO (First In First Out) Scheduler. Other schedulers with priority, pre-emption and non-pre-emption options have also been developed. As the time has passed the MapReduce has reached few of its limitations. So in order to overcome the limitations of MapReduce, the next generation of MapReduce has been developed called as YARN (Yet Another Resource Negotiator). So, this paper provides a survey on Hadoop, few scheduling methods it uses and a brief introduction to YARN. Keywords—Hadoop, HDFS, MapReduce, Schedulers, YARN.


title: Face recognition in unconstrained videos with matched background similarity

text: Recognizing faces in unconstrained videos is a task of mounting importance. While obviously related to face recognition in still images, it has its own unique characteristics and algorithmic requirements. Over the years several methods have been suggested for this problem, and a few benchmark data sets have been assembled to facilitate its study. However, there is a sizable gap between the actual application needs and the current state of the art. In this paper we make the following contributions. (a) We present a comprehensive database of labeled videos of faces in challenging, uncontrolled conditions (i.e., ‘in the wild’), the ‘YouTube Faces’ database, along with benchmark, pair-matching tests1. (b) We employ our benchmark to survey and compare the performance of a large variety of existing video face recognition techniques. Finally, (c) we describe a novel set-to-set similarity measure, the Matched Background Similarity (MBGS). This similarity is shown to considerably improve performance on the benchmark tests.


title: Implementation of high speed radix-10 parallel multiplier using Verilog

text: The emerging computational complexities arises the need of fast multiplication unit. The importance of multiplication in various applications necessitates improvement in its design so as to obtain the multiplication result efficiently. Multiplication operation can be improved by reducing the number of partial products to be added and by enhancing the adder unit for obtaining sum. The number of partial products can be reduced by using higher radix multiplication. For better speed applications a radix-10 multiplier is proposed which uses recoded multiplier digits as in conventional parallel multiplier design. The multiplier digits are encoded using Signed Digit (SD) radix-10 method which converts the digit set to {-5 to 5} from {0 to 9} and also generate a sign bit. This recoding leads to minimized calculations as only five multiples are required to be calculated and the negative multiples are obtained using 2's complement approach. The negative multiples are used when sign bit is high. A different approach is availed in the multiples generation of the multiplicand digit and during accumulation of partial product obtained during multiplication procedure. A modified BCD adder is used which eliminates the post correction while calculating the sum of two BCD digits. The modified architecture eliminates the extra recoding logic thereby reducing the area of overall architecture. This paper delivers the design and implementation of 16-Bit multiplication unit. The design entry is done in Verilog Hardware Description Language (HDL) and simulated using ISIM Simulator. It is synthesized and implemented using Xilinx ISE 12.2. Synthesis results have shown that 20.3% reduction in 4-Input LUTs and 20.4% reduction in the number of slices is observed in the modified methodology. Further 11.5% reduction of maximum combinational path delay is also observed in the modified architecture, thereby leading to high speed multiplication for VLSI applications.


title: Scenario-Based Performance Analysis of Routing Protocols for Mobile ad-hoc Networks

text: This study is a comparison of three routing protocols proposed for wireless mobile ad-hoc networks. The protocols are: Destination Sequenced Distance Vector (DSDV), Ad-hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR). Extensive simulations are made on a scenario where nodes moves randomly. Results are presented as a function of a novel mobility metric designed to reflect the relative speeds of the nodes in a scenario. Furthermore, three realistic scenarios are introduced to test the protocols in more specialized contexts. In most simulations the reactive protocols (AODV and DSR) performed significantly better than DSDV. At moderate traffic load DSR performed better than AODV for all tested mobility values, while AODV performed better than DSR at higher traffic loads. The latter is caused by the source routes in DSR data packets, which increase the load on the network. routers and hosts, thus a node may forward packets between other nodes as well as run user applications. Mobile ad-hoc networks have been the focus of many recent research and development efforts. Ad-hoc packet radio networks have so far mainly concerned military applications, where a decentralized network configuration is an operative advantage or even a necessity. Networks using ad-hoc configuration concepts can be used in many military applications, ranging from interconnected wireless access points to networks of wireless devices carried by individuals, e.g., digital maps, sensors attached to the body, voice communication, etc. Combinations of wide range and short range ad-hoc networks seek to provide robust, global coverage, even during adverse operating conditions.


title: Language, thought and reference.

text: How should we best analyse the meaning of proper names, indexicals, demonstratives, both simple and complex, and definite descriptions? In what relation do such expressions stand to the objects they designate? In what relation do they stand to mental representations of those objects? Do these expressions form a semantic class, or must we distinguish between those that arc referential and those that are quantificational? Such questions have constituted one of the core research areas in the philosophy of language for much of the last century, yet consensus remains elusive: the field is still divided, for instance, between those who hold that all such expressions are semantically descriptive and those who would analyse most as the natural language counterparts of logical individual constants. The aim of this thesis is to cast new light on such questions by approaching them from within the cognitive framework of Sperber and Wilson's Relevance Theory. Relevance Theory offers not just an articulated pragmatics but also a broad conception of the functioning of natural language which differs radically from that presupposed within (most of) the philosophy of language. The function of linguistic expressions, on this conception, is not to determine propositional content, but rather to provide inferential premises which, in parallel with context and general pragmatic principles, will enable a bearer to reach the speaker's intended interpretation. Working within this framework, I shall argue that the semantics of the expressions discussed should best be analysed not in terms of their relation to those objects which, on occasions of use, they may designate, but rather in terms of the indications they offer a hearer concerning the mental representation which constitutes the content of a speaker's informative intention. Such an analysis can, I shall claim, capture certain key data on reference which have proved notoriously problematic, while respecting a broad range of apparently conflicting intuitions.


title: Modeling Multibody Dynamic Systems With Uncertainties . Part II : Numerical Applications

text: This study applies generalized polynomial chaos theory to model complex nonlinear multibody dynamic systems operating in the presence of parametric and external uncertainty. Theoretical and computational aspects of this methodology are discussed in the companion paper “Modeling Multibody Dynamic Systems With Uncertainties. Part I: Theoretical and Computational Aspects”. In this paper we illustrate the methodology on selected test cases. The combined effects of parametric and forcing uncertainties are studied for a quarter car model. The uncertainty distributions in the system response in both time and frequency domains are validated against Monte-Carlo simulations. Results indicate that polynomial chaos is more efficient than Monte Carlo and more accurate than statistical linearization. The results of the direct collocation approach are similar to the ones obtained with the Galerkin approach. A stochastic terrain model is constructed using a truncated Karhunen-Loeve expansion. The application of polynomial chaos to differential-algebraic systems is illustrated using the constrained pendulum problem. Limitations of the polynomial chaos approach are studied on two different test problems, one with multiple attractor points, and the second with a chaotic evolution and a nonlinear attractor set. The overall conclusion is that, despite its limitations, generalized polynomial chaos is a powerful approach for the simulation of multibody dynamic systems with uncertainties.


title: Normative data for the Rey-Osterrieth and the Taylor complex figure tests in Quebec-French people.

text: The Rey-Osterrieth (ROCF) and Taylor (TCF) complex figure tests are widely used to assess visuospatial and constructional abilities as well as visual/non-verbal memory. Normative data adjusted to the cultural and linguistic reality of older Quebec-French individuals is still nonexistent for these tests. In this article, we report the results of two studies that aimed to establish normative data for Quebec-French people (aged at least 50 years) for the copy, immediate recall, and delayed recall trials of the ROCF (Study 1) and the TCF (Study 2). For both studies, the impact of age, education, and sex on test performance was examined. Moreover, the impact of copy time on test performance, the impact of copy score on immediate and delayed recall score, and the impact of immediate recall score on delayed recall performance were examined. Based on regression models, equations to calculate Z scores for copy and recall scores are provided for both tests.


title: LIBSVX: A Supervoxel Library and Benchmark for Early Video Processing

text: Supervoxel segmentation has strong potential to be incorporated into early video analysis as superpixel segmentation has in image analysis. However, there are many plausible supervoxel methods and little understanding as to when and where each is most appropriate. Indeed, we are not aware of a single comparative study on supervoxel segmentation. To that end, we study seven supervoxel algorithms, including both off-line and streaming methods, in the context of what we consider to be a good supervoxel: namely, spatiotemporal uniformity, object/region boundary detection, region compression and parsimony. For the evaluation we propose a comprehensive suite of seven quality metrics to measure these desirable supervoxel characteristics. In addition, we evaluate the methods in a supervoxel classification task as a proxy for subsequent high-level uses of the supervoxels in video analysis. We use six existing benchmark video datasets with a variety of content-types and dense human annotations. Our findings have led us to conclusive evidence that the hierarchical graph-based (GBH), segmentation by weighted aggregation (SWA) and temporal superpixels (TSP) methods are the top-performers among the seven methods. They all perform well in terms of segmentation accuracy, but vary in regard to the other desiderata: GBH captures object boundaries best; SWA has the best potential for region compression; and TSP achieves the best undersegmentation error.


title: A tutorial on simulation modeling in six dimensions

text: Simulation involves modeling and analysis of real-world systems. This tutorial will provide a broad overview of the modeling practice within simulation by introducing the reader to modeling choices found using six dimensions: abstraction, complexity, culture, engineering, environment, and process. Modeling can be a daunting task even for the seasoned modeling and simulation professional, and so my goal is to introduce modeling in two ways: 1) to use one specific type of model (Petri Net) as an anchor for cross-dimensional discussion, and 2) to provide a follow up discussion, with additional non Petri Net examples, to clarify the extent of each dimension. For example, in the abstraction dimension, one must think about scale, refinement, and hierarchy when modeling regardless of the type of modeling language. The reader will come away with a broad framework within which to understand the possibilities of models and of modeling within the practice of simulation.


title: A Case Study of the New York City 2012-2013 Influenza Season With Daily Geocoded Twitter Data From Temporal and Spatiotemporal Perspectives

text:
BACKGROUND
Twitter has shown some usefulness in predicting influenza cases on a weekly basis in multiple countries and on different geographic scales. Recently, Broniatowski and colleagues suggested Twitter's relevance at the city-level for New York City. Here, we look to dive deeper into the case of New York City by analyzing daily Twitter data from temporal and spatiotemporal perspectives. Also, through manual coding of all tweets, we look to gain qualitative insights that can help direct future automated searches.

OBJECTIVE
The intent of the study was first to validate the temporal predictive strength of daily Twitter data for influenza-like illness emergency department (ILI-ED) visits during the New York City 2012-2013 influenza season against other available and established datasets (Google search query, or GSQ), and second, to examine the spatial distribution and the spread of geocoded tweets as proxies for potential cases.

METHODS
From the Twitter Streaming API, 2972 tweets were collected in the New York City region matching the keywords "flu", "influenza", "gripe", and "high fever". The tweets were categorized according to the scheme developed by Lamb et al. A new fourth category was added as an evaluator guess for the probability of the subject(s) being sick to account for strength of confidence in the validity of the statement. Temporal correlations were made for tweets against daily ILI-ED visits and daily GSQ volume. The best models were used for linear regression for forecasting ILI visits. A weighted, retrospective Poisson model with SaTScan software (n=1484), and vector map were used for spatiotemporal analysis.

RESULTS
Infection-related tweets (R=.763) correlated better than GSQ time series (R=.683) for the same keywords and had a lower mean average percent error (8.4 vs 11.8) for ILI-ED visit prediction in January, the most volatile month of flu. SaTScan identified primary outbreak cluster of high-probability infection tweets with a 2.74 relative risk ratio compared to medium-probability infection tweets at P=.001 in Northern Brooklyn, in a radius that includes Barclay's Center and the Atlantic Avenue Terminal.

CONCLUSIONS
While others have looked at weekly regional tweets, this study is the first to stress test Twitter for daily city-level data for New York City. Extraction of personal testimonies of infection-related tweets suggests Twitter's strength both qualitatively and quantitatively for ILI-ED prediction compared to alternative daily datasets mixed with awareness-based data such as GSQ. Additionally, granular Twitter data provide important spatiotemporal insights. A tweet vector-map may be useful for visualization of city-level spread when local gold standard data are otherwise unavailable.


title: CatBoost: unbiased boosting with categorical features

text: This paper presents the key algorithmic techniques behind CatBoost, a new gradient boosting toolkit. Their combination leads to CatBoost outperforming other publicly available boosting implementations in terms of quality on a variety of datasets. Two critical algorithmic advances introduced in CatBoost are the implementation of ordered boosting, a permutation-driven alternative to the classic algorithm, and an innovative algorithm for processing categorical features. Both techniques were created to fight a prediction shift caused by a special kind of target leakage present in all currently existing implementations of gradient boosting algorithms. In this paper, we provide a detailed analysis of this problem and demonstrate that proposed algorithms solve it effectively, leading to excellent empirical results.


title: Strabismus Recognition Using Eye-Tracking Data and Convolutional Neural Networks

text: Strabismus is one of the most common vision diseases that would cause amblyopia and even permanent vision loss. Timely diagnosis is crucial for well treating strabismus. In contrast to manual diagnosis, automatic recognition can significantly reduce labor cost and increase diagnosis efficiency. In this paper, we propose to recognize strabismus using eye-tracking data and convolutional neural networks. In particular, an eye tracker is first exploited to record a subject's eye movements. A gaze deviation (GaDe) image is then proposed to characterize the subject's eye-tracking data according to the accuracies of gaze points. The GaDe image is fed to a convolutional neural network (CNN) that has been trained on a large image database called ImageNet. The outputs of the full connection layers of the CNN are used as the GaDe image's features for strabismus recognition. A dataset containing eye-tracking data of both strabismic subjects and normal subjects is established for experiments. Experimental results demonstrate that the natural image features can be well transferred to represent eye-tracking data, and strabismus can be effectively recognized by our proposed method.


title: Assessing forecast model performance in an ERP environment

text: Purpose – The paper aims to describe and apply a commercially oriented method of forecast performance measurement (cost of forecast error – CFE) and to compare the results with commonly adopted statistical measures of forecast accuracy in an enterprise resource planning (ERP) environment. Design/methodology/approach – The study adopts a quantitative methodology to evaluate the nine forecasting models (two moving average and seven exponential smoothing) of SAP’s ERP system. Event management adjustment and fitted smoothing parameters are also assessed. SAP is the largest European software enterprise and the third largest in the world, with headquarters in Walldorf, Germany. Findings – The findings of the study support the adoption of CFE as a more relevant commercial decision-making measure than commonly applied statistical forecast measures. Practical implications – The findings of the study provide forecast model selection guidance to SAP’s 12 þ million worldwide users. However, the CFE metric can be adopted in any commercial forecasting situation. Originality/value – This study is the first published cost assessment of SAP’s forecasting models.


title: Robust Image Sentiment Analysis Using Progressively Trained and Domain Transferred Deep Networks

text: Sentiment analysis of online user generated content is important for many social media analytics tasks. Researchers have largely relied on textual sentiment analysis to develop systems to predict political elections, measure economic indicators, and so on. Recently, social media users are increasingly using images and videos to express their opinions and share their experiences. Sentiment analysis of such large scale visual content can help better extract user sentiments toward events or topics, such as those in image tweets, so that prediction of sentiment from visual content is complementary to textual sentiment analysis. Motivated by the needs in leveraging large scale yet noisy training data to solve the extremely challenging problem of image sentiment analysis, we employ Convolutional Neural Networks (CNN). We first design a suitable CNN architecture for image sentiment analysis. We obtain half a million training samples by using a baseline sentiment algorithm to label Flickr images. To make use of such noisy machine labeled data, we employ a progressive strategy to fine-tune the deep network. Furthermore, we improve the performance on Twitter images by inducing domain transfer with a small number of manually labeled Twitter images. We have conducted extensive experiments on manually labeled Twitter images. The results show that the proposed CNN can achieve better performance in image sentiment analysis than competing algorithms.


title: Universals and cultural differences in the judgments of facial expressions of emotion.

text: We present here new evidence of cross-cultural agreement in the judgement of facial expression. Subjects in 10 cultures performed a more complex judgment task than has been used in previous cross-cultural studies. Instead of limiting the subjects to selecting only one emotion term for each expression, this task allowed them to indicate that multiple emotions were evident and the intensity of each emotion. Agreement was very high across cultures about which emotion was the most intense. The 10 cultures also agreed about the second most intense emotion signaled by an expression and about the relative intensity among expressions of the same emotion. However, cultural differences were found in judgments of the absolute level of emotional intensity.


title: The Influence of Background Music on the Behavior of Restaurant Patrons Author ( s ) :

text: JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org. .


title: Music Emotion Identification from Lyrics

text: Very large online music databases have recently been created by vendors, but they generally lack content-based retrieval methods. One exception is Allmusic.com which offers browsing by musical emotion, using human experts to classify several thousand songs into 183 moods. In this paper, machine learning techniques are used instead of human experts to extract emotions in Music. The classification is based on a psychological model of emotion that is extended to 23 specific emotion categories. Our results for mining the lyrical text of songs for specific emotion are promising, generate classification models that are human-comprehensible, and generate results that correspond to commonsense intuitions about specific emotions. Mining lyrics focused in this paper is one aspect of research which combines different classifiers of musical emotion such as acoustics and lyrical text.


title: Fusing audio, visual and textual clues for sentiment analysis from multimodal content

text: A huge number of videos are posted every day on social media platforms such as Facebook and YouTube. This makes the Internet an unlimited source of information. In the coming decades, coping with such information and mining useful knowledge from it will be an increasingly difficult task. In this paper, we propose a novel methodology for multimodal sentiment analysis, which consists in harvesting sentiments from Web videos by demonstrating a model that uses audio, visual and textual modalities as sources of information. We used both featureand decision-level fusion methods to merge affective information extracted from multiple modalities. A thorough comparison with existing works in this area is carried out throughout the paper, which demonstrates the novelty of our approach. Preliminary comparative experiments with the YouTube dataset show that the proposed multimodal system achieves an accuracy of nearly 80%, outperforming all state-of-the-art systems by more than 20%. & 2015 Elsevier B.V. All rights reserved.


title: The DEXMART hand: Mechatronic design and experimental evaluation of synergy-based control for human-like grasping

text: This paper summarizes recent activities carried out for the development of an innovative anthropomorphic robotic hand called the DEXMART Hand. The main goal of this research is to face the problems that affect current robotic hands by introducing suitable design solutions aimed at achieving simplification and cost reduction while possibly enhancing robustness and performance. While certain aspects of the DEXMART Hand development have been presented in previous papers, this paper is the first to give a comprehensive description of the final hand version and its use to replicate humanlike grasping. In this paper, particular emphasis is placed on the kinematics of the fingers and of the thumb, the wrist architecture, the dimensioning of the actuation system, and the final implementation of the position, force and tactile sensors. The paper focuses also on how these solutions have been integrated into the mechanical structure of this innovative robotic hand to enable precise force and displacement control of the whole system. Another important aspect is the lack of suitable control tools that severely limits the development of robotic hand applications. To address this issue, a new method for the observation of human hand behavior during interaction with common day-to-day objects by means of a 3D computer vision system is presented in this work together with a strategy for mapping human hand postures to the robotic hand. A simple control strategy based on postural synergies has been used to reduce the complexity of the grasp planning problem. As a preliminary evaluation of the DEXMART Hand’s capabilities, this approach has been adopted in this paper to simplify and speed up the transfer of human actions to the robotic hand, showing its effectiveness in reproducing human-like grasping.


title: Coping with autism: a journey toward adaptation.

text: As the number of individuals with autism grows, it is critical for nurses in all settings to understand how autism influences the family unit, as they will likely interact with these children, the adults, and their families. The intent of this descriptive narrative study was to explore the experiences of families of individuals with autism as perceived by the mother. Through personal interviews, 16 mothers' perceptions of the impact of autism on the family unit during different stages of the life cycle were revealed through a constructivist lens. Pediatric nurses employed in acute care settings, community, and schools are poised to assess and support these families following diagnosis and throughout the child's life.


title: ATR-Vis: Visual and Interactive Information Retrieval for Parliamentary Discussions in Twitter

text: The worldwide adoption of Twitter turned it into one of the most popular platforms for content analysis as it serves as a gauge of the public’s feeling and opinion on a variety of topics. This is particularly true of political discussions and lawmakers’ actions and initiatives. Yet, one common but unrealistic assumption is that the data of interest for analysis is readily available in a comprehensive and accurate form. Data need to be retrieved, but due to the brevity and noisy nature of Twitter content, it is difficult to formulate user queries that match relevant posts that use different terminology without introducing a considerable volume of unwanted content. This problem is aggravated when the analysis must contemplate multiple and related topics of interest, for which comments are being concurrently posted. This article presents Active Tweet Retrieval Visualization (ATR-Vis), a user-driven visual approach for the retrieval of Twitter content applicable to this scenario. The method proposes a set of active retrieval strategies to involve an analyst in such a way that a major improvement in retrieval coverage and precision is attained with minimal user effort. ATR-Vis enables non-technical users to benefit from the aforementioned active learning strategies by providing visual aids to facilitate the requested supervision. This supports the exploration of the space of potentially relevant tweets, and affords a better understanding of the retrieval results. We evaluate our approach in scenarios in which the task is to retrieve tweets related to multiple parliamentary debates within a specific time span. We collected two Twitter datasets, one associated with debates in the Canadian House of Commons during a particular week in May 2014, and another associated with debates in the Brazilian Federal Senate during a selected week in May 2015. The two use cases illustrate the effectiveness of ATR-Vis for the retrieval of relevant tweets, while quantitative results show that our approach achieves high retrieval quality with a modest amount of supervision. Finally, we evaluated our tool with three external users who perform searching in social media as part of their professional work.


title: Multilevel thresholding for satellite image segmentation with moth-flame based optimization

text: In this paper, an improved version of the moth-flame optimization (MFO) algorithm for image segmentation is proposed to effectively enhance the optimal multilevel thresholding of satellite images. Multilevel thresholding is one of the most widely used methods for image segmentation, as it has efficient processing ability and easy implementation. However, as the number of threshold values increase, it consequently becomes computationally expensive. To overcome this problem, the nature-inspired meta-heuristic named multilevel thresholding moth-flame optimization algorithm (MTMFO) for multilevel thresholding was developed. The improved method proposed herein was tested on various satellite images tested against five different existing methods: the genetic algorithm (GA), the differential evolution (DE) algorithm, the artificial bee colony (ABC) algorithm, the particle swarm optimization (PSO) algorithm, and the moth-flame optimization (MFO) algorithm for solving multilevel satellite image thresholding problems. Experimental results indicate that the MTMFO more effectively and accurately identifies the optimal threshold values with respect to the other state-of-the-art optimization algorithms.


title: Introduction of optical camera communication for Internet of vehicles (IoV)

text: In this paper, we have introduced optical camera communication (OCC) as a new technology for internet of vehicles (IoV). OCC has already been established in many areas which can also be used in vehicular communication. There have some researches in the field of OCC-based vehicular communication but these are not mature enough. Here, we have proposed a new system which will provide great advantages to the vehicular system. We proposed a combination of OCC and cloud-based communication for IoV which will ensure secure, stable, and system. We have also proposed an algorithm to provide cloud based IoV service.


title: Topic hierarchy construction for the organization of multi-source user generated contents

text: User generated contents (UGCs) carry a huge amount of high quality information. However, the information overload and diversity of UGC sources limit their potential uses. In this research, we propose a framework to organize information from multiple UGC sources by a topic hierarchy which is automatically generated and updated using the UGCs. We explore the unique characteristics of UGCs like blogs, cQAs, microblogs, etc., and introduce a novel scheme to combine them. We also propose a graph-based method to enable incremental update of the generated topic hierarchy. Using the hierarchy, users can easily obtain a comprehensive, in-depth and up-to-date picture of their topics of interests. The experiment results demonstrate how information from multiple heterogeneous sources improves the resultant topic hierarchies. It also shows that the proposed method achieves better F1 scores in hierarchy generation as compared to the state-of-the-art methods.


title: Effectiveness of a multi-layer foam dressing in preventing sacral pressure ulcers for the early acute care of patients with a traumatic spinal cord injury: comparison with the use of a gel mattress.

text: Individuals with spinal cord injury are at risk of sacral pressure ulcers due to, among other reasons, prolonged immobilisation. The effectiveness of a multi-layer foam dressing installed pre-operatively in reducing sacral pressure ulcer occurrence in spinal cord injured patients was compared to that of using a gel mattress, and stratified analyses were performed on patients with complete tetraplegia and paraplegia. Socio-demographic and clinical data were collected from 315 patients admitted in a level-I trauma centre following a spinal cord injury between April 2010 and March 2016. Upon arrival to the emergency room and until surgery, patients were transferred on a foam stretcher pad with a viscoelastic polymer gel mattress (before 1 October 2014) or received a multi-layer foam dressing applied to their sacral-coccygeal area (after 1 October 2014). The occurrence of sacral pressure ulcer during acute hospitalisation was similar irrespective of whether patients received the dressing or the gel mattress. It was found that 82% of patients with complete tetraplegia receiving the preventive dressing developed sacral ulcers as compared to only 36% of patients using the gel mattress. Although multi-layer dressings were suggested to improve skin protection and decrease pressure ulcer occurrence in critically ill patients, such preventive dressings are not superior to gel mattresses in spinal cord injured patients and should be used with precaution, especially in complete tetraplegia.


title: Pix2Vox: Context-aware 3D Reconstruction from Single and Multi-view Images

text: Recovering the 3D representation of an object from single-view or multi-view RGB images by deep neural networks has attracted increasing attention in the past few years. Several mainstream works (e.g., 3D-R2N2) use recurrent neural networks (RNNs) to fuse multiple feature maps extracted from input images sequentially. However, when given the same set of input images with different orders, RNN-based approaches are unable to produce consistent reconstruction results. Moreover, due to long-term memory loss, RNNs cannot fully exploit input images to refine reconstruction results. To solve these problems, we propose a novel framework for single-view and multi-view 3D reconstruction, named Pix2Vox. By using a well-designed encoder-decoder, it generates a coarse 3D volume from each input image. Then, a context-aware fusion module is introduced to adaptively select high-quality reconstructions for each part (e.g., table legs) from different coarse 3D volumes to obtain a fused 3D volume. Finally, a refiner further refines the fused 3D volume to generate the final output. Experimental results on the ShapeNet and Pascal 3D+ benchmarks indicate that the proposed Pix2Vox outperforms state-of-the-arts by a large margin. Furthermore, the proposed method is 24 times faster than 3D-R2N2 in terms of backward inference time. The experiments on ShapeNet unseen 3D categories have shown the superior generalization abilities of our method.


title: Rapid growing fibroadenoma in an adolescent.

text:
INTRODUCTION
We report a case of rapidly growing fibroadenoma.

PATIENT
A 13-year-old girl consulted the outpatient clinic regarding a left breast mass. The mass was diagnosed as fibroadenoma by clinical examinations, and the patient was carefully monitored. The mass enlarged rapidly with each menses and showed a 50% increase in volume four months later. Lumpectomy was performed. The tumor was histologically diagnosed as fibroadenoma organized type and many glandular epithelial cells had positive immunohistochemical staining for anti-estrogen receptor antibody in the nuclei.

CONCLUSION
The estrogen sensitivity of the tumor could account for the rapid growth.


title: Understanding Online Consumer Stickiness in E-commerce Environment : A Relationship Formation Model

text: Consumers with online shopping experience often stick to some special websites. Does it mean that long-term relationships between consumers and the websites form? To solve the problem, this paper analyzed the belief and attitude factors influencing online consumer stickiness intention. Based on the relationships between belief-attitude-intention implied in TPB (Theory of Planned Behavior), according to Expectation-Confirmation theory and Commitment-trust theory, we developed a concept model on online consumer stickiness. Six research hypotheses derived from this model were empirically validated using a survey of online shoppers. SEM (Structure Equation Modeling) was as a data analysis method. The results suggest that online consumer stickiness intention is influenced by consumers’ commitment to the website (e-vendors) and their overall satisfaction to the transaction process, and commitment’s effect is stronger; in turn, both consumers’ commitment and overall satisfaction are influenced by consumers’ ongoing trust significantly; confirmation has a significant effect on overall satisfaction but has not the same effect on commitment. The findings show that the long-term relationships between consumers and special websites exactly exist during online repeat consumption.


title: GFlink: An In-Memory Computing Architecture on Heterogeneous CPU-GPU Clusters for Big Data

text: The increasing main memory capacity and the explosion of big data have fueled the development of in-memory big data management and processing. By offering an efficient in-memory parallel execution model which can eliminate disk I/O bottleneck, existing in-memory cluster computing platforms (e.g., Flink and Spark) have already been proven to be outstanding platforms for big data processing. However, these platforms are merely CPU-based systems. This paper proposes GFlink, an in-memory computing architecture on heterogeneous CPU-GPU clusters for big data. Our proposed architecture extends the original Flink from CPU clusters to heterogeneous CPU-GPU clusters, greatly improving the computational power of Flink. Furthermore, we have proposed a programming framework based on Flink's abstract model, i.e., DataSet (DST), hiding the programming complexity of GPUs behind the simple and familiar high-level interfaces. To achieve high performance and good load-balance, an efficient JVM-GPU communication strategy, a GPU cache scheme, and an adaptive locality-aware scheduling scheme for three-stage pipelining execution are proposed. Extensive experiment results indicate that the high computational power of GPUs can be efficiently utilized, and the implementation on GFlink outperforms that on the original CPU-based Flink.


title: A distributed algorithm for 2D shape duplication with smart pebble robots

text: We present our digital fabrication technique for manufacturing active objects in 2D from a collection of smart particles. Given a passive model of the object to be formed, we envision submerging this original in a vat of smart particles, executing the new shape duplication algorithm described in this paper, and then brushing aside any extra modules to reveal both the original object and an exact copy, side-by-side. Extensions to the duplication algorithm can be used to create a magnified version of the original or multiple copies of the model object. Our novel duplication algorithm uses a distributed approach to identify the geometric specification of the object being duplicated and then forms the duplicate from spare modules in the vicinity of the original. This paper details the duplication algorithm and the features that make it robust to (1) an imperfect packing of the modules around the original object; (2) missing communication links between neighboring modules; and (3) missing modules in the vicinity of the duplicate object(s). We show that the algorithm requires O(1) storage space per module and that the algorithm exchanges O(n) messages per module. Finally, we present experimental results from 60 hardware trials and 150 simulations. These experiments demonstrate the algorithm working correctly and reliably despite broken communication links and missing modules.


title: A Convolutional Learning System for Object Classification in 3-D Lidar Data

text: In this brief, a convolutional learning system for classification of segmented objects represented in 3-D as point clouds of laser reflections is proposed. Several novelties are discussed: (1) extension of the existing convolutional neural network (CNN) framework to direct processing of 3-D data in a multiview setting which may be helpful for rotation-invariant consideration, (2) improvement of CNN training effectiveness by employing a stochastic meta-descent (SMD) method, and (3) combination of unsupervised and supervised training for enhanced performance of CNN. CNN performance is illustrated on a two-class data set of objects in a segmented outdoor environment.


title: Satellite remote sensing of particulate matter and air quality assessment over global cities

text: Using 1 year of aerosol optical thickness (AOT) retrievals from the MODerate resolution Imaging Spectro-radiometer (MODIS) on board NASA’s Terra and Aqua satellite along with ground measurements of PM2.5 mass concentration, we assess particulate matter air quality over different locations across the global urban areas spread over 26 locations in Sydney, Delhi, Hong Kong, New York City and Switzerland. An empirical relationship between AOT and PM2.5 mass is obtained and results show that there is an excellent correlation between the bin-averaged daily mean satellite and groundbased values with a linear correlation coefficient of 0.96. Using meteorological and other ancillary datasets, we assess the effects of wind speed, cloud cover, and mixing height (MH) on particulate matter (PM) air quality and conclude that these data are necessary to further apply satellite data for air quality research. Our study clearly demonstrates that satellitederived AOT is a good surrogate for monitoring PM air quality over the earth. However, our analysis shows that the PM2.5–AOT relationship strongly depends on aerosol concentrations, ambient relative humidity (RH), fractional cloud cover and height of the mixing layer. Highest correlation between MODIS AOT and PM2.5 mass is found under clear sky conditions with less than 40–50% RH and when atmospheric MH ranges from 100 to 200m. Future remote sensing sensors such as Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) that have the capability to provide vertical distribution of aerosols will further enhance our ability to monitor and forecast air pollution. This study is among the first to examine the relationship between satellite and ground measurements over several global locations. r 2006 Elsevier Ltd. All rights reserved.


title: Characteristics and variability of structural networks derived from diffusion tensor imaging

text: Structural brain networks were constructed based on diffusion tensor imaging (DTI) data of 59 young healthy male adults. The networks had 68 nodes, derived from FreeSurfer parcellation of the cortical surface. By means of streamline tractography, the edge weight was defined as the number of streamlines between two nodes normalized by their mean volume. Specifically, two weighting schemes were adopted by considering various biases from fiber tracking. The weighting schemes were tested for possible bias toward the physical size of the nodes. A novel thresholding method was proposed using the variance of number of streamlines in fiber tracking. The backbone networks were extracted and various network analyses were applied to investigate the features of the binary and weighted backbone networks. For weighted networks, a high correlation was observed between nodal strength and betweenness centrality. Despite similar small-worldness features, binary networks and weighted networks are distinctive in many aspects, such as modularity and nodal betweenness centrality. Inter-subject variability was examined for the weighted networks, along with the test-retest reliability from two repeated scans on 44 of the 59 subjects. The inter-/intra-subject variability of weighted networks was discussed in three levels - edge weights, local metrics, and global metrics. The variance of edge weights can be very large. Although local metrics show less variability than the edge weights, they still have considerable amounts of variability. Weighting scheme one, which scales the number of streamlines by their lengths, demonstrates stable intra-class correlation coefficients against thresholding for global efficiency, clustering coefficient and diversity. The intra-class correlation analysis suggests the current approach of constructing weighted network has a reasonably high reproducibility for most global metrics.


title: Unsupervised Change Detection in Satellite Images Using Principal Component Analysis and $k$-Means Clustering

text: In this letter, we propose a novel technique for unsupervised change detection in multitemporal satellite images using principal component analysis (PCA) and k-means clustering. The difference image is partitioned into h times h nonoverlapping blocks. S, S les h2, orthonormal eigenvectors are extracted through PCA of h times h nonoverlapping block set to create an eigenvector space. Each pixel in the difference image is represented with an S-dimensional feature vector which is the projection of h times h difference image data onto the generated eigenvector space. The change detection is achieved by partitioning the feature vector space into two clusters using k-means clustering with k = 2 and then assigning each pixel to the one of the two clusters by using the minimum Euclidean distance between the pixel's feature vector and mean feature vector of clusters. Experimental results confirm the effectiveness of the proposed approach.


title: Sexuality of male-to-female transsexuals.

text: Blanchard's (J Nerv Ment Dis 177:616-623, 1989) theory of autogynephilia suggests that male-to-female transsexuals can be categorized into different types based on their sexuality. Little previous research has compared the sexuality of male-to-female transsexuals to biological females. The present study examined 15 aspects of sexuality among a non-clinical sample of 234 transsexuals and 127 biological females, using either an online or a paper questionnaire. The results showed that, overall, transsexuals tended to place more importance on partner's physical attractiveness and reported higher scores on Blanchard's Core Autogynephilia Scale than biological females. In addition, transsexuals classified as autogynephilic scored significantly higher on Attraction to Feminine Males, Core Autogynephilia, Autogynephilic Interpersonal Fantasy, Fetishism, Preference for Younger Partners, Interest in Uncommitted Sex, Importance of Partner Physical Attractiveness, and Attraction to Transgender Fiction than other transsexuals and biological females. In accordance with Blanchard's theory, autogynephilia measures were positively correlated to Sexual Attraction to Females among transsexuals. In contrast to Blanchard's theory, however, those transsexuals classified as autogynephilic scored higher on average on Sexual Attraction to Males than those classified as non-autogynephilic, and no transsexuals classified as autogynephilic reported asexuality.


title: A study of age and gender seen through mobile phone usage patterns in Mexico

text: Mobile phone usage provides a wealth of information, which can be used to better understand the demographic structure of a population. In this paper we focus on the population of Mexican mobile phone users. Our first contribution is an observational study of mobile phone usage according to gender and age groups. We were able to detect significant differences in phone usage among different subgroups of the population. Our second contribution is to provide a novel methodology to predict demographic features (namely age and gender) of unlabeled users by leveraging individual calling patterns, as well as the structure of the communication graph. We provide details of the methodology and show experimental results on a real world dataset that involves millions of users.


title: Bitcoin Market Return and Volatility Forecasting Using Transaction Network Flow Properties

text: Bit coin, as the foundation for a secure electronic payment system, has drawn broad interests from researchers in recent years. In this paper, we analyze a comprehensive Bit coin transaction dataset and investigate the interrelationship between the flow of Bit coin transactions and its price movement. Using network theory, we examine a few complexity measures of the Bit coin transaction flow networks, and we model the joint dynamic relationship between these complexity measures and Bit coin market variables such as return and volatility. We find that a particular complexity measure of the Bit coin transaction network flow is significantly correlated with the Bit coin market return and volatility. More specifically we document that the residual diversity or freedom of Bit coin network flow scaled by the total system throughput can significantly improve the predictability of Bit coin market return and volatility.


title: A performance prediction model for the CUDA GPGPU platform

text: The significant growth in computational power of modern Graphics Processing Units (GPUs) coupled with the advent of general purpose programming environments like NVIDIA's CUDA, has seen GPUs emerging as a very popular parallel computing platform. Till recently, there has not been a performance model for GPGPUs. The absence of such a model makes it difficult to definitively assess the suitability of the GPU for solving a particular problem and is a significant impediment to the mainstream adoption of GPUs as a massively parallel (super)computing platform. In this paper we present a performance prediction model for the CUDA GPGPU platform. This model encompasses the various facets of the GPU architecture like scheduling, memory hierarchy, and pipelining among others. We also perform experiments that demonstrate the effects of various memory access strategies. The proposed model can be used to analyze pseudo code for a CUDA kernel to obtain a performance estimate, in a way that is similar to performing asymptotic analysis. We illustrate the usage of our model and its accuracy with three case studies: matrix multiplication, list ranking, and histogram generation.


title: Unified motion control for dynamic quadrotor maneuvers demonstrated on slung load and rotor failure tasks

text: In recent years impressive results have been presented illustrating the potential of quadrotors to solve challenging tasks. Generally, the derivation of the controllers involve complex analytical manipulation of the dynamics and are very specific to the task at hand. In addition, most approaches construct a trajectory and then design a stabilizing controller in a separate step, whereas a fully optimal solution requires finding both simultaneously. In this paper, a generalized approach is presented using an iterative optimal control algorithm. A series of complex tasks are thus solved using the same algorithm without the need for manual manipulation of the system dynamics, heuristic simplifications, or manual trajectory generation. First, aggressive maneuvers are performed by requiring the quadrotor to pass with a slung load through a window not high enough for the load to pass while hanging straight down. Second, go-to-goal tasks with single and double rotor failure are demonstrated. The adaptability and applicability of this unified approach to such diverse tasks with a nonlinear, underactuated, constrained, and in the case of the slung load, hybrid quadrotor systems is thus shown.


title: Will 5G See its Blind Side? Evolving 5G for Universal Internet Access

text: Internet has shown itself to be a catalyst for economic growth and social equity but its potency is thwarted by the fact that the Internet is off limits for the vast majority of human beings. Mobile phones—the fastest growing technology in the world that now reaches around 80% of humanity—can enable universal Internet access if it can resolve coverage problems that have historically plagued previous cellular architectures (2G, 3G, and 4G). These conventional architectures have not been able to sustain universal service provisioning since these architectures depend on having enough users per cell for their economic viability and thus are not well suited to rural areas (which are by definition sparsely populated). The new generation of mobile cellular technology (5G), currently in a formative phase and expected to be finalized around 2020, is aimed at orders of magnitude performance enhancement. 5G offers a clean slate to network designers and can be molded into an architecture also amenable to universal Internet provisioning. Keeping in mind the great social benefits of democratizing Internet and connectivity, we believe that the time is ripe for emphasizing universal Internet provisioning as an important goal on the 5G research agenda. In this paper, we investigate the opportunities and challenges in utilizing 5G for global access to the Internet for all (GAIA). We have also identified the major technical issues involved in a 5G-based GAIA solution and have set up a future research agenda by defining open research problems.


title: Multi-hop Communication in the Uplink for LPWANs

text: Low-Power Wide Area Networks (LPWANs) have arisen as a promising communication technology for supporting Internet of Things (IoT) services due to their low power operation, wide coverage range, low cost and scalability. However, most LPWAN solutions like SIGFOXTMor LoRaWANTMrely on star topology networks, where stations (STAs) transmit directly to the gateway (GW), which often leads to rapid battery depletion in STAs located far from it. In this work, we analyze the impact on LPWANs energy consumption of multi-hop communication in the uplink, allowing STAs to transmit data packets in lower power levels and higher data rates to closer parent STAs, reducing their energy consumption consequently. To that aim, we introduce the DistanceRing Exponential Stations Generator (DRESG) framework, designed to evaluate the performance of the so-called optimal-hop routing model, which establishes optimal routing connections in terms of energy efficiency, aiming to balance the consumption among all the STAs in the network. Results show that enabling such multi-hop connections entails higher network lifetimes, reducing significantly the bottleneck consumption in LPWANs with up to thousands of STAs. These results lead to foresee multi-hop communication in the uplink as a promising routing alternative for extending the lifetime of LPWAN deployments.


title: Toward automated segmentation of the pathological lung in CT

text: Conventional methods of lung segmentation rely on a large gray value contrast between lung fields and surrounding tissues. These methods fail on scans with lungs that contain dense pathologies, and such scans occur frequently in clinical practice. We propose a segmentation-by-registration scheme in which a scan with normal lungs is elastically registered to a scan containing pathology. When the resulting transformation is applied to a mask of the normal lungs, a segmentation is found for the pathological lungs. As a mask of the normal lungs, a probabilistic segmentation built up out of the segmentations of 15 registered normal scans is used. To refine the segmentation, voxel classification is applied to a certain volume around the borders of the transformed probabilistic mask. Performance of this scheme is compared to that of three other algorithms: a conventional, a user-interactive and a voxel classification method. The algorithms are tested on 10 three-dimensional thin-slice computed tomography volumes containing high-density pathology. The resulting segmentations are evaluated by comparing them to manual segmentations in terms of volumetric overlap and border positioning measures. The conventional and user-interactive methods that start off with thresholding techniques fail to segment the pathologies and are outperformed by both voxel classification and the refined segmentation-by-registration. The refined registration scheme enjoys the additional benefit that it does not require pathological (hand-segmented) training data.


title: Animal monitoring with unmanned aerial vehicle-aided wireless sensor networks

text: In this paper, we focus on an application of wireless sensor networks (WSNs) with unmanned aerial vehicle (UAV). The aim of the application is to detect the locations of endangered species in large-scale wildlife areas or monitor movement of animals without any attachment devices. We first define the mathematical model of the animal monitoring problem in terms of the value of information (VoI) and rewards. We design a network model including clusters of sensor nodes and a single UAV that acts as a mobile sink and visits the clusters. We propose a path planning approach based on a Markov decision process (MDP) model that maximizes the VoI while reducing message delays. We used real-world movement dataset of zebras. Simulation results show that our approach outperforms greedy and random heuristics as well as the path planning based on the solution of the traveling salesman problem.


title: HERB: a home exploring robotic butler

text: We describe the architecture, algorithms, and experiments with HERB, an autonomous mobile manipulator that performs useful manipulation tasks in the home. We present new algorithms for searching for objects, learning to navigate in cluttered dynamic indoor scenes, recognizing and registering objects accurately in high clutter using vision, manipulating doors and other constrained objects using caging grasps, grasp planning and execution in clutter, and manipulation on pose and torque constraint manifolds. S.S. Srinivasa ( ) · D. Ferguson · C.J. Helfrich Intel Research Pittsburgh, 4720 Forbes Avenue, Suite 410, Pittsburgh, PA 15213, USA e-mail: siddhartha.srinivasa@intel.com C.J. Helfrich e-mail: casey.j.helfrich@intel.com D. Berenson · A. Collet · R. Diankov · G. Gallagher · G. Hollinger · J. Kuffner · M.V. Weghe The Robotics Institute, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA D. Berenson e-mail: dberenso@ri.cmu.edu A. Collet e-mail: acollet@ri.cmu.edu R. Diankov e-mail: rdiankov@ri.cmu.edu G. Gallagher e-mail: ggallagh@ri.cmu.edu G. Hollinger e-mail: gholling@ri.cmu.edu J. Kuffner e-mail: kuffner@ri.cmu.edu M.V. Weghe e-mail: vandeweg@ri.cmu.edu We also present numerous severe real-world test results from the integration of these algorithms into a single mobile manipulator.


title: Projected texture stereo

text: Passive stereo vision is widely used as a range sensing technology in robots, but suffers from dropouts: areas of low texture where stereo matching fails. By supplementing a stereo system with a strong texture projector, dropouts can be eliminated or reduced. This paper develops a practical stereo projector system, first by finding good patterns to project in the ideal case, then by analyzing the effects of system blur and phase noise on these patterns, and finally by designing a compact projector that is capable of good performance out to 3m in indoor scenes. The system has been implemented and has excellent depth precision and resolution, especially in the range out to 1.5m.


title: Real-time 3D object pose estimation and tracking for natural landmark based visual servo

text: A real-time solution for estimating and tracking the 3D pose of a rigid object is presented for image-based visual servo with natural landmarks. The many state-of-the-art technologies that are available for recognizing the 3D pose of an object in a natural setting are not suitable for real-time servo due to their time lags. This paper demonstrates that a real-time solution of 3D pose estimation become feasible by combining a fast tracker such as KLT [7] [8] with a method of determining the 3D coordinates of tracking points on an object at the time of SIFT based tracking point initiation, assuming that a 3D geometric model with SIFT description of an object is known a-priori. Keeping track of tracking points with KLT, removing the tracking point outliers automatically, and reinitiating the tracking points using SIFT once deteriorated, the 3D pose of an object can be estimated and tracked in real-time. This method can be applied to both mono and stereo camera based 3D pose estimation and tracking. The former guarantees higher frame rates with about 1 ms of local pose estimation, while the latter assures of more precise pose results but with about 16 ms of local pose estimation. The experimental investigations have shown the effectiveness of the proposed approach with real-time performance.


title: Object Recognition from Local Scale-Invariant Features

text: Proc. of the International Conference on Computer Vision, Corfu (Sept. 1999) An object recognition system has been developed that uses a new class of local image features. The features are invariant to image scaling, translation, and rotation, and partially invariant to illumination changes and affine or 3D projection. These features share similar properties with neurons in inferior temporal cortex that are used for object recognition in primate vision. Features are efficiently detected through a staged filtering approach that identifies stable points in scale space. Image keys are created that allow for local geometric deformations by representing blurred image gradients in multiple orientation planes and at multiple scales. The keys are used as input to a nearest-neighbor indexing method that identifies candidate object matches. Final verification of each match is achieved by finding a low-residual least-squares solution for the unknown model parameters. Experimental results show that robust object recognition can be achieved in cluttered partially-occluded images with a computation time of under 2 seconds.


title: Algorithmic Complexity in Coding Theory and the Minimum Distance Problem

text: We startwithan overviewof algorithmiccomplexity problemsin coding theory We then show that the problemof computing the minimumdiktanceof a binaryIinwr code is NP-hard,and the correspondingdeci~”onproblemis W-complete. Thisconstitutes a proof of the conjecture Bedekamp, McEliece,vanTilborg, dating back to 1978. Extensionsand applicationsof this result to other problemsin codingtheqv are discussed.


title: Nonparametric belief propagation

text: Continuous quantities are ubiquitous in models of real-world phenomena, but are surprisingly difficult to reason about automatically. Probabilistic graphical models such as Bayesian networks and Markov random fields, and algorithms for approximate inference such as belief propagation (BP), have proven to be powerful tools in a wide range of applications in statistics and artificial intelligence. However, applying these methods to models with continuous variables remains a challenging task. In this work we describe an extension of BP to continuous variable models, generalizing particle filtering, and Gaussian mixture filtering techniques for time series to more complex models. We illustrate the power of the resulting nonparametric BP algorithm via two applications: kinematic tracking of visual motion and distributed localization in sensor networks.


title: Feature-Enhanced Probabilistic Models for Diffusion Network Inference

text: Cascading processes, such as disease contagion, viral marketing, and information diffusion, are a pervasive phenomenon in many types of networks. The problem of devising intervention strategies to facilitate or inhibit such processes has recently received considerable attention. However, a major challenge is that the underlying network is often unknown. In this paper, we revisit the problem of inferring latent network structure given observations from a diffusion process, such as the spread of trending topics in social media. We define a family of novel probabilistic models that can explain recurrent cascading behavior, and take into account not only the time differences between events but also a richer set of additional features. We show that MAP inference is tractable and can therefore scale to very large real-world networks. Further, we demonstrate the effectiveness of our approach by inferring the underlying network structure of a subset of the popular Twitter following network by analyzing the topics of a large number of messages posted by users over a 10-month period. Experimental results show that our models accurately recover the links of the Twitter network, and significantly improve the performance over previous models based entirely on time.


title: Map-reduce based parallel support vector machine for risk analysis

text: Now a days people are enjoying the world of data because size and amount of the data has tremendously increased which acts like an invitation to Big data. But some of the classifier techniques like Support Vector Machine (SVM) is not able to handle the huge amount of data due to it's excessive memory requirement and unreasonable complexity in algorithm tough it is one of the most popularly used classifier in machine learning field. Hence a new technique comes into picture which performs parallel algorithm in a efficient way to work data having large scale called as PSVM. In this paper we are going to discuss a PSVM model for risk analysis which is based on map-reduce, and can easily handle a huge amount of data in a distributed manner.


title: Classificationof Mammographic BreastDensityUsinga CombinedClassifierParadigm Keir Bovis andSameerSingh

text: In thispaperweinvestigateanew approach to theclassificationof mammographic imagesaccording to breasttype. The classificationof breastdensityin this studyis motivatedby its useasprior knowledge in theimageprocessingpipeline.By utilising thisknowledgeat differentstagesincludingenhanceme nt, segmentation and featureextraction, its applicationaims to increasethe sensiti vity of detectingbreastcancer . Our implementeddiscriminationof breastdensityis basedon the underlyingtexture containedwithin the breast tissueapparent on a digital mammogramandrealisedby utilising four approachesto quantifyingthe texture. Following featureextraction,we adopta variationon bootstrapaggregation(’bagging’) to meetthe assumptionsof independencein datarepresentationof theinputdataset,necessaryfor classifiercombination. Multiple classifierscomprisingfeed-forward Artifi cial NeuralNetwork (ANN) aresubseque ntly trainedwith the differentperturbedinput dataspacesusing10-fold cross-validation. Thesetof classifieroutputs,expressedin a probabilistic framework, aresubsequently combinedusingsix differentclassifiercombinationrulesandtheresultscompared.In this studywe examinetwo differentclassificationtasks;a four-classclassificationproblem differentiatingbetweenfatty, partly fatty, denseandextremelydensebreasttypesanda two-classproblems, differentiatingbetweendenseandfatty breasttypes. The datasetusedin this study is the Digital Database of ScreeningMammograms(DDSM) containingMedio-LateralOblique(MLO) views for eachbreastfor 377 patients. For both tasksthe bestcombinationstrategy was found using the productrule giving an average recognition rateon testof 71.4%for thefour-classproblemand96.7%for thetwo-classproblem.


title: DTC-SVM Scheme for Induction Motors Fedwith a Three-level Inverter

text: Direct Torque Control is a control technique in AC drive systems to obtain high performance torque control. The conventional DTC drive contains a pair of hysteresis comparators. DTC drives utilizing hysteresis comparators suffer from high torque ripple and variable switching frequency. The most common solution to those problems is to use the space vector depends on the reference torque and flux. In this Paper The space vector modulation technique (SVPWM) is applied to 2 level inverter control in the proposed DTC-based induction motor drive system, thereby dramatically reducing the torque ripple. Then the controller based on space vector modulation is designed to be applied in the control of Induction Motor (IM) with a three-level Inverter. This type of Inverter has several advantages over the standard two-level VSI, such as a greater number of levels in the output voltage waveforms, Lower dV/dt, less harmonic distortion in voltage and current waveforms and lower switching frequencies. This paper proposes a general SVPWM algorithm for three-level based on standard two-level SVPWM. The proposed scheme is described clearly and simulation results are reported to demonstrate its effectiveness. The entire control scheme is implemented with Matlab/Simulink. Keywords—Direct torque control, space vector Pulsewidth modulation(SVPWM), neutral point clamped(NPC), two-level inverter.


title: Data Mining and Knowledge Discovery : Applications , Techniques , Challenges and Process Models in Healthcare

text: Many healthcare leaders find themselves overwhelmed with data, but lack the information they need to make right decisions. Knowledge Discovery in Databases (KDD) can help organizations turn their data into information. Organizations that take advantage of KDD techniques will find that they can lower the healthcare costs while improving healthcare quality by using fast and better clinical decision making. In this paper, a review study is done on existing data mining and knowledge discovery techniques, applications and process models that are applicable to healthcare environments. The challenges for applying data mining techniques in healthcare environment will also be discussed.


title: MPTLsim: a cycle-accurate, full-system simulator for x86-64 multicore architectures with coherent caches

text: The introduction of multicore microprocessors in the recent years has made it imperative to use cycleaccurate and full-system simulators in the architecture research community. We introduce MPTLsim - a multicore simulator for the X86 ISA that meets this need. MPTLsim is a uop-accurate, cycle-accurate, full-system simulator for multicore designs based on the X86-64 ISA. MPTLsim extends PTLsim, a publicly available single core simulator, with a host of additional features to support hyperthreading within a core and multiple cores, with detailed models for caches, on-chip interconnections and the memory data flow. MPTLsim incorporates detailed simulation models for cache controllers, interconnections and has built-in implementations of a number of cache coherency protocols.


title: Apache Spark: a unified engine for big data processing

text: This open source computing framework unifies streaming, batch, and interactive big data workloads to unlock new applications.


title: Bayesian Non-Exhaustive Classification A Case Study: Online Name Disambiguation using Temporal Record Streams

text: The name entity disambiguation task aims to partition the records of multiple real-life persons so that each partition contains records pertaining to a unique person. Most of the existing solutions for this task operate in a batch mode, where all records to be disambiguated are initially available to the algorithm. However, more realistic settings require that the name disambiguation task be performed in an online fashion, in addition to, being able to identify records of new ambiguous entities having no preexisting records. In this work, we propose a Bayesian non-exhaustive classification framework for solving online name disambiguation task. Our proposed method uses a Dirichlet process prior with a Normal x Normal x Inverse Wishart data model which enables identification of new ambiguous entities who have no records in the training data. For online classification, we use one sweep Gibbs sampler which is very efficient and effective. As a case study we consider bibliographic data in a temporal stream format and disambiguate authors by partitioning their papers into homogeneous groups. Our experimental results demonstrate that the proposed method is better than existing methods for performing online name disambiguation task.


title: Further improvement in reducing superficial contamination in NIRS using double short separation measurements

text: Near-Infrared Spectroscopy (NIRS) allows the recovery of the evoked hemodynamic response to brain activation. In adult human populations, the NIRS signal is strongly contaminated by systemic interference occurring in the superficial layers of the head. An approach to overcome this difficulty is to use additional NIRS measurements with short optode separations to measure the systemic hemodynamic fluctuations occurring in the superficial layers. These measurements can then be used as regressors in the post-experiment analysis to remove the systemic contamination and isolate the brain signal. In our previous work, we showed that the systemic interference measured in NIRS is heterogeneous across the surface of the scalp. As a consequence, the short separation measurement used in the regression procedure must be located close to the standard NIRS channel from which the evoked hemodynamic response of the brain is to be recovered. Here, we demonstrate that using two short separation measurements, one at the source optode and one at the detector optode, further increases the performance of the short separation regression method compared to using a single short separation measurement. While a single short separation channel produces an average reduction in noise of 33% for HbO, using a short separation channel at both source and detector reduces noise by 59% compared to the standard method using a general linear model (GLM) without short separation. For HbR, noise reduction of 3% is achieved using a single short separation and this number goes to 47% when two short separations are used. Our work emphasizes the importance of integrating short separation measurements both at the source and at the detector optode of the standard channels from which the hemodynamic response is to be recovered. While the implementation of short separation sources presents some difficulties experimentally, the improvement in noise reduction is significant enough to justify the practical challenges.


title: Magnetic integration of LCC compensated resonant converter for inductive power transfer applications

text: The aim of this paper is to present a novel magnetic integrated LCC series-parallel compensation topology for the design of both the primary and pickup pads in inductive power transfer (IPT) applications. A more compact structure can be realized by integrating the inductors of the compensation circuit into the coupled power-transmitting coils. The impact of the extra coupling between the compensated coils (inductors) and the power-transferring coils is modeled and analyzed. The basic characteristics of the proposed topology are studied based on the first harmonic approximation (FHA). High-order harmonics are taken into account to derive an analytical solution for the current at the switching instant, which is helpful for the design of soft-switching operation. An IPT system with up to 5.6kW output power for electric vehicles (EV) charger has been built to verify the validity of the proposed magnetic integrated compensation topology. A peak efficiency of 95.36% from DC power source to the battery load is achieved at rated operation condition.


title: Fine-to-Coarse Global Registration of RGB-D Scans

text: RGB-D scanning of indoor environments is important for many applications, including real estate, interior design, and virtual reality. However, it is still challenging to register RGB-D images from a hand-held camera over a long video sequence into a globally consistent 3D model. Current methods often can lose tracking or drift and thus fail to reconstruct salient structures in large environments (e.g., parallel walls in different rooms). To address this problem, we propose a fine-to-coarse global registration algorithm that leverages robust registrations at finer scales to seed detection and enforcement of new correspondence and structural constraints at coarser scales. To test global registration algorithms, we provide a benchmark with 10,401 manually-clicked point correspondences in 25 scenes from the SUN3D dataset. During experiments with this benchmark, we find that our fine-to-coarse algorithm registers long RGB-D sequences better than previous methods.


title: Automatically Quantifying Radiographic Knee Osteoarthritis Severity Final Report-CS 229-Machine Learning

text: In this paper, we implement machine learning algorithms to automatically quantify knee osteoarthritis severity from X-ray images according to the Kellgren & Lawrence (KL) grades. We implement and evaluate the performance of various machine learning models like transfer learning, support vector machines and fully connected neural networks based on their classification accuracy. We also implement the task of automatically extracting the knee-joint region from the X-ray images and quantifying their severity by training a faster region convolutional neural network (R-CNN).


title: Emotional Chatting Machine: Emotional Conversation Generation with Internal and External Memory

text: Perception and expression of emotion are key factors to the success of dialogue systems or conversational agents. However, this problem has not been studied in large-scale conversation generation so far. In this paper, we propose Emotional Chatting Machine (ECM) that can generate appropriate responses not only in content (relevant and grammatical) but also in emotion (emotionally consistent). To the best of our knowledge, this is the first work that addresses the emotion factor in large-scale conversation generation. ECM addresses the factor using three new mechanisms that respectively (1) models the high-level abstraction of emotion expressions by embedding emotion categories, (2) captures the change of implicit internal emotion states, and (3) uses explicit emotion expressions with an external emotion vocabulary. Experiments show that the proposed model can generate responses appropriate not only in content but also in emotion.


title: Information Retrieval with Verbose Queries

text: Recently, the focus of many novel search applications shifted from short keyword queries to verbose natural language queries. Examples include question answering systems and dialogue systems, voice search on mobile devices and entity search engines like Facebook's Graph Search or Google's Knowledge Graph. However the performance of textbook information retrieval techniques for such verbose queries is not as good as that for their shorter counterparts. Thus, effective handling of verbose queries has become a critical factor for adoption of information retrieval techniques in this new breed of search applications. Over the past decade, the information retrieval community has deeply explored the problem of transforming natural language verbose queries using operations like reduction, weighting, expansion, reformulation and segmentation into more effective structural representations. However, thus far, there was not a coherent and organized tutorial on this topic. In this tutorial, we aim to put together various research pieces of the puzzle, provide a comprehensive and structured overview of various proposed methods, and also list various application scenarios where effective verbose query processing can make a significant difference.


title: Biologically inspired protection of deep networks from adversarial attacks

text: Inspired by biophysical principles underlying nonlinear dendritic computation in neural circuits, we develop a scheme to train deep neural networks to make them robust to adversarial attacks. Our scheme generates highly nonlinear, saturated neural networks that achieve state of the art performance on gradient based adversarial examples on MNIST, despite never being exposed to adversarially chosen examples during training. Moreover, these networks exhibit unprecedented robustness to targeted, iterative schemes for generating adversarial examples, including second-order methods. We further identify principles governing how these networks achieve their robustness, drawing on methods from information geometry. We find these networks progressively create highly flat and compressed internal representations that are sensitive to very few input dimensions, while still solving the task. Moreover, they employ highly kurtotic weight distributions, also found in the brain, and we demonstrate how such kurtosis can protect even linear classifiers from adversarial attack.


title: A fully balanced pseudo-differential OTA with common-mode feedforward and inherent common-mode feedback detector

text: A pseudo-differential fully balanced fully symmetric CMOS operational transconductance amplifier (OTA) architecture with inherent common-mode detection is proposed. Through judicious arrangement, the common-mode feedback circuit can be economically implemented. The OTA achieves a third harmonic distortion of 43 dB for 900 mVpp at 30 MHz. The OTA, fabricated in 0.5m CMOS process, is used to design a 100-MHz fourth-order linear phase filter. The measured filter’s group delay ripple is 3% for frequencies up to 100 MHz, and the measured dynamic range is 45 dB for a total harmonic distortion of 46 dB. The filter consumes 42.9 mW per complex pole pair while operating from a 1.65-V power supply.