SoroushVahidi/scidocs huggingface dataset:
A similarity-based prognostics approach for Remaining Useful Life estimation of engineered systems
(2008)

This paper presents a similarity-based approach for estimating the Remaining Useful Life (RUL) in prognostics. The approach is especially suitable for situations in which abundant run-to-failure data for an engineered system are available. Data from multiple units of the same system are used to create a library of degradation patterns. When estimating the RUL of a test unit, the data from it will be matched to those patterns in the library and the actual life of those matched units will be used as the basis of estimation. This approach is used to tackle the data challenge problem defined by the 2008 PHM Data Challenge Competition, in which, run-to-failure data of an unspecified engineered system are provided and the RUL of a set of test units will be estimated. Results show that the similarity-based approach is very effective in performing RUL estimation.
YouTube-8M: A Large-Scale Video Classification Benchmark
(2016)

Many recent advancements in Computer Vision are attributed to large datasets. Open-source software packages for Machine Learning and inexpensive commodity hardware have reduced the barrier of entry for exploring novel approaches at scale. It is possible to train models over millions of examples within a few days. Although large-scale datasets exist for image understanding, such as ImageNet, there are no comparable size video classification datasets. In this paper, we introduce YouTube-8M, the largest multi-label video classification dataset, composed of∼8 million videos—500K hours of video—annotated with a vocabulary of 4800 visual entities. To get the videos and their (multiple) labels, we used a YouTube video annotation system, which labels videos with the main topics in them. While the labels are machine-generated, they have high-precision and are derived from a variety of human-based signals including metadata and query click signals, so they represent an excellent target for content-based annotation approaches. We filtered the video labels (Knowledge Graph entities) using both automated and manual curation strategies, including asking human raters if the labels are visually recognizable. Then, we decoded each video at one-frame-per-second, and used a Deep CNN pretrained on ImageNet to extract the hidden representation immediately prior to the classification layer. Finally, we compressed the frame features and make both the features and video-level labels available for download. The dataset contains frame-level features for over 1.9 billion video frames and 8 million videos, making it the largest public multi-label video dataset. We trained various (modest) classification models on the dataset, evaluated them using popular evaluation metrics, and report them as baselines. Despite the size of the dataset, some of our models train to convergence in less than a day on a single machine using the publicly-available TensorFlow framework. We plan to release code for training a basic TensorFlow model and for computing metrics. We show that pre-training on large data generalizes to other datasets like Sports-1M and ActivityNet. We achieve state-of-the-art on ActivityNet, improving mAP from 53.8% to 77.6%. We hope that the unprecedented scale and diversity of YouTube-8M will lead to advances in video understanding and representation learning.
Double-ridged horn antenna operating in 18–40 GHz range
(2018)

The whole design cycle, including design, fabrication and characterization of a broadband double-ridged horn antenna equipped with a parabolic lens and a waveguide adapter is presented in this paper. A major goal of the presented work was to obtain high directivity with a flat phase characteristic within the main radiation lobe at an 18–40 GHz frequency range, so that the antenna can be applicable in a freespace material characterization setup.
Population Cost Prediction on Public Healthcare Datasets
(2015)

The increasing availability of digital health records should ideally improve accountability in healthcare. In this context, the study of predictive modeling of healthcare costs forms a foundation for accountable care, at both population and individual patient-level care. In this research we use machine learning algorithms for accurate predictions of healthcare costs on publicly available claims and survey data. Specifically, we investigate the use of the regression trees, M5 model trees and random forest, to predict healthcare costs of individual patients given their prior medical (and cost) history.
 Overall, three observations showcase the utility of our research: (a) prior healthcare cost alone can be a good indicator for future healthcare cost, (b) M5 model tree technique led to very accurate future healthcare cost prediction, and (c) although state-of-the-art machine learning algorithms are also limited by skewed cost distributions in healthcare, for a large fraction (75%) of population, we were able to predict with higher accuracy using these algorithms. In particular, using M5 model trees we were able to accurately predict costs within less than $125 for 75% of the population when compared to prior techniques. Since models for predicting healthcare costs are often used to ascertain overall population health, our work is useful to evaluate future costs for large segments of disease populations with reasonably low error as demonstrated in our results on real-world publicly available datasets.
Characterization of RF Noise in UTBB FD-SOI MOSFET
(2016)

In this paper, we report the noise measurements in the RF frequency range for ultrathin body and thin buried oxide fully depleted silicon on insulator (FD-SOI) transistors. We analyze the impact of back and front gate biases on the various noise parameters; along with discussions on the secondary effects in FD-SOI transistors which contribute to the thermal noise. Using calibrated TCAD simulations, we show that the noise figure changes with the substrate doping and buried oxide thickness.
Duplicate Record Detection: A Survey
(2007)

