SoroushVahidi/scidocs huggingface dataset:
FARMER: a novel approach to file access correlation mining and evaluation reference model for optimizing peta-scale file system performance
(2008)

File correlation, which refers to a relationship among related files that can manifest in the form of their common access locality (temporal and/or spatial), has become an increasingly important consideration for performance enhancement in peta-scale storage systems. Previous studies on file correlations mainly concern with two aspects of files: file access sequence and semantic attribute. Based on mining with regard to these two aspects of file systems, various strategies have been proposed to optimize the overall system performance. Unfortunately, all of these studies consider either file access sequences or semantic attribute information separately and in isolation, thus unable to accurately and effectively mine file correlations, especially in large-scale distributed storage systems.
 This paper introduces a novel File Access coRrelation Mining and Evaluation Reference model (FARMER) for optimizing petascale file system performance that judiciously considers both file access sequences and semantic attributes simultaneously to evaluate the degree of file correlations by leveraging the Vector Space Model (VSM) technique adopted from the Information Retrieval field. We extract the file correlation knowledge from some typical file system traces using FARMER, and incorporate FARMER into a real large-scale object-based storage system as a case study to dynamically infer file correlations and evaluate the benefits and costs of a FARMER-enabled prefetching algorithm for the metadata servers under real file system workloads. Experimental results show that FARMER can mine and evaluate file correlations more accurately and effectively. More significantly, the FARMER-enabled prefetching algorithm is shown to reduce the metadata operations latency by approximately 24-35% when compared to a state-of-the-art metadata prefetching algorithm and a commonly used replacement policy.
A Risk Management Approach to the "Insider Threat"
(2010)

Recent surveys indicate that the financial impact and operating losses due to insider intrusions are increasing. But these studies often disagree on what constitutes an “insider;” indeed, many define it only implicitly. In theory, appropriate selection of, and enforcement of, properly specified security policies should prevent legitimate users from abusing their access to computer systems, information, and other resources. However, even if policies could be expressed precisely, the natural mapping between the natural language expression of a security policy, and the expression of that policy in a form that can be implemented on a computer system or network, creates gaps in enforcement. This paper defines “insider” precisely, in terms of these gaps, and explores an access-based model for analyzing threats that include those usually termed “insider threats.” This model enables an organization Matt Bishop Matt Bishop, Dept. of Computer Science, University of California at Davis e-mail: bishop@cs.
Geodesic flow kernel for unsupervised domain adaptation
(2012)

In real-world applications of visual recognition, many factors - such as pose, illumination, or image quality - can cause a significant mismatch between the source domain on which classifiers are trained and the target domain to which those classifiers are applied. As such, the classifiers often perform poorly on the target domain. Domain adaptation techniques aim to correct the mismatch. Existing approaches have concentrated on learning feature representations that are invariant across domains, and they often do not directly exploit low-dimensional structures that are intrinsic to many vision datasets. In this paper, we propose a new kernel-based method that takes advantage of such structures. Our geodesic flow kernel models domain shift by integrating an infinite number of subspaces that characterize changes in geometric and statistical properties from the source to the target domain. Our approach is computationally advantageous, automatically inferring important algorithmic parameters without requiring extensive cross-validation or labeled data from either domain. We also introduce a metric that reliably measures the adaptability between a pair of source and target domains. For a given target domain and several source domains, the metric can be used to automatically select the optimal source domain to adapt and avoid less desirable ones. Empirical studies on standard datasets demonstrate the advantages of our approach over competing methods.
SIFT Flow: Dense Correspondence across Scenes and Its Applications
(2011)

While image alignment has been studied in different areas of computer vision for decades, aligning images depicting different scenes remains a challenging problem. Analogous to optical flow, where an image is aligned to its temporally adjacent frame, we propose SIFT flow, a method to align an image to its nearest neighbors in a large image corpus containing a variety of scenes. The SIFT flow algorithm consists of matching densely sampled, pixelwise SIFT features between two images while preserving spatial discontinuities. The SIFT features allow robust matching across different scene/object appearances, whereas the discontinuity-preserving spatial model allows matching of objects located at different parts of the scene. Experiments show that the proposed approach robustly aligns complex scene pairs containing significant spatial differences. Based on SIFT flow, we propose an alignment-based large database framework for image analysis and synthesis, where image information is transferred from the nearest neighbors to a query image according to the dense scene correspondence. This framework is demonstrated through concrete applications such as motion field prediction from a single image, motion synthesis via object transfer, satellite image registration, and face recognition.
Unsupervised Visual Domain Adaptation Using Subspace Alignment
(2013)

