SoroushVahidi/scidocs huggingface dataset:
Deep learning of binary hash codes for fast image retrieval
(2015)

Approximate nearest neighbor search is an efficient strategy for large-scale image retrieval. Encouraged by the recent advances in convolutional neural networks (CNNs), we propose an effective deep learning framework to generate binary hash codes for fast image retrieval. Our idea is that when the data labels are available, binary codes can be learned by employing a hidden layer for representing the latent concepts that dominate the class labels. The utilization of the CNN also allows for learning image representations. Unlike other supervised methods that require pair-wised inputs for binary code learning, our method learns hash codes and image representations in a point-wised manner, making it suitable for large-scale datasets. Experimental results show that our method outperforms several state-of-the-art hashing algorithms on the CIFAR-10 and MNIST datasets. We further demonstrate its scalability and efficacy on a large-scale dataset of 1 million clothing images.
Describing objects by their attributes
(2009)

We propose to shift the goal of recognition from naming to describing. Doing so allows us not only to name familiar objects, but also: to report unusual aspects of a familiar object (“spotty dog”, not just “dog”); to say something about unfamiliar objects (“hairy and four-legged”, not just “unknown”); and to learn how to recognize new objects with few or no visual examples. Rather than focusing on identity assignment, we make inferring attributes the core problem of recognition. These attributes can be semantic (“spotty”) or discriminative (“dogs have it but sheep do not”). Learning attributes presents a major new challenge: generalization across object categories, not just across instances within a category. In this paper, we also introduce a novel feature selection method for learning attributes that generalize well across categories. We support our claims by thorough evaluation that provides insights into the limitations of the standard recognition paradigm of naming and demonstrates the new abilities provided by our attribute-based framework.
Style Finder : Fine-Grained Clothing Style Recognition and Retrieval
(2013)

With the rapid proliferation of smartphones and tablet computers, search has moved beyond text to other modalities like images and voice. For many applications like Fashion, visual search offers a compelling interface that can capture stylistic visual elements beyond color and pattern that cannot be as easily described using text. However, extracting and matching such attributes remains an extremely challenging task due to high variability and deformability of clothing items. In this paper, we propose a fine-grained learning model and multimedia retrieval framework to address this problem. First, an attribute vocabulary is constructed using human annotations obtained on a novel finegrained clothing dataset. This vocabulary is then used to train a fine-grained visual recognition system for clothing styles. We report benchmark recognition and retrieval results on Women’s Fashion Coat Dataset and illustrate potential mobile applications for attribute-based multimedia retrieval of clothing items and image annotation.
Efficient Object Category Recognition Using Classemes
(2010)

We introduce a new descriptor for images which allows the construction of efficient and compact classifiers with good accuracy on object category recognition. The descriptor is the output of a large number of weakly trained object category classifiers on the image. The trained categories are selected from an ontology of visual concepts, but the intention is not to encode an explicit decomposition of the scene. Rather, we accept that existing object category classifiers often encode not the category per se but ancillary image characteristics; and that these ancillary characteristics can combine to represent visual classes unrelated to the constituent categories’ semantic meanings. The advantage of this descriptor is that it allows object-category queries to be made against image databases using efficient classifiers (efficient at test time) such as linear support vector machines, and allows these queries to be for novel categories. Even when the representation is reduced to 200 bytes per image, classification accuracy on object category recognition is comparable with the state of the art (36% versus 42%), but at orders of magnitude lower computational cost.
Low-Profile Dual-Wideband Inverted-T Open Slot Antenna for the LTE/WWAN Tablet Computer With a Metallic Frame
(2015)

An inverted-T open slot (ITOS) antenna with a low profile suitable for the LTE/WWAN tablet computer with a metallic frame is presented. With a low profile of 7 mm above the top edge of the device ground plane of the tablet computer, the ITOS antenna can provide two wide operating bands of 698-960 and 1710-2690 MHz to cover the LTE/WWAN operation. The ITOS antenna shows a simple structure and can fit in the narrow region between the metallic frame and the display panel of the tablet computer. The lower and higher operating bands of the antenna can be, respectively, controlled by the low-band and high-band feeds thereof. The low-band feed excites the antenna's longer slot arm to obtain a wide lower band covering the 698-960 MHz band. The high-band feed excites the antenna's shorter slot arm to achieve a wide higher band covering the 1710-2690 MHz band. Working principle of the low-profile ITOS antenna for generating the dual-wideband operation is described. Simulated and experimental results of the antenna are presented and discussed.
Locational marginal pricing basics for restructured wholesale power markets
(2009)