Often, in the real world, entities have two or more representations in databases. Duplicate records do not share a common key and/or they contain errors that make duplicate matching a difficult task. Errors are introduced as the result of transcription errors, incomplete information, lack of standard formats, or any combination of these factors. In this paper, we present a thorough analysis of the literature on duplicate record detection. We cover similarity metrics that are commonly used to detect similar field entries, and we present an extensive set of duplicate detection algorithms that can detect approximately duplicate records in a database. We also cover multiple techniques for improving the efficiency and scalability of approximate duplicate detection algorithms. We conclude with coverage of existing tools and with a brief discussion of the big open problems in the area
Enhancing bank security system using Face Recognition, Iris Scanner and Palm Vein Technology
(2018)

The objective of this paper is to design a bank locker security system which is using Face Recognition, Iris Scanner and Palm Vein Technology (PVR) for securing valuable belongings. A face recognition system is a system which identifies and authenticates the image of the authorized user by using MATLAB software. The images of a person entering a unrestricted zone are taken by the camera and software compares the image with an existing database of valid users. Iris Recognition system uses generous characteristics present in human body. This technology is employed for biometric authentication in ATM’s, Immigration & border control, public safety, hospitality and tourism etc. This paper serves techniques so that capability of palm vein recognition system can be improved using modified vascular pattern thinning algorithm. Palm Vein Recognition (PVR) is a technology which recognizes palm vein pattern of an individual and matches it with the data stored in database for authentication. This is a very reliable technique and has a very good accuracy and is considered as the most secure and better technique for security purposes.
Handover decision using fuzzy MADM in heterogeneous networks
(2004)

In the next generation heterogeneous wireless networks, a user with a multi-interface terminal may have a network access from different service providers using various technologies. It is believed that handover decision is based on multiple criteria as well as user preference. Various approaches have been proposed to solve the handover decision problem, but the choice of decision method appears to be arbitrary and some of the methods even give disputable results. In this paper, a new handover criteria is introduced along with a new handover decision strategy. In addition, handover decision is identified us a fuzzy multiple attribute decision making (MADM) problem, and fuzzy logic is applied to deal with the imprecise information of some criteria and user preference. After a systematic analysis of various fuzzy MADM methods, a feasible approach is presented. In the end, examples are provided illustrating the proposed methods and the sensitivity of the methods is also analysed.
A Hybrid Feature Selection Algorithm For Classification Unbalanced Data Processsing
(2018)

The performance and accuracy of classifier are affected by the result of feature selection directly. Based on the one-class F-Score feature selection and the improved F-Score feature selection and genetic algorithm, combined with machine learning methods like the K nearest neighbor, support vector machine, random forest, naive Bayes, a hybrid feature selection algorithm is proposed to process the two classification unbalanced data problem and multi classification problem. Compared with the traditional machine learning algorithm, it can search in wider feature space and promote classifier to deal with the characteristics of unbalanced data sets according to heuristic rules, which can handle the problem of unbalanced classification better. The experiment results show that the area under receiver operating characteristic curve for two classifications and the accuracy rate for multi classification problem have been improved compared with other models
Modular bases for fluid dynamics
(2009)

We present a new approach to fluid simulation that balances the speed of model reduction with the flexibility of grid-based methods. We construct a set of composable reduced models, or tiles, which capture spatially localized fluid behavior. We then precompute coupling terms so that these models can be rearranged at runtime. To enforce consistency between tiles, we introduce constraint reduction. This technique modifies a reduced model so that a given set of linear constraints can be fulfilled. Because dynamics and constraints can be solved entirely in the reduced space, our method is extremely fast and scales to large domains.
Conceptual Impact-Based Recommender System for CiteSeerx
(2015)

CiteSeer is a digital library for scientific publications written by Computer Science researchers. Users are able to retrieve relevant documents from the database by searching by author name and/or keyword queries. Users may also receive recommendations of papers they might want to read provided by an existing conceptual recommender system. This system recommends documents based on an automaticallyconstructed user profile. Unlike traditional content-based recommender systems, the documents and the user profile are represented as concepts vectors rather than keyword vectors and papers are recommended based on conceptual matches rather than keyword matches between the profile and the documents. Although the current system provides recommendations that are on-topic, they are not necessarily high quality papers. In this work, we introduce the Conceptual Impact-Based Recommender (CIBR), a hybrid recommender system that extends the existing conceptual recommender system in CiteSeer by including an explicit quality factor as part of the recommendation criteria. To measure quality, our system considers the impact factor of each paper’s authors as measured by the authors’ h-index. Experiments to evaluate the effectiveness of our hybrid system show that the CIBR system recommends more relevant papers as compared to the conceptual recommender system.
Design & construction of a Vertical Axis Wind Turbine
(2014)

