SoroushVahidi/scidocs huggingface dataset:
Analysis of clickjacking attacks and an effective defense scheme for Android devices
(2016)

Smartphones bring users lots of convenience by integrating all useful functions people may need. While users are spending more time on their phones, have they ever questioned of being spoofed by the phone they are interacting with? This paper conducts a thorough study of the mobile clickjacking attacks. We first present how the clickjacking attack works and the key points to remain undiscovered. Then, we evaluate its potential threats by exploring the feasibility of launching clickjacking attacks on various UIs, including system app windows, 3rd-party app windows, and other system UIs. Finally, we propose a system-level defense scheme against clickjacking attacks on Android platform, which requires no user or developer effort and is compatible with existing apps. The performance of the countermeasure is evaluated with extensive experiments. The results show that our scheme can effectively prevent clickjacking attacks with only a minor impact to the system.
Dimensionality Reduction by Learning an Invariant Mapping
(2006)

Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that 'similar" points in input space are mapped to nearby points on the manifold. We present a method - called Dimensionality Reduction by Learning an Invariant Mapping (DrLIM) - for learning a globally coherent nonlinear function that maps the data evenly to the output manifold. The learning relies solely on neighborhood relationships and does not require any distancemeasure in the input space. The method can learn mappings that are invariant to certain transformations of the inputs, as is demonstrated with a number of experiments. Comparisons are made to other techniques, in particular LLE.
Vlfeat: an open and portable library of computer vision algorithms
(2010)

VLFeat is an open and portable library of computer vision algorithms. It aims at facilitating fast prototyping and reproducible research for computer vision scientists and students. It includes rigorous implementations of common building blocks such as feature detectors, feature extractors, (hierarchical) k-means clustering, randomized kd-tree matching, and super-pixelization. The source code and interfaces are fully documented. The library integrates directly with MATLAB, a popular language for computer vision research.
BRIEF: Computing a Local Binary Descriptor Very Fast
(2012)

Binary descriptors are becoming increasingly popular as a means to compare feature points very fast while requiring comparatively small amounts of memory. The typical approach to creating them is to first compute floating-point ones, using an algorithm such as SIFT, and then to binarize them. In this paper, we show that we can directly compute a binary descriptor, which we call BRIEF, on the basis of simple intensity difference tests. As a result, BRIEF is very fast both to build and to match. We compare it against SURF and SIFT on standard benchmarks and show that it yields comparable recognition accuracy, while running in an almost vanishing fraction of the time required by either.
Learning Local Feature Descriptors Using Convex Optimisation
(2014)

The objective of this work is to learn descriptors suitable for the sparse feature detectors used in viewpoint invariant matching. We make a number of novel contributions towards this goal. First, it is shown that learning the pooling regions for the descriptor can be formulated as a convex optimisation problem selecting the regions using sparsity. Second, it is shown that descriptor dimensionality reduction can also be formulated as a convex optimisation problem, using Mahalanobis matrix nuclear norm regularisation. Both formulations are based on discriminative large margin learning constraints. As the third contribution, we evaluate the performance of the compressed descriptors, obtained from the learnt real-valued descriptors by binarisation. Finally, we propose an extension of our learning formulations to a weakly supervised case, which allows us to learn the descriptors from unannotated image collections. It is demonstrated that the new learning methods improve over the state of the art in descriptor learning on the annotated local patches data set of Brown et al. and unannotated photo collections of Philbin et al. .
Quantitative Evaluation of DC Microgrids Availability: Effects of System Architecture and Converter Topology Design Choices
(2011)

This paper presents a quantitative method to evaluate dc microgrids availability by identifying and calculating minimum cut sets occurrence probability for different microgrid architectures and converter topologies. Hence, it provides planners with an essential tool to evaluate downtime costs and decide technology deployments based on quantitative risk assessments by allowing to compare the effect that converter topologies and microgrid architecture choices have on availability. Conventional architectures with single-input converters and alternative configurations with multiple-input converters (MICs) are considered. Calculations yield that all microgrid configurations except those utilizing center converters achieve similar availability of 6-nines. Three converter topologies are used as representatives of many other circuits. These three benchmark circuits are the boost, the isolated SEPIC (ISEPIC), and the current-source half-bridge. Marginal availability differences are observed for different circuit topology choices, although architectures with MICs are more sensitive to this choice. MICs and, in particular, the ISEPIC, are identified as good compromise options for dc microgrids source interfaces. The analysis also models availability influence of local energy storage, both in batteries and generators' fuel. These models provide a quantitative way of comparing dc microgrids with conventional backup energy systems. Calculations based on widely accepted data in industry supports the analysis.
VM Placement Strategies for Cloud Scenarios
(2012)

