SoroushVahidi/scidocs huggingface dataset:
A novel end-to-end classifier using domain transferred deep convolutional neural networks for biomedical images
(2017)

BACKGROUND AND OBJECTIVES
Highly accurate classification of biomedical images is an essential task in the clinical diagnosis of numerous medical diseases identified from those images. Traditional image classification methods combined with hand-crafted image feature descriptors and various classifiers are not able to effectively improve the accuracy rate and meet the high requirements of classification of biomedical images. The same also holds true for artificial neural network models directly trained with limited biomedical images used as training data or directly used as a black box to extract the deep features based on another distant dataset. In this study, we propose a highly reliable and accurate end-to-end classifier for all kinds of biomedical images via deep learning and transfer learning.


METHODS
We first apply domain transferred deep convolutional neural network for building a deep model; and then develop an overall deep learning architecture based on the raw pixels of original biomedical images using supervised training. In our model, we do not need the manual design of the feature space, seek an effective feature vector classifier or segment specific detection object and image patches, which are the main technological difficulties in the adoption of traditional image classification methods. Moreover, we do not need to be concerned with whether there are large training sets of annotated biomedical images, affordable parallel computing resources featuring GPUs or long times to wait for training a perfect deep model, which are the main problems to train deep neural networks for biomedical image classification as observed in recent works.


RESULTS
With the utilization of a simple data augmentation method and fast convergence speed, our algorithm can achieve the best accuracy rate and outstanding classification ability for biomedical images. We have evaluated our classifier on several well-known public biomedical datasets and compared it with several state-of-the-art approaches.


CONCLUSIONS
We propose a robust automated end-to-end classifier for biomedical images based on a domain transferred deep convolutional neural network model that shows a highly reliable and accurate performance which has been confirmed on several public biomedical image datasets.
Single-Fed Low-Profile High-Gain Circularly Polarized Slotted Cavity Antenna Using a High-Order Mode
(2016)

In this letter, a single-fed low-profile high-gain circularly polarized slotted cavity antenna using a high-order cavity mode, i.e., TE440 mode, is proposed. The proposed antenna has a simple structure that consists of a radiating linearly polarized slotted cavity antenna and a linear-to-circular polarization converter. An antenna prototype operating at WLAN 5.8-GHz band fabricated with low-cost standard printed circuit board (PCB) process is exemplified to validate the proposed concept. Measured results compared to their simulated counterparts are presented, and a good agreement between simulation and measurement is obtained.
Articulated pose estimation with flexible mixtures-of-parts
(2011)

We describe a method for human pose estimation in static images based on a novel representation of part models. Notably, we do not use articulated limb parts, but rather capture orientation with a mixture of templates for each part. We describe a general, flexible mixture model for capturing contextual co-occurrence relations between parts, augmenting standard spring models that encode spatial relations. We show that such relations can capture notions of local rigidity. When co-occurrence and spatial relations are tree-structured, our model can be efficiently optimized with dynamic programming. We present experimental results on standard benchmarks for pose estimation that indicate our approach is the state-of-the-art system for pose estimation, outperforming past work by 50% while being orders of magnitude faster.
Learning from Explicit and Implicit Supervision Jointly For Algebra Word Problems
(2016)

Automatically solving algebra word problems has raised considerable interest recently. Existing state-of-the-art approaches mainly rely on learning from human annotated equations. In this paper, we demonstrate that it is possible to efficiently mine algebra problems and their numerical solutions with little to no manual effort. To leverage the mined dataset, we propose a novel structured-output learning algorithm that aims to learn from both explicit (e.g., equations) and implicit (e.g., solutions) supervision signals jointly. Enabled by this new algorithm, our model gains 4.6% absolute improvement in accuracy on the ALG514 benchmark compared to the one without using implicit supervision. The final model also outperforms the current state-of-the-art approach by 3%.
Fault investigations on die-cast copper rotors
(2016)

It has been long known to the market that, the use of copper in the rotor in place of aluminium, taking advantage of copper's high conductivity, can be an economic solution for various applications, including electric vehicle, in the development of energy efficient motors. In comparison to aluminium, copper die-casting is extremely difficult to perform due to its high density, viscosity and melting point. Owing to these reasons, the copper die-cast rotors will evince several manufacturing problems. The objective of this paper is to identify the various defects in the manufacturing of copper die-cast rotor, and identify the lamination-coating-condition that sustains copper die-cast pressure and temperature. This paper evaluates the effectiveness of lamination coating on limiting the eddy current loss, and the recoating process to improve, in case the eddy current losses are in excess due to copper die-casting.
The recognition of rice images by UAV based on capsule network
(2018)