A wind turbine is a device that converts kinetic energy from the wind into electrical power. Vertical Axis Wind Turbine (VAWT) is one type of wind turbine where the main rotor shaft is set vertically and it can capture wind from any direction. The aim of this work is to develop a theoretical model for the design and performance of Darrieus type vertical axis wind turbine for small scale energy applications. A small 3 bladed turbine (prototype) is constructed and investigated the performance for low wind velocity. The model is based on NACA 0018 airfoil & light wood is used as blade material. The full scale Vertical Axis Wind Turbine is made for 36 inch height, 24 inch diameter, blade cord length is 3.937 inch & blade height is 24 inch. A 100 watt 24 volt brushless DC motor is used to measure output power. The whirling speed of blade & electric power output for the corresponding speed is measured through Tachometer & Wattmeter. The power curves show the relation between the rotational wind speed of the turbine and the power produced for a range of wind speeds. This approach indicates to develop vertical axis wind turbine with better performance to meet the increasing power demand.
Learning Hierarchical Semantic Image Manipulation through Structured Representations
(2018)

Understanding, reasoning, and manipulating semantic concepts of images have been a fundamental research problem for decades. Previous work mainly focused on direct manipulation on natural image manifold through color strokes, keypoints, textures, and holes-to-fill. In this work, we present a novel hierarchical framework for semantic image manipulation. Key to our hierarchical framework is that we employ structured semantic layout as our intermediate representation for manipulation. Initialized with coarse-level bounding boxes, our structure generator first creates pixel-wise semantic layout capturing the object shape, object-object interactions, and object-scene relations. Then our image generator fills in the pixel-level textures guided by the semantic layout. Such framework allows a user to manipulate images at object-level by adding, removing, and moving one bounding box at a time. Experimental evaluations demonstrate the advantages of the hierarchical manipulation framework over existing image generation and context hole-filing models, both qualitatively and quantitatively. Benefits of the hierarchical framework are further demonstrated in applications such as semantic object manipulation, interactive image editing, and data-driven image manipulation.
A computationally efficient limited memory CMA-ES for large scale optimization
(2014)

We propose a computationally efficient limited memory Covariance Matrix Adaptation Evolution Strategy for large scale optimization, which we call the LM-CMA-ES. The LM-CMA-ES is a stochastic, derivative-free algorithm for numerical optimization of non-linear, non-convex optimization problems in continuous domain. Inspired by the limited memory BFGS method of Liu and Nocedal (1989), the LM-CMA-ES samples candidate solutions according to a covariance matrix reproduced from m direction vectors selected during the optimization process. The decomposition of the covariance matrix into Cholesky factors allows to reduce the time and memory complexity of the sampling to O(mn), where $n$ is the number of decision variables. When $n$ is large (e.g., n > 1000), even relatively small values of $m$ (e.g., m=20,30) are sufficient to efficiently solve fully non-separable problems and to reduce the overall run-time.
A Locality Aware Convolutional Neural Networks Accelerator
(2015)

The advantages of Convolutional Neural Networks (CNNs) with respect to traditional methods for visual pattern recognition have changed the field of machine vision. The main issue that hinders broad adoption of this technique is the massive computing workload in CNN that prevents real-time implementation on low-power embedded platforms. Recently, several dedicated solutions have been proposed to improve the energy efficiency and throughput, nevertheless the huge amount of data transfer involved in the processing is still a challenging issue. This work proposes a new CNN accelerator exploiting a novel memory access scheme which significantly improves data locality in CNN related processing. With this scheme, external memory access is reduced by 50% while achieving similar or even better throughput. The accelerator is implemented using 28nm CMOS technology. Implementation results show that the accelerator achieves a performance of 102GOp/s @800MHz while consuming 0.303mm2 in silicon area. Power simulation shows that the dynamic power of the accelerator is 68mW. Its flexibility is demonstrated by running various different CNN benchmarks.
New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications
(1994)

Al~traet--In this paper, we propose a new method to obtain the Euclidean distance transformation and the Voronoi diagram based on the exact Euclidean metric for an n-dimensional picture. We present four algorithms to perform the transformation which are constructed by the serial composition of n-dimensional filters. When performed by a general purpose computer, they are faster than the method by H. Yamada for a two-dimensional picture. Those algorithms require only one n-dimensional array for storing input/output pictures and a single one-dimensional array for a work area, if an input picture needs not be preserved.
A Robust Deep Model for Improved Classification of AD/MCI Patients
(2015)