The problem of Virtual Machine (VM) placement in a compute cloud infrastructure is well-studied in the literature. However, the majority of the existing works ignore the dynamic nature of the incoming stream of VM deployment requests that continuously arrive to the cloud provider infrastructure. In this paper we provide a practical model of cloud placement management under a stream of requests and present a novel technique called Backward Speculative Placement (BSP) that projects the past demand behavior of a VM to a candidate target host. We exploit the BSP technique in two algorithms, first for handling the stream of deployment requests, second in a periodic optimization, to handle the dynamic aspects of the demands. We show the benefits of our BSP technique by comparing the results on a simulation period with a strategy of choosing an optimal placement at each time instant, produced by a generic MIP solver.
Cachexia: a new definition.
(2008)

On December 13th and 14th a group of scientists and clinicians met in Washington, DC, for the cachexia consensus conference. At the present time, there is no widely agreed upon operational definition of cachexia. The lack of a definition accepted by clinician and researchers has limited identification and treatment of cachectic patient as well as the development and approval of potential therapeutic agents. The definition that emerged is: "cachexia, is a complex metabolic syndrome associated with underlying illness and characterized by loss of muscle with or without loss of fat mass. The prominent clinical feature of cachexia is weight loss in adults (corrected for fluid retention) or growth failure in children (excluding endocrine disorders). Anorexia, inflammation, insulin resistance and increased muscle protein breakdown are frequently associated with cachexia. Cachexia is distinct from starvation, age-related loss of muscle mass, primary depression, malabsorption and hyperthyroidism and is associated with increased morbidity. While this definition has not been tested in epidemiological or intervention studies, a consensus operational definition provides an opportunity for increased research.
Deep Neural Network Capacity
(2017)

In recent years, deep neural network exhibits its powerful superiority on information discrimination in many computer vision applications. However, the capacity of deep neural network architecture is still a mystery to the researchers. Intuitively, larger capacity of neural network can always deposit more information to improve the discrimination ability of the model. But, the learnable parameter scale is not feasible to estimate the capacity of deep neural network. Due to the overfitting, directly increasing hidden nodes number and hidden layer number are already demonstrated not necessary to effectively increase the network discrimination ability. In this paper, we propose a novel measurement, named “total valid bits”, to evaluate the capacity of deep neural networks for exploring how to quantitatively understand the deep learning and the insights behind its super performance. Specifically, our scheme to retrieve the total valid bits incorporates the skilled techniques in both training phase and inference phase. In the network training, we design decimal weight regularization and 8-bit forward quantization to obtain the integer-oriented network representations. Moreover, we develop adaptive-bitwidth and non-uniform quantization strategy in the inference phase to find the neural network capacity, total valid bits. By allowing zero bitwidth, our adaptive-bitwidth quantization can execute the model reduction and valid bits finding simultaneously. In our extensive experiments, we first demonstrate that our total valid bits is a good indicator of neural network capacity. We also analyze the impact on network capacity from the network architecture and advanced training
The effectiveness of the combined use of VIX and Support Vector Machines on the prediction of S&P 500
(2013)

The aim of this research is to analyse the effectiveness of the Chicago Board Options Exchange Market Volatility Index (VIX) when used with Support Vector Machines (SVMs) in order to forecast the weekly change in the S&P 500 index. The data provided cover the period between 3 January 2000 and 30 December 2011. A trading simulation is implemented so that statistical efficiency is complemented by measures of economic performance. The inputs retained are traditional technical trading rules commonly used in the analysis of equity markets such as Relative Strength Index, Moving Average Convergence Divergence, VIX and the daily return of the S&P 500. The SVM identifies the best situations in which to buy or sell in the market. The two outputs of the SVM are the movement of the market and the degree of set membership. The obtained results show that SVM using VIX produce better results than the Buy and Hold strategy or SVM without VIX. The influence of VIX in the trading system is particularly significant when bearish periods appear. Moreover, the SVM allows the reduction in the Maximum Drawdown and the annualised standard deviation.
A tourism destination recommender system using users’ sentiment and temporal dynamics
(2018)

