SoroushVahidi/scidocs huggingface dataset:
Harnessing the power of FPGAs using altera's OpenCL compiler
(2013)

In recent years, Field-Programmable Gate Arrays have become extremely powerful computational platforms that can efficiently solve many complex problems. The most modern FPGAs comprise effectively millions of programmable elements, signal processing elements and high-speed interfaces, all of which are necessary to deliver a complete solution. The power of FPGAs is unlocked via low-level programming languages such as VHDL and Verilog, which allow designers to explicitly specify the behavior of each programmable element. While these languages provide a means to create highly efficient logic circuits, they are akin to "assembly language" programming for modern processors. This is a serious limiting factor for both productivity and the adoption of FPGAs on a wider scale. In this talk, we use the OpenCL language to explore techniques that allow us to program FPGAs at a level of abstraction closer to traditional software-centric approaches. OpenCL is an industry standard parallel language based on 'C' that offers numerous advantages that enable designers to take full advantage of the capabilities offered by FPGAs, while providing a high-level design entry language that is familiar to a wide range of programmers.
 To demonstrate the advantages a high-level programming language can offer, we demonstrate how to use Altera's OpenCL Compiler on a set of case studies. The first application is single-precision general-element matrix multiplication (SGEMM). It is an example of a highly-parallel algorithm for which an efficient circuit structures are well known. We show how this application can be implemented in OpenCL and how the high-level description can be optimized to generate the most efficient circuit in hardware. The second application is a Fast Fourier Transform (FFT), which is a classical FPGA benchmark that is known to have a good implementation on FPGAs. We show how we can implement the FFT algorithm, while exploring the many different possible architectural choices that lead to an optimized implementation for a given FPGA. Finally, we discuss a Monte-Carlo Black-Scholes simulation, which demonstrates the computational power of FPGAs. We describe how a random number generator in conjunction with computationally intensive operations can be harnessed on an FPGA to generate a high-speed benchmark, which also consumes far less power than the same benchmark running on a comparable GPU. We conclude the tutorial with a set of live demonstrations.
 Through this tutorial we show the benefits high-level languages offer for system-level design and productivity. In particular, Altera's OpenCL compiler is shown to enable high-performance application design that fully utilizes capabilities of modern FPGAs.
A Portable SDR Non-Orthogonal Multiple Access Testbed for 5G Networks
(2017)

Non-orthogonal multiple access (NOMA) is envisioned to be one of the promising radio access techniques for the fifth generation (5G) mobile networks. In this paper, a portable NOMA testbed based on software defined radio (SDR) is developed by transporting our NOMA system to mini personal computers (PCs). Moreover, the NOMA testbed has been enhanced from 5 MHz bandwidth to 10 MHz bandwidth. As the computation complexity grows higher with the increase of system bandwidth, the portable NOMA testbed is not competent to fully demonstrate the performance of our NOMA system due to the limitation of mini PC. For a better understanding of the NOMA testbed, the system architecture and scenario are introduced in brief. Then, the implementation of NOMA transceiver and the protocol stack are described separately. Finally, a series of experiments are carried out to evaluate its performance loss compared with the original NOMA system based on desktops. The experimental results indicate that the performance of processors may be a short slab for the development of portable SDR-based testbeds towards 5G networks.
Lower Bounds for Finding Stationary Points of Non-Convex , Smooth High-Dimensional Functions ∗
(2017)

We establish lower bounds on the complexity of finding -stationary points of smooth, non-convex, high-dimensional functions. For functions with Lipschitz continuous pth derivative, we show that all algorithms—even randomized algorithms observing arbitrarily high-order derivatives—have worst-case iteration count Ω( −(p+1)/p). Our results imply that the O( −2) convergence rate of gradient descent is unimprovable without additional assumptions (e.g. Lipschitz Hessian), and that cubic regularization of Newton’s method and pth order regularization in general are similarly optimal. Additionally, we prove that deterministic first-order methods, even applied to arbitrarily smooth functions, cannot achieve convergence rates better than O( −8/5), which is within −1/15 of the recently established Õ( −5/3) rate for accelerated gradient descent.
Bayesian Neural Word Embedding
(2016)

Recently, several works in the domain of natural language processing presented successful methods for word embedding. Among them, the Skip-Gram with negative sampling, known also as word2vec, advanced the state-of-the-art of various linguistics tasks. In this paper, we propose a scalable Bayesian neural word embedding algorithm. The algorithm relies on a Variational Bayes solution for the SkipGram objective and a detailed step by step description is provided. We present experimental results that demonstrate the performance of the proposed algorithm for word analogy and similarity tasks on six different datasets and show it is competitive with the original Skip-Gram method.
Exploring the factors affecting MOOC retention: A survey study
(2016)