Although Locational Marginal Pricing (LMP) plays an important role in many restructured wholesale power markets, the detailed derivation of LMPs as actually used in industry practice is not readily available. This lack of transparency greatly hinders the efforts of researchers to evaluate the performance of these markets. In this paper, different AC and DC optimal power flow (OPF) models are presented to help understand the derivation of LMPs. As a byproduct of this analysis, the paper provides a rigorous explanation of the basic LMP and LMP-decomposition formulas (neglecting real power losses) presented without derivation in the business practice manuals of the U.S. Midwest Independent System Operator (MISO).
On the O(1=k) convergence of asynchronous distributed alternating Direction Method of Multipliers
(2013)

We consider a network of agents that are cooperatively solving a global optimization problem, where the objective function is the sum of privately known local objective functions of the agents and the decision variables are coupled via linear constraints. Recent literature focused on special cases of this formulation and studied their distributed solution through either subgradient based methods with O(1/√k) rate of convergence (where k is the iteration number) or Alternating Direction Method of Multipliers (ADMM) based methods, which require a synchronous implementation and a globally known order on the agents. In this paper, we present a novel asynchronous ADMM based distributed method for the general formulation and show that it converges at the rate O (1=k).
Joint Optimization of Resource Provisioning in Cloud Computing
(2017)

Cloud computing exploits virtualization to provision resources efficiently. Increasingly, Virtual Machines (VMs) have high bandwidth requirements; however, previous research does not fully address the challenge of both VM and bandwidth provisioning. To efficiently provision resources, a joint approach that combines VMs and bandwidth allocation is required. Furthermore, in practice, demand is uncertain. Service providers allow the reservation of resources. However, due to the dangers of over- and under-provisioning, we employ stochastic programming to account for this risk. To improve the efficiency of the stochastic optimization, we reduce the problem space with a scenario tree reduction algorithm, that significantly increases tractability, whilst remaining a good heuristic. Further we perform a sensitivity analysis that finds the tolerance of our solution to parameter changes. Based on historical demand data, we use a deterministic equivalent formulation to find that our solution is optimal and responds well to changes in parameter values. We also show that sensitivity analysis of prices can be useful for both users and providers in maximizing cost efficiency.
Psychophysiology of False Memories in a Deese-Roediger-McDermott Paradigm with Visual Scenes
(2012)

Remembering something that has not in fact been experienced is commonly referred to as false memory. The Deese-Roediger-McDermott (DRM) paradigm is a well-elaborated approach to this phenomenon. This study attempts to investigate the peripheral physiology of false memories induced in a visual DRM paradigm. The main research question is whether false recognition is different from true recognition in terms of accompanying physiological responses.Sixty subjects participated in the experiment, which included a study phase with visual scenes each showing a group of interrelated items in social contexts. Subjects were divided into an experimental group undergoing a classical DRM design and a control group without DRM manipulation. The control group was implemented in order to statistically control for possible biases produced by memorability differences between stimulus types. After a short retention interval, a pictorial recognition phase was conducted in the manner of a Concealed Information Test. Simultaneous recordings of electrodermal activity, respiration line length, phasic heart rate, and finger pulse waveform length were used. Results yielded a significant Group by Item Type interaction, showing that true recognition is accompanied by greater electrodermal activity than false recognition.Results are discussed in the light of Sokolov's Orienting Reflex, the Preliminary Process Theory and the Concealed Information Test. Implications and restrictions of the introduced design features are critically discussed. This study demonstrates the applicability of measures of peripheral physiology to the field of false memory research.
Making business sense of the Internet.
(1998)

For managers in large, well-established businesses, the Internet is a tough nut to crack. It is very simple to set up a Web presence and very difficult to create a Web-based business model. Established businesses that over decades have carefully built brands and physical distribution relationships risk damaging all they have created when they pursue commerce through the Net. Still, managers can't avoid the impact of electronic commerce on their businesses. They need to understand the opportunities available to them and recognize how their companies may be vulnerable if rivals seize those opportunities first. Broadly speaking, the Internet presents four distinct types of opportunities. First, it links companies directly to customers, suppliers, and other interested parties. Second, it lets companies bypass other players in an industry's value chain. Third, it is a tool for developing and delivering new products and services to new customers. Fourth, it will enable certain companies to dominate the electronic channel of an entire industry or segment, control access to customers, and set business rules. As he elaborates on these four points, the author gives established companies a systematic way to sort through the risks and rewards of doing business in cyberspace.
Transductive Event Classification through Heterogeneous Networks
(2017)