In this paper, we introduce a new domain adaptation (DA) algorithm where the source and target domains are represented by subspaces described by eigenvectors. In this context, our method seeks a domain adaptation solution by learning a mapping function which aligns the source subspace with the target one. We show that the solution of the corresponding optimization problem can be obtained in a simple closed form, leading to an extremely fast algorithm. We use a theoretical result to tune the unique hyper parameter corresponding to the size of the subspaces. We run our method on various datasets and show that, despite its intrinsic simplicity, it outperforms state of the art DA methods.
Avoiding Confusing Features in Place Recognition
(2010)

We seek to recognize the place depicted in a query image using a database of “street side” images annotated with geolocation information. This is a challenging task due to changes in scale, viewpoint and lighting between the query and the images in the database. One of the key problems in place recognition is the presence of objects such as trees or road markings, which frequently occur in the database and hence cause significant confusion between different places. As the main contribution, we show how to avoid features leading to confusion of particular places by using geotags attached to database images as a form of supervision. We develop a method for automatic detection of image-specific and spatially-localized groups of confusing features, and demonstrate that suppressing them significantly improves place recognition performance while reducing the database size. We show the method combines well with the state of the art bag-of-features model including query expansion, and demonstrate place recognition that generalizes over wide range of viewpoints and lighting conditions. Results are shown on a geotagged database of over 17K images of Paris downloaded from Google Street View.
Avoiding pathologies in very deep networks
(2014)

Choosing appropriate architectures and regularization strategies of deep networks is crucial to good predictive performance. To shed light on this problem, we analyze the analogous problem of constructing useful priors on compositions of functions. Specifically, we study the deep Gaussian process, a type of infinitely-wide, deep neural network. We show that in standard architectures, the representational capacity of the network tends to capture fewer degrees of freedom as the number of layers increases, retaining only a single degree of freedom in the limit. We propose an alternate network architecture which does not suffer from this pathology. We also examine deep covariance functions, obtained by composing infinitely many feature transforms. Lastly, we characterize the class of models obtained by performing dropout on Gaussian processes.
Future directions for behavioral information security research
(2013)

Information Security (InfoSec) research is far reaching and includes many approaches to deal with protecting and mitigating threats to the information assets and technical resources available within computer based systems. Although a predominant weakness in properly securing information assets is the individual user within an organization, much of the focus of extant security research is on technical issues. The purpose of this paper is to highlight future directions for Behavioral InfoSec research, which is a newer, growing area of research. The ensuing paper presents information about challenges currently faced and future directions that Behavioral InfoSec researchers should explore. These areas include separating insider deviant behavior from insider misbehavior, approaches to understanding hackers, improving information security compliance, cross-cultural Behavioral InfoSec research, and data collection and measurement issues in Behavioral InfoSec research. a 2012 Elsevier Ltd. All rights reserved.
Kitchen Units for Food Units for Table . . . Past Future Predictor
(2015)

In many computer vision applications, machines will need to reason beyond the present, and predict the future. This task is challenging because it requires leveraging extensive commonsense knowledge of the world that is difficult to write down. We believe that a promising resource for efficiently obtaining this knowledge is through the massive amounts of readily available unlabeled video. In this paper, we present a large scale framework that capitalizes on temporal structure in unlabeled video to learn to anticipate both actions and objects in the future. The key idea behind our approach is that we can train deep networks to predict the visual representation of images in the future. We experimentally validate this idea on two challenging “in the wild” video datasets, and our results suggest that learning with unlabeled videos significantly helps forecast actions and anticipate objects.
Development and initial validation of a short three-dimensional inventory of character strengths
(2017)