It is important to recognize the rice image captured by unmanned aerial vehicle (UAV) for monitoring the growth of rice and preventing the diseases and pests. Aiming at the image recognition, we use rice images captured by UAV as our data source, the structure of capsule network (CapsNet) is built to recognize rice images in this paper. The images are preprocessed through histogram equalization method into grayscale images and through superpixel algorithm into the superpixel segmentation results. The both results are output into the CapsNet. The function of CapsNet is to perform the reverse analysis of rice images. The CapsNet consists of five layers: an input layer, a convolution layer, a primary capsules layer, a digital capsules layer and an output layer. The CapsNet trains classification and predicts the output vector based on routing-by-agreement protocol. Therefore, the features of rice image by UAV can be precisely and efficiently extracted. The method is more convenient than the traditional artificial recognition. It provides the scientific support and reference for decision-making process of precision agriculture.
A functional taxonomy of wireless sensor network devices
(2005)

With the availability of cheap computing technology and the standardization of different wireless communication paradigms, wireless sensor networks (WSNs) are becoming a reality. This is visible in the increasing amount of research being done in the WSN area, and the growing number of companies offering commercial WSN solutions. In this regard, we realize that there is a need for an unambiguous classification and definition of WSN devices. Such a classification scheme would benefit the WSN research and industrial community. We consider the spectrum of wireless devices ranging from passive RF devices to gateway devices for the classification. The classification scheme is based on functionality of the devices. This scheme is analogous to an object-oriented classification, where an object is classified on the basis of its functionality and is described by its attributes. Attributes of the wireless devices are grouped into five broad categories: communication, sensing, power, memory, and "other features". Each of these are further classified to provide sufficient details that are required for a typical WSN application
Permittivity and Loss Tangent Characterization for Garment Antennas Based on a New Matrix-Pencil Two-Line Method
(2008)

The emergence of wearable antennas to be integrated into garments has revealed the need for a careful electromagnetic characterization of textile materials. Therefore, we propose in this paper a new matrix-pencil two-line method that removes perturbations in the calculated effective permittivity and loss tangent which are caused by imperfect deembedding and inhomogeneities of the textile microstrip line structure. The approach has been rigorously validated for high-frequency laminates by comparing measured and simulated data for the resonance frequency of antennas designed using the calculated parameters. The method has been successfully applied to characterize the permittivity and loss tangent of a variety of textile materials and up to a frequency of 10 GHz. Furthermore it is shown that the use of electrotextiles in antenna design influences the effective substrate permittivity.
Mining geographic-temporal-semantic patterns in trajectories for location prediction
(2013)

In recent years, research on location predictions by mining trajectories of users has attracted a lot of attention. Existing studies on this topic mostly treat such predictions as just a type of location recommendation, that is, they predict the next location of a user using location recommenders. However, an user usually visits somewhere for reasons other than interestingness. In this article, we propose a novel mining-based location prediction approach called Geographic-Temporal-Semantic-based Location Prediction (GTS-LP), which takes into account a user's geographic-triggered intentions, temporal-triggered intentions, and semantic-triggered intentions, to estimate the probability of the user in visiting a location. The core idea underlying our proposal is the discovery of trajectory patterns of users, namely GTS patterns, to capture frequent movements triggered by the three kinds of intentions. To achieve this goal, we define a new trajectory pattern to capture the key properties of the behaviors that are motivated by the three kinds of intentions from trajectories of users. In our GTS-LP approach, we propose a series of novel matching strategies to calculate the similarity between the current movement of a user and discovered GTS patterns based on various moving intentions. On the basis of similitude, we make an online prediction as to the location the user intends to visit. To the best of our knowledge, this is the first work on location prediction based on trajectory pattern mining that explores the geographic, temporal, and semantic properties simultaneously. By means of a comprehensive evaluation using various real trajectory datasets, we show that our proposed GTS-LP approach delivers excellent performance and significantly outperforms existing state-of-the-art location prediction methods.
Feature Selection and Kernel Learning for Local Learning-Based Clustering
(2011)