Events can be defined as "something that occurs at specific place and time associated with some specific actions". In general, events extracted from news articles and social networks are used to map the information from web to the various phenomena that occur in our physical world. One of the main steps to perform this relationship is the use of machine learning algorithms for event classification, which has received great attention in the web document engineering field in recent years. Traditional machine learning algorithms are based on vector space model representations and supervised classification. However, events are composed of multiple representations such as textual data, temporal information, geographic location and other types of metadata. All these representations are poorly represented together in a vector space model. Moreover, supervised classification requires the labeling of a significant sample of events to construct a training set for learning process, thereby hampering the practical application of event classification. In this paper, we propose a method called TECHN (Transductive Event Classification through Heterogeneous Networks), which considers event metadata as different objects in an heterogeneous network. Besides, the TECHN method has the ability to automatically learn which types of network objects (event metadata) are most efficient in the classification task. In addition, our TECHN method is based on a transductive classification that considers both labeled events and a vast amount of unlabeled events. The experimental results show that TECHN method obtains promising results, especially when we consider different weights of importance for each type of event metadata and a small set of labeled events.
Executive Functions Predict the Success of Top-Soccer Players
(2012)

While the importance of physical abilities and motor coordination is non-contested in sport, more focus has recently been turned toward cognitive processes important for different sports. However, this line of studies has often investigated sport-specific cognitive traits, while few studies have focused on general cognitive traits. We explored if measures of general executive functions can predict the success of a soccer player. The present study used standardized neuropsychological assessment tools assessing players' general executive functions including on-line multi-processing such as creativity, response inhibition, and cognitive flexibility. In a first cross-sectional part of the study we compared the results between High Division players (HD), Lower Division players (LD) and a standardized norm group. The result shows that both HD and LD players had significantly better measures of executive functions in comparison to the norm group for both men and women. Moreover, the HD players outperformed the LD players in these tests. In the second prospective part of the study, a partial correlation test showed a significant correlation between the result from the executive test and the numbers of goals and assists the players had scored two seasons later. The results from this study strongly suggest that results in cognitive function tests predict the success of ball sport players.
Dataset Augmentation in Feature Space
(2017)

Dataset augmentation, the practice of applying a wide array of domain-specific transformations to synthetically expand a training set, is a standard tool in supervised learning. While effective in tasks such as visual recognition, the set of transformations must be carefully designed, implemented, and tested for every new domain, limiting its re-use and generality. In this paper, we adopt a simpler, domain-agnostic approach to dataset augmentation. We start with existing data points and apply simple transformations such as adding noise, interpolating, or extrapolating between them. Our main insight is to perform the transformation not in input space, but in a learned feature space. A re-kindling of interest in unsupervised representation learning makes this technique timely and more effective. It is a simple proposal, but to-date one that has not been tested empirically. Working in the space of context vectors generated by sequence-to-sequence models, we demonstrate a technique that is effective for both static and sequential data.
Backing Rich Credentials with a Blockchain PKI ∗
(2016)

This is the second of a series of papers describing the results of a project whose goal was to identify five remote identity proofing solutions that can be used as alternatives to knowledge-based verification. This paper describes the second solution, which makes use of a rich credential adapted for use on a blockchain and backed by a blockchain PKI. A rich credential, also used in Solution 1, allows the subject to identify him/herself to a remote verifier with which the subject has no prior relationship by presenting verification factors including possession of a private key, knowledge of a password, and possession of one or more biometric features, with selective disclosure of attributes and selective presentation of verification factors. In Solution 2 the issuer is a bank and the biometric verification factor is speaker recognition, which can be combined with face recognition to defeat voice morphing. The paper describes in detail the concept of a blockchain PKI, and shows that it has remarkable advantages over a traditional PKI, notably the fact that revocation checking is performed on the verifier’s local copy of the blockchain without requiring CRLs or OCSP.
Taking Empowerment to the Next Level : A Multiple-Level Model of Empowerment , Performance , and Satisfaction
(2004)

Most research to date has approached employee empowerment as an individual-level phenomenon. In this study we proposed a work-unit-level construct, empowerment climate, and tested a multiple-level model integrating macro and micro approaches to empowerment. Empowerment climate was shown to be empirically distinct from psychological empowerment and positively related to manager ratings of work-unit performance. A cross-level mediation analysis using hierarchical linear modeling showed that psychological empowerment mediated the relationships between empowerment climate and individual performance and job satisfaction.
Lattice-based motion planning for a general 2-trailer system
(2017)

