SoroushVahidi/scidocs huggingface dataset:
Convenient or Useful ? Consumer Adoption of Smartphones for Mobile Commerce
(2017)

Merchants have developed apps for the smartphone that assist consumers through the buying process, from when they gather information to when they decide to purchase. Sharing information, such as location, shopping preferences and financial data, can enhance consumers’ experience. However, they may be reluctant to disclose these details unless they perceive that the benefits gained are more than the risk of privacy loss. This privacy calculus is added to the unified theory of acceptance and use of technology (UTAUT2) in order to explain consumers’ willingness to exchange the disclosure of personal information for additional value. Sharing information makes mobile commerce more convenient by saving time and effort. Companies are able to send offers that are tailored to a specific customer. Payments are processed faster because the merchant already has the financial data on hand. UTAUT2 is further extended with the Theory of Convenience. Results from a survey of over 300 consumers show that perceived value and perceived convenience are influencing variables and that perceived value mediates the influence of perceived convenience on intention to use.
DeepLogo: Hitting Logo Recognition with the Deep Neural Network Hammer
(2015)

Recently, there has been a flurry of industrial activity around logo recognition, such as Ditto’s service for marketers to track their brands in user-generated images, and LogoGrab’s mobile app platform for logo recognition. However, relatively little academic or open-source logo recognition progress has been made in the last four years. Meanwhile, deep convolutional neural networks (DCNNs) have revolutionized a broad range of object recognition applications. In this work, we apply DCNNs to logo recognition. We propose several DCNN architectures, with which we surpass published state-of-art accuracy on a popular logo recognition dataset.
Hidden Markov Models for Speech Recognition
(1991)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
Procedural Generation of Roads
(2010)

In this paper, we propose an automatic method for generating roads based on a weighted anisotropic shortest path algorithm. Given an input scene, we automatically create a path connecting an initial and a final point. The trajectory of the road minimizes a cost function that takes into account the different parameters of the scene including the slope of the terrain, natural obstacles such as rivers, lakes, mountains and forests. The road is generated by excavating the terrain along the path and instantiating generic parameterized models.
Arc-Length Parameterized Spline Curves for Real-Time Simulation
(2003)

Parametric curves are frequently used in computer animation and virtual environments to control the movements of synthetic objects. In many of these applications it is essential to efficiently relate parameter values to the arc length of the curve. Current approaches to compute arc length or to construct an arc-length parameterized curve are impractical to use in real-time applications. This paper presents a simple and efficient technique to generate approximately arc-length parameterized spline curves that closely match spline curves typically used to model roads in high-fidelity driving simulators.
Congested traffic states in empirical observations and microscopic simulations
(2000)

We present data from several German freeways showing different kinds of congested traffic forming near road inhomogeneities, specifically lane closings, intersections, or uphill gradients. The states are localized or extended, homogeneous or oscillating. Combined states are observed as well, like the coexistence of moving localized clusters and clusters pinned at road inhomogeneities, or regions of oscillating congested traffic upstream of nearly homogeneous congested traffic. The experimental findings are consistent with a recently proposed theoretical phase diagram for traffic near on-ramps [D. Helbing, A. Hennecke, and M. Treiber, Phys. Rev. Lett. 82, 4360 (1999)]. We simulate these situations with a continuous microscopic single-lane model, the "intelligent driver model," using empirical boundary conditions. All observations, including the coexistence of states, are qualitatively reproduced by describing inhomogeneities with local variations of one model parameter. We show that the results of the microscopic model can be understood by formulating the theoretical phase diagram for bottlenecks in a more general way. In particular, a local drop of the road capacity induced by parameter variations has essentially the same effect as an on-ramp.
Computing the arc length of parametric curves
(1990)

Specifying constraints on motion is simpler if the curve is parameterized by arc length, but many parametric curves of practical interest cannot be parameterized by arc length. An approximate numerical reparameterization technique that improves on a previous algorithm by using a different numerical integration procedure that recursively subdivides the curve and creates a table of the subdivision points is presented. The use of the table greatly reduces the computation required for subsequent arc length calculations. After table construction, the algorithm takes nearly constant time for each arc length calculation. A linear increase in the number of control points can result in a more than linear increase in computation. Examples of this type of behavior are shown.<<ETX>>
Approximate Arc Length Parametrization
(1996)