The performance of the most clustering algorithms highly relies on the representation of data in the input space or the Hilbert space of kernel methods. This paper is to obtain an appropriate data representation through feature selection or kernel learning within the framework of the Local Learning-Based Clustering (LLC) (Wu and Schölkopf 2006) method, which can outperform the global learning-based ones when dealing with the high-dimensional data lying on manifold. Specifically, we associate a weight to each feature or kernel and incorporate it into the built-in regularization of the LLC algorithm to take into account the relevance of each feature or kernel for the clustering. Accordingly, the weights are estimated iteratively in the clustering process. We show that the resulting weighted regularization with an additional constraint on the weights is equivalent to a known sparse-promoting penalty. Hence, the weights of those irrelevant features or kernels can be shrunk toward zero. Extensive experiments show the efficacy of the proposed methods on the benchmark data sets.
Using Phase Instead of Optical Flow for Action Recognition
(2018)

Currently, the most common motion representation for action recognition is optical flow. Optical flow is based on particle tracking which adheres to a Lagrangian perspective on dynamics. In contrast to the Lagrangian perspective, the Eulerian model of dynamics does not track, but describes local changes. For video, an Eulerian phase-based motion representation, using complex steerable filters, has been successfully employed recently for motion magnification and video frame interpolation. Inspired by these previous works, here, we proposes learning Eulerian motion representations in a deep architecture for action recognition. We learn filters in the complex domain in an end-to-end manner. We design these complex filters to resemble complex Gabor filters, typically employed for phase-information extraction. We propose a phaseinformation extraction module, based on these complex filters, that can be used in any network architecture for extracting Eulerian representations. We experimentally analyze the added value of Eulerian motion representations, as extracted by our proposed phase extraction module, and compare with existing motion representations based on optical flow, on the UCF101 dataset.
A generalized taxonomy of explanations styles for traditional and social recommender systems
(2011)

Recommender systems usually provide explanations of their recommendations to better help users to choose products, activities or even friends. Up until now, the type of an explanation style was considered in accordance to the recommender system that employed it. This relation was one-to-one, meaning that for each different recommender systems category, there was a different explanation style category. However, this kind of one-to-one correspondence can be considered as over-simplistic and non generalizable. In contrast, we consider three fundamental resources that can be used in an explanation: users, items and features and any combination of them. In this survey, we define (i) the Human style of explanation, which provides explanations based on similar users, (ii) the Item style of explanation, which is based on choices made by a user on similar items and (iii) the Feature style of explanation, which explains the recommendation based on item features rated by the user beforehand. By using any combination of the aforementioned styles we can also define the Hybrid style of explanation. We demonstrate how these styles are put into practice, by presenting recommender systems that employ them. Moreover, since there is inadequate research in the impact of social web in contemporary recommender systems and their explanation styles, we study new emerged social recommender systems i.e. Facebook Connect explanations (HuffPo, Netflix, etc.) and geo-social explanations that combine geographical with social data (Gowalla, Facebook Places, etc.). Finally, we summarize the results of three different user studies, to support that Hybrid is the most effective explanation style, since it incorporates all other styles.
Online Learning for Time Series Prediction
(2013)

In this paper we address the problem of predicting a time seri e using the ARMA (autoregressive moving average) model, under minimal assumptions on the noi se terms. Using regret minimization techniques, we develop effective online learning algorith ms for the prediction problem, withoutassuming that the noise terms are Gaussian, identically distribu ted or even independent. Furthermore, we show that our algorithm’s performances asymptotically app roaches the performance of the best ARMA model in hindsight.
Logarithmic regret algorithms for online convex optimization
(2006)

In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After each point is chosen, it encounters a sequence of (possibly unrelated) convex cost functions. Zinkevich (ICML 2003) introduced this framework, which models many natural repeated decision-making problems and generalizes many existing problems such as Prediction from Expert Advice and Cover’s Universal Portfolios. Zinkevich showed that a simple online gradient descent algorithm achieves additive regret $O(\sqrt{T})$ , for an arbitrary sequence of T convex cost functions (of bounded gradients), with respect to the best single decision in hindsight. In this paper, we give algorithms that achieve regret O(log (T)) for an arbitrary sequence of strictly convex functions (with bounded first and second derivatives). This mirrors what has been done for the special cases of prediction from expert advice by Kivinen and Warmuth (EuroCOLT 1999), and Universal Portfolios by Cover (Math. Finance 1:1–19, 1991). We propose several algorithms achieving logarithmic regret, which besides being more general are also much more efficient to implement. The main new ideas give rise to an efficient algorithm based on the Newton method for optimization, a new tool in the field. Our analysis shows a surprising connection between the natural follow-the-leader approach and the Newton method. We also analyze other algorithms, which tie together several different previous approaches including follow-the-leader, exponential weighting, Cover’s algorithm and gradient descent.
Averaging Expert Predictions
(1999)