Character strength is described as a positive and organized pattern of emotions, thoughts, and behaviors. It serves as a schema that organizes categories of information toward the self, others, and the world, and provides the self-aware knowledge that facilitates the pursuit of goals, values, and ethical principles. Recent research has suggested that three reliable factors emerge from the measures of character strengths: caring, inquisitiveness, and self-control. The goal of this paper is to develop a psychometrically sound short measure of character strength. The questions were addressed in two studies using two independent samples: a cross-cultural (i.e., 518 Asians and 556 Westerners) sample, and a cross-population (i.e., 175 community participants and 171 inpatients) sample in China. Findings from the exploratory and confirmatory factor analysis suggested a cross-cultural three-factor model of character strength that could be measured by the Three-dimensional Inventory of Character Strengths (TICS). A multigroup confirmatory factor analysis further indicated that the number of factors and factor loadings was invariant in the medical and community samples. This result indicated that the brief inventory could be applied to a medical context. Internal reliability, content validity, and predictive validity were good, although the predictive validity of the three character strengths for psychological symptoms in the medical sample was more modest than that in the community sample. TICS is expected to be used for screening populations at risk, and a tool to aid mental health professionals in group-based treatment/intervention planning. It also should be noted that this short inventory should be used with caution for individual decision making.
Active learning strategies for rating elicitation in collaborative filtering: A system-wide perspective
(2013)

The accuracy of collaborative-filtering recommender systems largely depends on three factors: the quality of the rating prediction algorithm, and the quantity and quality of available ratings. While research in the field of recommender systems often concentrates on improving prediction algorithms, even the best algorithms will fail if they are fed poor-quality data during training, that is, garbage in, garbage out. Active learning aims to remedy this problem by focusing on obtaining better-quality data that more aptly reflects a user's preferences. However, traditional evaluation of active learning strategies has two major flaws, which have significant negative ramifications on accurately evaluating the system's performance (prediction error, precision, and quantity of elicited ratings). (1) Performance has been evaluated for each user independently (ignoring system-wide improvements). (2) Active learning strategies have been evaluated in isolation from unsolicited user ratings (natural acquisition).
 In this article we show that an elicited rating has effects across the system, so a typical user-centric evaluation which ignores any changes of rating prediction of other users also ignores these cumulative effects, which may be more influential on the performance of the system as a whole (system centric). We propose a new evaluation methodology and use it to evaluate some novel and state-of-the-art rating elicitation strategies. We found that the system-wide effectiveness of a rating elicitation strategy depends on the stage of the rating elicitation process, and on the evaluation measures (MAE, NDCG, and Precision). In particular, we show that using some common user-centric strategies may actually degrade the overall performance of a system. Finally, we show that the performance of many common active learning strategies changes significantly when evaluated concurrently with the natural acquisition of ratings in recommender systems.
DeeperBind: Enhancing prediction of sequence specificities of DNA binding proteins
(2016)

Transcription factors (TFs) are macromolecules that bind to cis-regulatory specific sub-regions of DNA promoters and initiate transcription. Finding the exact location of these binding sites (aka motifs) is important in a variety of domains such as drug design and development. To address this need, several in vivo and in vitro techniques have been developed so far that try to characterize and predict the binding specificity of a protein to different DNA loci. The major problem with these techniques is that they are not accurate enough in prediction of the binding affinity and characterization of the corresponding motifs. As a result, downstream analysis is required to uncover the locations where proteins of interest bind. Here, we propose DeeperBind, a long short term recurrent convolutional network for prediction of protein binding specificities with respect to DNA probes. DeeperBind can model the positional dynamics of probe sequences and hence reckons with the contributions made by individual sub-regions in DNA sequences, in an effective way. Moreover, it can be trained and tested on datasets containing varying-length sequences. We apply our pipeline to the datasets derived from protein binding microarrays (PBMs), an in-vitro high-throughput technology for quantification of protein-DNA binding preferences, and present promising results. To the best of our knowledge, this is the most accurate pipeline that can predict binding specificities of DNA sequences from the data produced by high-throughput technologies through utilization of the power of deep learning for feature generation and positional dynamics modeling.
A Survey of Challenges and Applications of Wireless Body Area Network (WBAN) and Role of a Virtual Doctor Server in Existing Architecture
(2012)