Current approaches to compute the arc length of a parametric curve rely on table lookup schemes. We present an approximate closed-form solution to the problem of computing an arc length parametrization for any given parametric curve. Our solution outputs a one or two-span Bézier curve which relates the length of the curve to the parametric variable. The main advantage of our approach is that we obtain a simple continuous function relating the length of the curve and the parametric variable. This allows the length to be easily computed given the parametric values. Tests with our algorithm on several thousand curves show that the maximum error in our approximation is 8.7% and that the average of maximum errors is 1.9%. Our algorithm is fast enough to compute the closed-form solution in a fraction of a second. After that a user can interactively get an approximation of the arc length for an arbitrary parameter value.
Graph Database Applications and Concepts with Neo4j
(2013)

Graph databases (GDB) are now a viable alternative to Relational Database Systems (RDBMS). Chemistry, biology, semantic web, social networking and recommendation engines are all examples of applications that can be represented in a much more natural form. Comparisons will be drawn between relational database systems (Oracle, MySQL) and graph databases (Neo4J) focusing on aspects such as data structures, data model features and query facilities. Additionally, several of the inherent and contemporary limitations of current offerings comparing and contrasting graph vs. relational database implementations will be explored.
Fully Convolutional Networks for Semantic Segmentation
(2015)

Convolutional networks are powerful visual models that yield hierarchies of features. We show that convolutional networks by themselves, trained end-to-end, pixels-to-pixels, improve on the previous best result in semantic segmentation. Our key insight is to build “fully convolutional” networks that take input of arbitrary size and produce correspondingly-sized output with efficient inference and learning. We define and detail the space of fully convolutional networks, explain their application to spatially dense prediction tasks, and draw connections to prior models. We adapt contemporary classification networks (AlexNet, the VGG net, and GoogLeNet) into fully convolutional networks and transfer their learned representations by fine-tuning to the segmentation task. We then define a skip architecture that combines semantic information from a deep, coarse layer with appearance information from a shallow, fine layer to produce accurate and detailed segmentations. Our fully convolutional networks achieve improved segmentation of PASCAL VOC (30% relative improvement to 67.2% mean IU on 2012), NYUDv2, SIFT Flow, and PASCAL-Context, while inference takes one tenth of a second for a typical image.
Computational Decomposition of Style for Controllable and Enhanced Style Transfer
(2018)

Neural style transfer has been demonstrated to be powerful in creating artistic image with help of Convolutional Neural Networks (CNN). However, there is still lack of computational analysis of perceptual components of the artistic style. Different from some early attempts which studied the style by some pre-processing or post-processing techniques, we investigate the characteristics of the style systematically based on feature map produced by CNN. First, we computationally decompose the style into basic elements using not only spectrum based methods including Fast Fourier Transform (FFT), Discrete Cosine Transform (DCT) but also latent variable models such Principal Component Analysis (PCA), Independent Component Analysis (ICA). Then, the decomposition of style induces various ways of controlling the style elements which could be embedded as modules in state-of-the-art style transfer algorithms. Such decomposition of style brings several advantages. It enables the computational coding of different artistic styles by our style basis with similar styles clustering together, and thus it facilitates the mixing or intervention of styles based on the style basis from more than one styles so that compound style or new style could be generated to produce styled images. Experiments demonstrate the effectiveness of our method on not only painting style transfer but also sketch style transfer which indicates possible applications on picture-to-sketch problems.
A CMOS low-power low-offset and high-speed fully dynamic latched comparator
(2010)

This paper presents a novel dynamic latched comparator that demonstrates lower offset voltage and higher load drivability than the conventional dynamic latched comparators. With two additional inverters inserted between the input- and output-stage of the conventional double-tail dynamic comparator, the gain preceding the regenerative latch stage is improved. The complementary version of the regenerative latch stage, which provides larger output drive current than the conventional one at a limited area, is implemented. The proposed circuit is designed using 90nm CMOS technology and 1V power supply voltage, and it demonstrates up to 19% less offset voltage and 62% less sensitivity of the delay to the input voltage difference (17ps/decade) than the conventional double-tail latched comparator at approximately the same area and power consumption.
A DYNAMIC FUZZY-COGNITIVE-MAP APPROACH BASED ON RANDOM NEURAL NETWORKS
(2003)