Massive Open Online Courses (MOOCs) hold the potential to open up educational opportunities to a global audience. However, evidence suggests that only a small proportion of MOOC participants go on to complete their courses and relatively little is understood about the MOOC design and implementation factors that influence retention. This paper reports a survey study of 379 participants enrolled at university in Cairo who were encouraged to take a MOOC of their own choice as part of their development. 122 participants (32.2%) went onto to complete an entire course. There were no significant differences in completion rates by gender, level of study (undergraduate or postgraduate) or MOOC platform. A post-MOOC survey of students' perceptions found that MOOC Course Content was a significant predictor of MOOC retention, with the relationship mediated by the effect of content on the Perceived Effectiveness of the course. Interaction with the instructor of the MOOC was also found to be significant predictor of MOOC retention. Overall these constructs explained 79% of the variance in MOOC retention. © 2016 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Corporate Sustainability : First Evidence on Materiality
(2015)

An increasing number of companies make sustainability investments, and an increasing number of investors integrate sustainability performance data in their capital allocation decisions. To date however, the prior academic literature has not distinguished between investments in material versus immaterial sustainability issues. We develop a novel dataset by hand-mapping data on sustainability investments classified as material for each industry into firm-specific performance data on a variety of sustainability investments. This allows us to present new evidence on the value implications of sustainability investments. Using calendar-time portfolio stock return regressions we find that firms with good performance on material sustainability issues significantly outperform firms with poor performance on these issues, suggesting that investments in sustainability issues are shareholder-value enhancing. Further, firms with good performance on sustainability issues not classified as material do not underperform firms with poor performance on these same issues, suggesting investments in sustainability issues are at a minimum not value-destroying. Finally, firms with good performance on material issues and concurrently poor performance on immaterial issues perform the best. These results speak to the efficiency of firms’ sustainability investments, and also have implications for asset managers who have committed to the integration of sustainability factors in their capital allocation decisions.  Mozaffar Khan is a visiting Associate Professor at Harvard Business School. George Serafeim is the Jakurski Family Associate Professor of Business Administration at Harvard Business School. Aaron Yoon is a doctoral student at Harvard Business School. We are grateful for comments from seminar participants at National University of Singapore and Harvard Business School. We are grateful for financial support from the Division of Faculty Research and Development at Harvard Business School. George Serafeim has served on the Standards Council of SASB. Contact emails: mkhan@hbs.edu; gserafeim@hbs.edu; ayoon@hbs.edu.
VBaaS: VNF Benchmark-as-a-Service
(2015)

When rolling out Network Function Virtualization (NFV) services, resource monitoring becomes a critical task subject to different cost-accuracy tradeoffs depending on whether continuous monitoring or more static infrastructure resource views are taken. In this context, we propose Virtualized Network Functions (VNF) Benchmark-as-a-Service (VBaaS) to enable not only run-time resource evaluation but also test-before-deploy opportunities for VNFs and NFV Infrastructures. We describe the motivation behind VBaaS and its main value proposition for a number of use cases around the orchestration tasks of VNF Forwarding Graphs We present the main components of VBaaS along their system interactions and interfaces, discussing the main benefits of adopting VBaaS and open research issues. Addressing the identified challenges and finalizing our proof of concept VBaaS are our main ongoing work activities.
AN ACCEPTANCE MODEL FOR USEFUL AND FUN INFORMATION SYSTEMS
(2006)

Investigating the factors associated with user acceptance of new software systems has been an important research stream in the field of information systems for many years. The technology acceptance model has long been used to examine the acceptance of utilitarian systems. Recently, it has been used to examine recreational or pleasure-oriented systems. Many examples exist of software that, depending on the context of use, can be used for productive and pleasurable interaction. This paper examines the determinants of use of one such “dual” system. A survey of users of a dual system was conducted. Results show that perceived usefulness is more important in determining intention to use than perceived enjoyment, and that perceived ease of use has no direct impact on intention, but still has a strong indirect effect.
Interactive Neural Translation Assistance for Human Translators
(2016)