Accurate classification of Alzheimer's disease (AD) and its prodromal stage, mild cognitive impairment (MCI), plays a critical role in possibly preventing progression of memory impairment and improving quality of life for AD patients. Among many research tasks, it is of a particular interest to identify noninvasive imaging biomarkers for AD diagnosis. In this paper, we present a robust deep learning system to identify different progression stages of AD patients based on MRI and PET scans. We utilized the dropout technique to improve classical deep learning by preventing its weight coadaptation, which is a typical cause of overfitting in deep learning. In addition, we incorporated stability selection, an adaptive learning factor, and a multitask learning strategy into the deep learning framework. We applied the proposed method to the ADNI dataset, and conducted experiments for AD and MCI conversion diagnosis. Experimental results showed that the dropout technique is very effective in AD diagnosis, improving the classification accuracies by 5.9% on average as compared to the classical deep learning methods.
Simulation Model Verification and Validation: Increasing the Users' Confidence
(1997)

This paper sets simulation model verification and validation (V&V) in the context of the process of performing a simulation study. Various different forms of V&V need to take place depending on the stage that has been reached. Since the phases of a study are performed in an iterative manner, so too are the various forms of V&V. A number of difficulties with verifying and validating models are discussed, after which a series of V&V methods are described. V&V is seen as a process of increasing confidence in a model, and not one of demonstrating absolute accuracy.
Reduce The Wastage of Data During Movement in Data Warehouse
(2016)

In this research paper so as to handle Data in warehousing as well as reduce the wastage of data and provide a better results which takes more and more turn into a focal point of the data source business. Data warehousing and on-line analytical processing (OLAP) are vital fundamentals of resolution hold, which has more and more become a focal point of the database manufacturing. Lots of marketable yield and services be at the present accessible, and the entire primary database management organization vendor nowadays have contributions in the area assessment hold up spaces some quite dissimilar necessities on record technology compare to conventional on-line transaction giving out application. This article gives a general idea of data warehousing and OLAP technologies, with the highlighting on top of their latest necessities. So tools which is used for extract, clean-up and load information into back end of a information warehouse; multidimensional data model usual of OLAP; front end client tools for querying and data analysis; server extension for proficient query processing; and tools for data managing and for administration the warehouse. In adding to survey the circumstances of the art, this article also identify a number of capable research issue, a few which are interrelated to
A Comparison of Event Models for Naive Bayes Text Classification
(1998)

Recent approaches to text classification have used two different first-order probabilistic models for classification, both of which make the naive Bayes assumption. Some use a multi-variate Bernoulli model, that is, a Bayesian Network with no dependencies between words and binary word features (e.g. Larkey and Croft 1996; Koller and Sahami 1997). Others use a multinomial model, that is, a uni-gram language model with integer word counts (e.g. Lewis and Gale 1994; Mitchell 1997). This paper aims to clarify the confusion by describing the differences and details of these two models, and by empirically comparing their classification performance on five text corpora. We find that the multi-variate Bernoulli performs well with small vocabulary sizes, but that the multinomial performs usually performs even better at larger vocabulary sizes—providing on average a 27% reduction in error over the multi-variate Bernoulli model at any vocabulary size.
An Extensive Empirical Study of Feature Selection Metrics for Text Classification
(2003)

Machine learning for text classification is the cor nerstone of document categorization, news filtering, document routing, and personalization. In text domains, effective feature selection is essential to make the learning task efficient and m ore accurate. This paper presents an empirical comparison of twelve feature selection methods (e.g . Information Gain) evaluated on a benchmark of 229 text classification problem instances that w ere gathered from Reuters, TREC, OHSUMED, etc. The results are analyzed from multiple goal p ers ectives—accuracy, F-measure, precision, and recall—since each is appropriate in different si tuat ons. The results reveal that a new feature selection me tric we call ‘Bi-Normal Separation’ (BNS), outperformed the others by a substantial margin in most situations. This margin widened in tasks with high class skew, which is rampant in text clas sification problems and is particularly challenging for induction algorithms. A new evaluation methodology is offered that focus es on the needs of the data mining practitioner faced with a single dataset who seeks to choose one (or a pair of) metrics that are most likely to yield the best performance. From this perspect iv , BNS was the top single choice for all goals except precision, for which Information Gain yielded the best result most often. This analysis also revealed, for example, that Informati on Gain and Chi-Squared have correlated failures, and so they work poorly together. When c hoosing optimal pairs of metrics for each of the four performance goals, BNS is consistently a membe r of the pair—e.g., for greatest recall, the pair BNS + F1-measure yielded the best performance on the greatest number of tasks by a considerable margin.