With the development and popularity of social networks, an increasing number of consumers prefer to order tourism products online, and like to share their experiences on social networks. Searching for tourism destinations online is a difficult task on account of its more restrictive factors. Recommender system can help these users to dispose information overload. However, such a system is affected by the issue of low recommendation accuracy and the cold-start problem. In this paper, we propose a tourism destination recommender system that employs opinion-mining technology to refine user sentiment, and make use of temporal dynamics to represent user preference and destination popularity drifting over time. These elements are then fused with the SVD+ + method by combining user sentiment and temporal influence. Compared with several well-known recommendation approaches, our method achieves improved recommendation accuracy and quality. A series of experimental evaluations, using a publicly available dataset, demonstrates that the proposed recommender system outperforms the existing recommender systems.
Dynamic MRI reconstruction using low rank plus sparse tensor decomposition
(2016)

In this paper, we introduce a multi-dimensional approach to the problem of reconstruction of MR image sequences that are highly undersampled in k-space. By formulating the reconstruction as a high-order low-rank plus sparse tensor decomposition problem, we propose an efficient numerical algorithm based on the alternating direction method of multipliers (ADMM) to solve the optimization. Through extensive experimental results we show that our proposed method achieves superior reconstruction quality, compared to the state-of-the-art reconstruction methods.
Strategy and architecture of a safety concept for fully automatic and autonomous driving assistance systems
(2010)

As drivers back out of the driving task, when transported automatically by an intelligent car for a longer time, they are not always able to react properly, if a driver take over request occurs. This paper presents two ways, how to deal with this problem within the scope of a functional safety concept. Thereto, the difference between fully automatic and autonomous driving assistance systems is explained. Afterwards two different strategies to reach a safe state in consequence of a system boundary crossing are proposed. In the first case the fall back state is reached by a driver take over, in the second case by an automatic, active fail-safe mechanism. Subsequently the necessary components for monitoring and reaching a safe state and their embedment in a basic, functional architecture of a driving assistance system are described. In this context, special regard is paid to aspects of redundancy as well. In the end it is concluded, that the safety concept proposed here is crucial for guaranteeing enduring safety in an automatically driving car and in consequence for making automatic driving functions commercially ready for serial production.
Open innovation : State of the art and future perspectives
(2010)

Open innovation has become one of the hottest topics in innovation management. This article intends to explore the limits in our understanding of the open innovation concept. In doing so, I address the questions of what (the content of open innovation), when (the context dependency) and how (the process). Open innovation is a rich concept, that can be implemented in many different ways. The context dependency of open innovation is one of the least understood topics; more research is needed on the internal and external environment characteristics affecting performance. The open innovation process relates to both the transition towards open innovation, and the various open innovation practices. As with any new concept, initial studies focus on successful and early adopters, are based on case studies, and descriptive. However, not all lessons learned from the early adopters may be applicable to following firms. Case study research increases our understanding of how things work and enables us to identify important phenomena. They should be followed by quantitative studies involving large samples to determine the relative importance of factors, to build path models to understand chains of effects, and to formally test for context dependencies. However, the evidence shows that open innovation has been a valuable concept for so many firms and in so many contexts, that it is on its way to find its final place in innovation management. & 2010 Elsevier Ltd. All rights reserved.
LINE-mediated retrotransposition of marked Alu sequences
(2003)

Alu elements are the most successful transposons in humans. They are 300-bp non-coding sequences transcribed by RNA polymerase III (Pol III) and are expected to retrotranspose with the aid of reverse transcriptases of cellular origin. We previously showed that human LINEs can generate cDNA copies of any mRNA transcript by means of a retroposition process involving reverse transcription and integration by the LINE-encoded endonuclease and reverse transcriptase. Here we show mobility of marked Alu sequences in human HeLa cells with the canonical features of a retrotransposition process, including splicing out of an autocatalytic intron introduced into the marked sequence, target site duplications of varying lengths and integrations into consensus A-rich sequences. We further show that the poly-A stretch at the Alu 3′ end is essential for mobility, that LINEs are required for transposition and that the rate of retroposition is 100–1,000 times higher for Alu transcripts than for control mRNAs, thus accounting for the high mutational activity of these elements observed in humans.
Security Strategies for SCADA Networks
(2007)

SCADA systems have historically been isolated from other computing resources. However, the use of TCP/IP as a carrier protocol and the trend to interconnect SCADA systems with enterprise networks introduce serious security threats. This paper describes two strategies for securing SCADA networks, both of which have been implemented in a laboratory-scale Modbus network. The first utilizes a security services suite that minimizes the impact on time-critical industrial process systems while adhering to industry standards. The second engages a sophisticated forensic system for SCADA network traffic collection and analysis. The forensic system supports the post mortem analysis of security breaches and the monitoring of process behavior to optimize plant
BSSync: Processing Near Memory for Machine Learning Workloads with Bounded Staleness Consistency Models
(2015)