We present the first user study on neural interactive translation prediction. Our neural translation aid was built into existing online translation software. Depending on the prefix already typed by the user the system suggests a list of continuations. We assessed the impact of the system on human translators in a user study with both professional and non-professional translators. The analysis was done with respect to translation speed and translation accuracy as assessed by human judges. We find that our neural translation aid enables relatively fast translations and does not compromise on quality.
Accurate and robust localization of duplicated region in copy–move image forgery
(2013)

Copy–move image forgery detection has recently become a very active research topic in blind image forensics. In copy–move image forgery, a region from some image location is copied and pasted to a different location of the same image. Typically, post-processing is applied to better hide the forgery. Using keypoint-based features, such as SIFT features, for detecting copy–move image forgeries has produced promising results. The main idea is detecting duplicated regions in an image by exploiting the similarity between keypoint-based features in these regions. In this paper, we have adopted keypoint-based features for copy–move image forgery detection; however, our emphasis is on accurate and robust localization of duplicated regions. In this context, we are interested in estimating the transformation (e.g., affine) between the copied and pasted regions more accurately as well as extracting these regions as robustly by reducing the number of false positives and negatives. To address these issues, we propose using a more powerful set of keypoint-based features, called MIFT, which shares the properties of SIFT features but also are invariant to mirror reflection transformations. Moreover, we propose refining the affine transformation using an iterative scheme which improves the estimation of the affine transformation parameters by incrementally finding additional keypoint matches. To reduce false positives and negatives when extracting the copied and pasted regions, we propose using “dense” MIFT features, instead of standard pixel correlation, along with hysteresis thresholding and morphological operations. The proposed approach has been evaluated and compared with competitive approaches through a comprehensive set of experiments using a large dataset of real images (i.e., CASIA v2.0). Our results indicate that our method can detect duplicated regions in copy–move image forgery with higher accuracy, especially when the size of the duplicated region is small.
Semantic Similarity Based on Corpus Statistics and Lexical Taxonomy
(1997)

This paper presents a new approach for measuring semantic similarity/distance between words and concepts. It combines a lexical taxonomy structure with corpus statistical information so that the semantic distance between nodes in the semantic space constructed by the taxonomy can be better quantified with the computational evidence derived from a distributional analysis of corpus data. Specifically, the proposed measure is a combined approach that inherits the edge-based approach of the edge counting scheme, which is then enhanced by the node-based approach of the information content calculation. When tested on a common data set of word pair similarity ratings, the proposed approach outperforms other computational models. It gives the highest correlation value (r = 0.828) with a benchmark based on human similarity judgements, whereas an upper bound (r = 0.885) is observed when human subjects replicate the same task.
Automatic Word Sense Discrimination
(1998)

This paper presents context-group discrimination, a disambiguation algorithm based on clustering. Senses are interpreted as groups (or clusters) of similar contexts of the ambiguous word. Words, contexts, and senses are represented in Word Space, a high-dimensional, real-valued space in which closeness corresponds to semantic similarity. Similarity in Word Space is based on second-order co-occurrence: two tokens (or contexts) of the ambiguous word are assigned to the same sense cluster if the words they co-occur with in turn occur with similar words in a training corpus. The algorithm is automatic and unsupervised in both training and application: senses are induced from a corpus without labeled training instances or other external knowledge sources. The paper demonstrates good performance of context-group discrimination for a sample of natural and artificial ambiguous words.
Using WordNet to Disambiguate Word Senses for Text Retrieval
(1993)

This paper describes an automatic indexing procedure that uses the “IS-A” relations contained within WordNet and the set of nouns contained in a text to select a sense for each plysemous noun in the text. The result of the indexing procedure is a vector in which some of the terms represent word senses instead of word stems. Retrieval experiments comparing the effectivenss of these sense-based vectors vs. stem-based vectors show the stem-based vectors to be superior overall, although the sense-based vectors do improve the performance of some queries. The overall degradation is due in large part to the difficulty of disambiguating senses in short query statements. An analysis of these results suggests two conclusions: the IS-A links define a generalization/specialization hierarchy that is not sufficient to reliably select the correct sense of a noun from the set of fine sense distinctions in WordNet; and missing correct matches because of incorrect sense resolution has a much more deleterious effect on retrieval performance than does making spurious matches.
Are Slice-Based Cohesion Metrics Actually Useful in Effort-Aware Post-Release Fault-Proneness Prediction? An Empirical Study
(2015)