A fuzzy cognitive map is a graphical means of representing arbitrarily complex models of interrelations between concepts. The purpose of this paper is to describe a dynamic fuzzy cognitive map based on the random neural network model. Previously, we have developed a random fuzzy cognitive map and illustrated its application in the modeling of processes. The adaptive fuzzy cognitive map changes its fuzzy causal web as causal patterns change and as experts update their causal knowledge. Our model carries out inferences via numerical calculation instead of symbolic deduction. We show how the dynamic random fuzzy cognitive map can reveal implications of models composed of dynamic processes. Copyright c ©2003 Yang’s Scientific Research Institute, LLC. All rights reserved.
Eclectic extraction of propositional rules from Neural Networks
(2011)

Artificial Neural Network is among the most popular algorithm for supervised learning. However, Neural Networks have a well-known drawback of being a “Black Box” learner that is not comprehensible to the Users. This lack of transparency makes it unsuitable for many high risk tasks such as medical diagnosis that requires a rational justification for making a decision. Rule Extraction methods attempt to curb this limitation by extracting comprehensible rules from a trained Network. Many such extraction algorithms have been developed over the years with their respective strengths and weaknesses. They have been broadly categorized into three types based on their approach to use internal model of the Network. Eclectic Methods are hybrid algorithms that combine the other approaches to attain more performance. In this paper, we present an Eclectic method called HERETIC. Our algorithm uses Inductive Decision Tree learning combined with information of the neural network structure for extracting logical rules. Experiments and theoretical analysis show HERETIC to be better in terms of speed and performance.
High Efficiency AC – AC Power Electronic Converter Applied To Domestic Induction Heating
(2014)

Induction heating is a well-known technique to produce very high temperature for applications. A large number of topologies have been developed in this area such as voltage and current source inverter. This project presents the analysis and design of a new ac–ac resonant converter applied to domestic induction heating. The proposed topology, based on the halfbridge series resonant inverter, uses only two diodes to rectify the mains voltage.The proposed converter can operate with zerovoltage switching during both switches-on and switch-off transitions. This topology doubles the output voltage, and therefore, the current in the load is reduced for the same output power. As a consequence, the converter efficiency is significantly improved.The output power is controlled using the PWM technique. This results in an increase of the net efficiency of the induction heating system. The circuit is simulated using MATLAB. The circuit is implemented using PIC controller. Both simulation and hardware results are compared.
Censoring Representations with an Adversary
(2016)

In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying information. We address these two related issues by learning flexible representations that minimize the capability of an adversarial critic. This adversary is trying to predict the relevant sensitive variable from the representation, and so minimizing the performance of the adversary ensures there is little or no information in the representation about the sensitive variable. We demonstrate this adversarial approach on two problems: making decisions free from discrimination and removing private information from images. We formulate the adversarial model as a minimax problem, and optimize that minimax objective using a stochastic gradient alternate min-max optimizer. We demonstrate the ability to provide discriminant free representations for standard test problems, and compare with previous state of the art methods for fairness, showing statistically significant improvement across most cases. The flexibility of this method is shown via a novel problem: removing annotations from images, from separate training examples of annotated and unannotated images, and with no a priori knowledge of the form of annotation provided to the model.
EHRs Connect Research and Practice: Where Predictive Modeling, Artificial Intelligence, and Clinical Decision Support Intersect
(2012)