Wireless body area network has gained much interest and became emerging technology at health service facilities due to its wide range of utility and vital role to improve the human health. In this research paper, we are conducting a comprehensive survey of wireless Body Area Network (WBAN) and also introducing a virtual doctor server (VDS) in existing WBAN architecture. Existing architecture of WBAN consists of: wireless sensor, wireless actuator node , wireless central unit and wireless Personal Device (PD). Personal Digital Assistant (PDA) or smart phone can be used as PD. Based on the existing architecture mentioned above, we propose a design concept for a virtual doctor server (VDS) to support various patient health care services. VDS will keep the historical data about the patient, generate the daily tips and advices for him, call the doctor or emergency squad if required and can provide first aid assistance instructions on patient or any of his close relative's PDA's.
Opinion Target Extraction Using Partially-Supervised Word Alignment Model
(2013)

Mining opinion targets from online reviews is an important and challenging task in opinion mining. This paper proposes a novel approach to extract opinion targets by using partially-supervised word alignment model (PSWAM). At first, we apply PSWAM in a monolingual scenario to mine opinion relations in sentences and estimate the associations between words. Then, a graph-based algorithm is exploited to estimate the confidence of each candidate, and the candidates with higher confidence will be extracted as the opinion targets. Compared with existing syntax-based methods, PSWAM can effectively avoid parsing errors when dealing with informal sentences in online reviews. Compared with the methods using alignment model, PSWAM can capture opinion relations more precisely through partial supervision from partial alignment links. Moreover, when estimating candidate confidence, we make penalties on higherdegree vertices in our graph-based algorithm in order to decrease the probability of the random walk running into the unrelated regions in the graph. As a result, some errors can be avoided. The experimental results on three data sets with different sizes and languages show that our approach outperforms state-of-the-art methods.
Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model
(2018)

Existing neural semantic parsers mainly utilize a sequence encoder, i.e., a sequential LSTM, to extract word order features while neglecting other valuable syntactic information such as dependency graph or constituent trees. In this paper, we first propose to use the syntactic graph to represent three types of syntactic information, i.e., word order, dependency and constituency features. We further employ a graph-to-sequence model to encode the syntactic graph and decode a logical form. Experimental results on benchmark datasets show that our model is comparable to the state-ofthe-art on Jobs640, ATIS and Geo880. Experimental results on adversarial examples demonstrate the robustness of the model is also improved by encoding more syntactic information.
Wireless Optical Communication for Underwater Applications
(2014)

Wireless optical communication can be presented as an alternative to acoustic modems for scenarios where high speed, moderate distances, lower power and less complex communication systems are desired. Wireless communication is much more feasible solution to the problem of communicating with robotic vehicles. In this paper, wireless optical communication for the underwater criteria is designed and analysed. The focus of the paper is to construct light emitting diode based links at low cost with faster data rate of 1Mbps, wirelessly under the water. The choice of using LEDs instead of Lasers was largely economic. However, the underwater environment can be very challenging optically and many of the advantages that lasers have in terms of beam quality can be rapidly degraded by scattering and turbulence. Keyword: Moderate distance, Wireless optical, Super bright blue LED.
Integrated Pedestrian and Direction Classification Using a Random Decision Forest
(2013)

For analysing the behaviour of pedestrians in a scene, it is common practice that pedestrian localization, classification, and tracking are conducted consecutively. The direction of a pedestrian, being part of the pose, implies the future path. This paper proposes novel Random Decision Forests (RDFs) to simultaneously classify pedestrians and their directions, without adding an extra module for direction classification to the pedestrian classification module. The proposed algorithm is trained and tested on the TUD multi-view pedestrian and Daimler Mono Pedestrian Benchmark data-sets. The proposed integrated RDF classifiers perform comparable to pedestrian or direction trained separated RDF classifiers. The integrated RDFs yield results comparable to those of state-of-the-art and baseline methods aiming for pedestrian classification or body direction classification, respectively.
A C-band microwave rectifier based on harmonic termination and with input filter removed
(2017)

This paper presents a C-band rectifier employing a third harmonic termination which is realized by a λg/12 short-ended microstrip transmission line. The proposed harmonic termination balances the capacitive impedance of the diode at the fundamental frequency and blocks harmonic current of the diode. The input low-pass filter or matching circuit is removed and the bandwidth of rectifier is enhanced. Theoretical analysis and experiments are carried out. The results show that the proposed topology can realize high efficiency with a wide input frequency range. The fabricated rectifier has a compact dimension of 14mm by 22mm. A maximum RF-DC conversion efficiency of 75.6% at 13 dBm input power is observed. The measured efficiency remains above 70% with the operating frequency form 5.2 GHz to 6 GHz.