Background. Slice-based cohesion metrics leverage program slices with respect to the output variables of a module to quantify the strength of functional relatedness of the elements within the module. Although slice-based cohesion metrics have been proposed for many years, few empirical studies have been conducted to examine their actual usefulness in predicting fault-proneness. Objective. We aim to provide an in-depth understanding of the ability of slice-based cohesion metrics in effort-aware post-release fault-proneness prediction, i.e. their effectiveness in helping practitioners find post-release faults when taking into account the effort needed to test or inspect the code. Method. We use the most commonly used code and process metrics, including size, structural complexity, Halstead's software science, and code churn metrics, as the baseline metrics. First, we employ principal component analysis to analyze the relationships between slice-based cohesion metrics and the baseline metrics. Then, we use univariate prediction models to investigate the correlations between slice-based cohesion metrics and post-release fault-proneness. Finally, we build multivariate prediction models to examine the effectiveness of slice-based cohesion metrics in effort-aware post-release fault-proneness prediction when used alone or used together with the baseline code and process metrics. Results. Based on open-source software systems, our results show that: 1) slice-based cohesion metrics are not redundant with respect to the baseline code and process metrics; 2) most slice-based cohesion metrics are significantly negatively related to post-release fault-proneness; 3) slice-based cohesion metrics in general do not outperform the baseline metrics when predicting post-release fault-proneness; and 4) when used with the baseline metrics together, however, slice-based cohesion metrics can produce a statistically significant and practically important improvement of the effectiveness in effort-aware post-release fault-proneness prediction. Conclusion. Slice-based cohesion metrics are complementary to the most commonly used code and process metrics and are of practical value in the context of effort-aware post-release fault-proneness prediction.
Automatic Spelling Correction for Resource-Scarce Languages using Deep Learning
(2018)

Spelling correction is a well-known task in Natural Language Processing (NLP). Automatic spelling correction is important for many NLP applications like web search engines, text summarization, sentiment analysis etc. Most approaches use parallel data of noisy and correct word mappings from different sources as training data for automatic spelling correction. Indic languages are resourcescarce and do not have such parallel data due to low volume of queries and nonexistence of such prior implementations. In this paper, we show how to build an automatic spelling corrector for resourcescarce languages. We propose a sequenceto-sequence deep learning model which trains end-to-end. We perform experiments on synthetic datasets created for Indic languages, Hindi and Telugu, by incorporating the spelling mistakes committed at character level. A comparative evaluation shows that our model is competitive with the existing spell checking and correction techniques for Indic languages.
Spatial-Aware Object-Level Saliency Prediction by Learning Graphlet Hierarchies
(2015)

To fill the semantic gap between the predictive power of computational saliency models and human behavior, this paper proposes to predict where people look at using spatial-aware object-level cues. While object-level saliency has been recently suggested by psychophysics experiments and shown effective with a few computational models, the spatial relationship between the objects has not yet been explored in this context. We in this work for the first time explicitly model such spatial relationship, as well as leveraging semantic information of an image to enhance object-level saliency modeling. The core computational module is a graphlet-based (i.e., graphlets are moderate-sized connected subgraphs) deep architecture, which hierarchically learns a saliency map from raw image pixels to object-level graphlets (oGLs) and further to spatial-level graphlets (sGLs). Eye tracking data are also used to leverage human experience in saliency prediction. Experimental results demonstrate that the proposed oGLs and sGLs well capture object-level and spatial-level cues relating to saliency, and the resulting saliency model performs competitively compared with the state-of-the-art.
An interleaving and load sharing method for multiphase LLC converters
(2013)

Interleaving frequency-controlled LLC resonant converters will encounter load-sharing problem due to the tolerance of the resonant components. In this paper, full-wave and half-wave switch-controlled capacitors (SCCs) are used in LLC stages to solve this problem. By using resonant capacitance as a control variable, the output current can be modulated even when all the LLC stages are synchronized at the same switching frequency. A design procedure is developed. A 600W prototype is built to verify the feasibility.
Transforming Models with ATL 1
(2005)

This paper presents ATL (ATLAS Transformation Language): a hybrid model transformation language that allows both declarative and imperative constructs to be used in transformation definitions. The paper describes the language syntax by using examples. Language semantics is described in pseudo-code and various optimizations of transformation executions are discussed. ATL is supported by a set of development tools such as an editor, a compiler, a virtual machine, and a debugger. A case study shows the applicability of the language constructs. Alternative ways for implementing the case study are outlined. ATL language features are classified according to a model that captures the commonalities and variabilities of the model transformations domain.
Assessing It/Business Alignment
(2003)

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.