Objectives: Electronic health records (EHRs) are only a first step in capturing and utilizing healthrelated data—the challenge is turning that data into useful information. Furthermore, EHRs are increasingly likely to include data relating to patient outcomes, functionality such as clinical decision support, and genetic information as well, and, as such, can be seen as repositories of increasingly valuable information about patients’ health conditions and responses to treatment over time. Methods: We describe a case study of 423 patients treated by Centerstone within Tennessee and Indiana in which we utilized electronic health record data to generate predictive algorithms of individual patient treatment response. Multiple models were constructed using predictor variables derived from clinical, financial and geographic data. Results: For the 423 patients, 101 deteriorated, 223 improved and in 99 there was no change in clinical condition. Based on modeling of various clinical indicators at baseline, the highest accuracy in predicting individual patient response ranged from 70% to 72% within the models tested. In terms of individual predictors, the Centerstone Assessment of Recovery Level—Adult (CARLA) baseline score was most significant in predicting outcome over time (odds ratio 4.1+2.27). Other variables with consistently significant impact on outcome included payer, diagnostic category, location and provision of case management services. Conclusions: This approach represents a promising avenue toward reducing the current gap between research and practice across healthcare, developing data-driven clinical decision support based on real-world populations, and serving as a component of embedded clinical artificial intelligences that ‘‘learn’’ over time. & 2012 Fellowship of Postgraduate Medicine. Published by Elsevier Ltd. All rights reserved. 2211-8837/$ see front matter & 2012 Fellowship of Postgraduate Medicine. Published by Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.hlpt.2012.03.001 Corresponding author at: Department of Informatics, Centerstone Research Institute, 365 South Park Ridge Road, Suite 103, Bloomington, IN 47401, United States. Tel.: +1 812 337 2302. E-mail addresses: Casey.Bennett@CenterstoneResearch.org (C.C. Bennett), Tom.Doub@CenterstoneResearch.org (T.W. Doub), RebeccaSelove@CenterstoneResearch.org (R. Selove). Health Policy and Technology (2012) 1, 105–114 Author's personal copy
Full-wave design of H-plane contiguous manifold output multiplexers using the fictitious reactive load concept
(2005)

In this paper, a new procedure for the design of contiguous band manifold output multiplexers in H-plane configuration is presented. Such a configuration eliminates the slots between the T-junctions and the filters allowing high power handling, as well as dramatically reducing the risk of multipactor. This paper pursues the division of the design into tasks with low computational effort. The approach comprises: 1) the singly terminated synthesis of the channel filters and their corresponding full-wave responses; 2) the manifold design using fictitious reactive loads simulating the phase response of every channel out of its corresponding band; and 3) the final full-wave optimization of the whole structure using the simulated-annealing method. In order to validate the above procedure, a five-channel Ku-band multiplexer has been designed, manufactured, and measured.
Highly Parallel Genome-wide Expression Profiling of Individual Cells Using Nanoliter Droplets
(2015)

Cells, the basic units of biological structure and function, vary broadly in type and state. Single-cell genomics can characterize cell identity and function, but limitations of ease and scale have prevented its broad application. Here we describe Drop-seq, a strategy for quickly profiling thousands of individual cells by separating them into nanoliter-sized aqueous droplets, associating a different barcode with each cell's RNAs, and sequencing them all together. Drop-seq analyzes mRNA transcripts from thousands of individual cells simultaneously while remembering transcripts' cell of origin. We analyzed transcriptomes from 44,808 mouse retinal cells and identified 39 transcriptionally distinct cell populations, creating a molecular atlas of gene expression for known retinal cell classes and novel candidate cell subtypes. Drop-seq will accelerate biological discovery by enabling routine transcriptional profiling at single-cell resolution. VIDEO ABSTRACT.
STRIP: A Defence Against Trojan Attacks on Deep Neural Networks
(2019)

Recent trojan attacks on deep neural network (DNN) models are one insidious variant of data poisoning attacks. Trojan attacks exploit an effective backdoor created in a DNN model by leveraging the difficulty in interpretability of the learned model to misclassify any inputs signed with the attacker’s chosen trojan trigger input. Trojan attacks are easy to craft; survive even in adverse conditions such as different viewpoints, and lighting conditions on images; and threaten real world applications such as autonomous vehicles and robotics. The trojan trigger is a secret guarded and exploited by the attacker. Therefore, detecting such trojaned inputs is a challenge, especially at run-time when models are in active operation. We focus on vision systems and build the STRong Intentional Perturbation (STRIP) based run-time trojan attack detection system. We intentionally perturb the incoming input, for instance by superimposing various image patterns, and observe the randomness of the predicted classes for the perturbed inputs for a given model—malicious or benign—under deployment. A low entropy in the predicted classes violates the input-dependence property of a benign model and implies the presence of a malicious input—a characteristic of a trojaned input. The high efficacy of our method is validated through case studies on two popular and contrasting datasets: MNIST and CIFAR10. We achieve an overall false acceptance rate (FAR) of less than 1%, given a preset false rejection rate (FRR) of 1%, for four different tested trojan trigger types—three triggers are identified in previous attack works and one dedicated trigger is crafted by us to demonstrate the trigger-size insensitivity of the STRIP detection approach. In particular, on the dataset of natural images in CIFAR10, we have empirically achieved the desired result of 0% for both FRR and FAR.