Motion planning for a general 2-trailer system poses a hard problem for any motion planning algorithm and previous methods have lacked any completeness or optimality guarantees. In this work we present a lattice-based motion planning framework for a general 2-trailer system that is resolution complete and resolution optimal. The solution will satisfy both differential and obstacle imposed constraints and is intended either as a part of an autonomous system or as a driver support system to automatically plan complicated maneuvers in backward and forward motion. The proposed framework relies on a precomputing step that is performed offline to generate a finite set of kinematically feasible motion primitives. These motion primitives are then used to create a regular state lattice that can be searched for a solution using standard graph-search algorithms. To make this graph-search problem tractable for real-time applications a novel parametrization of the reachable state space is proposed where each motion primitive moves the system from and to a selected set of circular equilibrium configurations. The approach is evaluated over three different scenarios and impressive real-time performance is achieved.
Labelling strategies for hierarchical multi-label classification techniques
(2016)

Many hierarchical multi-label classification systems predict a real valued score for every (instance, class) couple, with a higher score reflecting more confidence that the instance belongs to that class. These classifiers leave the conversion of these scores to an actual label set to the user, who applies a cut-off value to the scores. The predictive performance of these classifiers is usually evaluated using threshold independent measures like precision-recall curves. However, several applications require actual label sets, and thus an automatic labelling strategy. In this article, we present and evaluate different alternatives to perform the actual labelling in hierarchical multi-label classification. We investigate the selection of both single and multiple thresholds. Despite the existence of multiple threshold selection strategies in non-hierarchical multi-label classification, they can not be applied directly to the hierarchical context. The proposed strategies are implemented within two main approaches: optimisation of a certain performance measure of interest (such as F-measure or hierarchical loss), and simulating training set properties (such as class distribution or label cardinality) in the predictions. We assess the performance of the proposed labelling schemes on 10 datasets from different application domains. Our results show that selecting multiple thresholds may result in ∗Corresponding author. Tel : +32(0)9 331 36 93 Fax : +32(0)9 221 76 73 Email addresses: Isaac.Triguero@irc.vib-UGent.be (Isaac Triguero), Celine.Vens@kuleuven-kulak.be (Celine Vens) Preprint submitted to Elsevier January 29, 2016 an efficient and effective solution for hierarchical multi-label problems.
Building a Robust Implementation of Bearing-only Inertial SLAM for a UAV
(2007)

This paper presents the on-going design and implementation of a robust inertial sensor based Simultaneous Localisation And Mapping (SLAM) algorithm for an Unmanned Aerial Vehicle (UAV) using bearing-only observations. A single colour vision camera is used to observe the terrain from which image points corresponding to features in the environment are extracted. The SLAM algorithm estimates the complete 6-DoF motion of the UAV along with the three-dimensional position of the features in the environment. An Extended Kalman Filter (EKF) approach is used where a technique of delayed initialisation is performed to initialise the 3D position of features from bearing-only observations. Data association is achieved using a multi-hypothesis innovation gate based on the spatial uncertainty of each feature. Results are presented by running the algorithm off-line using inertial sensor and vision data collected during a flight test of a UAV.
Normative rational agents-A BDI approach
(2012)

This paper proposes an approach on how to accommodate norms to an already existing architecture of rational agents. Starting from the famous BDI model, an extension of the BDI execution loop will be presented; it will address such issues as norm instantiation and norm internalization, with a particular emphasis on the problem of norm consistency. A proposal for the resolution of conflicts between newly occurring norms, on one side, and already existing norms or mental states, on the other side, will be described. While it is fairly difficult to imagine an evaluation for the proposed architecture, a challenging scenario inspired form the science-fiction literature will be used to give the reader an intuition of how the proposed approach will deal with situations of normative conflicts.
Temporal QoS-aware web service recommendation via non-negative tensor factorization
(2014)

With the rapid growth of Web Service in the past decade, the issue of QoS-aware Web service recommendation is becoming more and more critical. Since the Web service QoS information collection work requires much time and effort, and is sometimes even impractical, the service QoS value is usually missing. There are some work to predict the missing QoS value using traditional collaborative filtering methods based on user-service static model. However, the QoS value is highly related to the invocation context (e.g., QoS value are various at different time). By considering the third dynamic context information, a Temporal QoS-aware Web Service Recommendation Framework is presented to predict missing QoS value under various temporal context. Further, we formalize this problem as a generalized tensor factorization model and propose a Non-negative Tensor Factorization (NTF) algorithm which is able to deal with the triadic relations of user-service-time model. Extensive experiments are conducted based on our real-world Web service QoS dataset collected on Planet-Lab, which is comprised of service invocation response-time and throughput value from 343 users on 5817 Web services at 32 time periods. The comprehensive experimental analysis shows that our approach achieves better prediction accuracy than other approaches.