We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss function is applied to measure the discrepancy between the predictions and actual observations. The algorithm keeps a weight for each expert. At each trial the weights are first used to help produce the prediction and then updated according to the observed outcome. Our starting point is Vovk’s Aggregating Algorithm, in which the weights have a simple form: the weight of an expert decreases exponentially as a function of the loss incurred by the expert. The prediction of the Aggregating Algorithm is typically a nonlinear function of the weights and the experts’ predictions. We analyze here a simplified algorithm in which the weights are as in the original Aggregating Algorithm, but the prediction is simply the weighted average of the experts’ predictions. We show that for a large class of loss functions, even with the simplified prediction rule the additional loss of the algorithm over the loss of the best expert is at most c ln n, where n is the number of experts and c a constant that depends on the loss function. Thus, the bound is of the same form as the known bounds for the Aggregating Algorithm, although the constants here are not quite as good. We use relative entropy to rewrite the bounds in a stronger form and to motivate the update.
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
(2003)

Convex programming involves a convex set F ⊆ R and a convex function c : F → R. The goal of convex programming is to find a point in F which minimizes c. In this paper, we introduce online convex programming. In online convex programming, the convex set is known in advance, but in each step of some repeated optimization problem, one must select a point in F before seeing the cost function for that step. This can be used to model factory production, farm production, and many other industrial optimization problems where one is unaware of the value of the items produced until they have already been constructed. We introduce an algorithm for this domain, apply it to repeated games, and show that it is really a generalization of infinitesimal gradient ascent, and the results here imply that generalized infinitesimal gradient ascent (GIGA) is universally consistent.
Air Craft Winglet Design and Performance : Cant Angle Effect
(2016)

A winglet is a device used to improve the efficiency of aircraft by lowering the lift induced drag caused by wingtip vortices. It is a vertical or angled extension at the tips of each wing. Winglets improve efficiency by diffusing the shed wingtip vortex, which in turn reduces the drag due to lift and improves the wing’s lift over drag ratio Winglets increase the effective aspect ratio of a wing without adding greatly to the structural stress and hence necessary weight of its structure. In this research, a numerical validation procedure (by FLUENT ®, computational fluid dynamics software with The Spalart-Allmaras turbulence model) is described for determination and estimation aerodynamic characteristics of three dimension subsonic rectangular wing (with NACA653218airfoil cross section). It was observed that at the present work a good agreement between the numerical study and the experimental work. This paper describes a CFD 3-dimensional winglets analysis that was performed on a Cessna wing of NACA2412 cross sectional airfoil. The wing has span 13.16 m, root chord 1.857 m, tip chord 0.928 m, sweep angle 11 degree and taper ratio 0.5. The present study shows wing without winglet and wing with winglet at cant angle 0, 30 and 45 degree. A CFD simulation performs by to compare of aerodynamics characteristics of lift coefficient CL, drag coefficient CD and lift to drag ratio, L/D lift, pathlines and pressure contours. The models run at a Mach number of 0.2 at sea level. The pressure and temperature of air at this height are 101.325 kPa and 288.2 K respectively. The results show that the wing with winglet can increase the lift by ratio approximately 12%. The wing with winglet can decrease the drag by ratio approximately 4%. The wing with winglet can increase lift to drag, L/D by about 11% along different phases of flight.
Highly compact 1T-1R architecture (4F2 footprint) involving fully CMOS compatible vertical GAA nano-pillar transistors and oxide-based RRAM cells exhibiting excellent NVM properties and ultra-low power operation
(2012)

For the first time, nano-meter-scaled 1T-1R non-volatile memory (NVM) architecture comprising of RRAM cells built on vertical GAA nano-pillar transistors, either junction-less or junction-based, is systematically investigated. Transistors are fabricated using fully CMOS compatible technology and RRAM cells are stacked onto the tip of the nano-pillars (with a diameter down to ~37nm) to achieve a compact 4F2 footprint. In addition, through this platform, different RRAM stacks comprising CMOS friendly materials are studied, and it is found that TiN/Ni/HfO2/n+-Si RRAM cells show excellent switching properties in either bipolar or unipolar mode, including (1) ultra-low switching current/power: SET ~20nA/85nW and RESET ~200pA/700pW, (2) multi-level switchability, (3) good endurance, >105, (4) satisfactory retention, 10 years at 85oC; and (5) fast switching speed ~50ns. Moreover, this vertical (gate-all-around) GAA nano-pillar based 1T-1R architecture provides a more direct and flexible test vehicle to verify the scalability and functionality of RRAM candidates with a dimension close to actual application.