Parallel machine learning workloads have become prevalent in numerous application domains. Many of these workloads are iterative convergent, allowing different threads to compute in an asynchronous manner, relaxing certain read-after-write data dependencies to use stale values. While considerable effort has been devoted to reducing the communication latency between nodes by utilizing asynchronous parallelism, inefficient utilization of relaxed consistency models within a single node have caused parallel implementations to have low execution efficiency. The long latency and serialization caused by atomic operations have a significant impact on performance. The data communication is not overlapped with the main computation, which reduces execution efficiency. The inefficiency comes from the data movement between where they are stored and where they are processed. In this work, we propose Bounded Staled Sync (BSSync), a hardware support for the bounded staleness consistency model, which accompanies simple logic layers in the memory hierarchy. BSSync overlaps the long latency atomic operation with the main computation, targeting iterative convergent machine learning workloads. Compared to previous work that allows staleness for read operations, BSSync utilizes staleness for write operations, allowing stale-writes. We demonstrate the benefit of the proposed scheme for representative machine learning workloads. On average, our approach outperforms the baseline asynchronous parallel implementation by 1.33x times.
Potential Bacillus probiotics enhance bacterial numbers, water quality and growth during early development of white shrimp (Litopenaeus vannamei).
(2012)

Epidemics of epizootics and occurrence of multiresistant antibiotics of pathogenic bacteria in aquaculture have put forward a development of effective probiotics for the sustainable culture. This study examined the effectiveness of forms of mixed Bacillus probiotics (probiotic A and probiotic B) and mode of probiotic administration on growth, bacterial numbers and water quality during rearing of white shrimp (Litopenaeus vannamei) in two separated experiments: (1) larval stages and (2) postlarval (PL) stages. Forms of Bacillus probiotics and modes of probiotic administration did not affect growth and survival of larval to PL shrimp. The compositions of Bacillus species in probiotic A and probiotic B did not affect growth and survival of larvae. However, postlarvae treated with probiotic B exhibited higher (P<0.05) growth than probiotic A and controls, indicating Bacillus probiotic composition affects the growth of PL shrimp. Total heterotrophic bacteria and Bacillus numbers in larval and PL shrimp or culture water of the treated groups were higher (P<0.05) than in controls. Levels of pH, ammonia and nitrite of the treated shrimp were significantly decreased, compared to the controls. Microencapsulated Bacillus probiotic was effective for rearing of PL L. vannamei. This investigation showed that administration of mixed Bacillus probiotics significantly improved growth and survival of PL shrimp, increased beneficial bacteria in shrimp and culture water and enhanced water quality for the levels of pH, ammonia and nitrite of culture water.
POMDP-based dialogue manager adaptation to extended domains
(2013)

Existing spoken dialogue systems are typically designed to operate in a static and well-defined domain, and are not well suited to tasks in which the concepts and values change dynamically. To handle dynamically changing domains, techniques will be needed to transfer and reuse existing dialogue policies and rapidly adapt them using a small number of dialogues in the new domain. As a first step in this direction, this paper addresses the problem of automatically extending a dialogue system to include a new previously unseen concept (or slot) which can be then used as a search constraint in an information query. The paper shows that in the context of Gaussian process POMDP optimisation, a domain can be extended through a simple expansion of the kernel and then rapidly adapted. As well as being much quicker, adaptation rather than retraining from scratch is shown to avoid subjecting users to unacceptably poor performance during the learning stage.
Towards Automated Cost-Efficient Data Management for Federated Cloud Services
(2016)

Cloud computing has transformed the accessibility and usage of information technology resources, by offering them as services via the Internet. Cloud service provisioning spans across infrastructure, platform and software levels. The management of the services at these levels is based on monitoring. The analysis of monitoring data provides insight into Cloud operations in order to make informed decisions. Due to the emergence of numerous heterogenous Cloud platforms with proprietary APIs, service and monitoring data are being formatted using diverse and mostly incompatible data interchange formats. This results to interoperability issues and makes the analysis of monitoring data from multi-Cloud service deployments difficult to handle. The existing research efforts on data interchange formats have been mainly focused on general performance analyses. Little or no effort has been channelled towards a combination of multiple data interchange formats based on data type to achieve efficient serialisation that can facilitate interoperability in federated Clouds, and also reduce the size of data and bandwidth utilisation cost. This paper addresses these issues by presenting automated framework that is capable of automatically selecting the most suitable data interchange formats for achieving an efficient formatting and serialisation outcome. The goal of the framework is to enable robust and transparent communication within and between multiple Cloud deployments. Based on three use case scenarios, we evaluate the proposed framework to demonstrate its efficacy in formatting and serialising data.