SoroushVahidi/scidocs huggingface dataset:
Potentials and Challenges of C-RAN Supporting Multi-RATs Toward 5G Mobile Networks
(2014)

This paper presents an overview of the cloud radio access network (C-RAN), which is a key enabler for future mobile networks in order to meet the explosive capacity demand of mobile traffic, and reduce the capital and operating expenditure burden faced by operators. We start by reviewing the requirements of future mobile networks, called 5G, followed by a discussion on emerging network concepts for 5G network architecture. Then, an overview of C-RAN and related works are presented. As a significant scenario of a 5G system, the ultra dense network deployment based on C-RAN is discussed with focuses on flexible backhauling, automated network organization, and advanced mobility management. Another import feature of a 5G system is the long-term coexistence of multiple radio access technologies (multi-RATs). Therefore, we present some directions and preliminary thoughts for future C-RAN-supporting Multi-RATs, including joint resource allocation, mobility management, as well as traffic steering and service mapping.
Depth-Based Hand Pose Estimation: Methods, Data, and Challenges
(2018)

Hand pose estimation has matured rapidly in recent years. The introduction of commodity depth sensors and a multitude of practical applications have spurred new advances. We provide an extensive analysis of the state-of-the-art, focusing on hand pose estimation from a single depth frame. To do so, we have implemented a considerable number of systems, and have released software and evaluation code. We summarize important conclusions here: (1) Coarse pose estimation appears viable for scenes with isolated hands. However, high precision pose estimation [required for immersive virtual reality and cluttered scenes (where hands may be interacting with nearby objects and surfaces) remain a challenge. To spur further progress we introduce a challenging new dataset with diverse, cluttered scenes. (2) Many methods evaluate themselves with disparate criteria, making comparisons difficult. We define a consistent evaluation criteria, rigorously motivated by human experiments. (3) We introduce a simple nearest-neighbor baseline that outperforms most existing systems. This implies that most systems do not generalize beyond their training sets. This also reinforces the under-appreciated point that training data is as important as the model itself. We conclude with directions for future progress.
Towards an intelligent framework for multimodal affective data analysis
(2015)

An increasingly large amount of multimodal content is posted on social media websites such as YouTube and Facebook everyday. In order to cope with the growth of such so much multimodal data, there is an urgent need to develop an intelligent multi-modal analysis framework that can effectively extract information from multiple modalities. In this paper, we propose a novel multimodal information extraction agent, which infers and aggregates the semantic and affective information associated with user-generated multimodal data in contexts such as e-learning, e-health, automatic video content tagging and human-computer interaction. In particular, the developed intelligent agent adopts an ensemble feature extraction approach by exploiting the joint use of tri-modal (text, audio and video) features to enhance the multimodal information extraction process. In preliminary experiments using the eNTERFACE dataset, our proposed multi-modal system is shown to achieve an accuracy of 87.95%, outperforming the best state-of-the-art system by more than 10%, or in relative terms, a 56% reduction in error rate.
Opensmile: the munich versatile and fast open-source audio feature extractor
(2010)

We introduce the openSMILE feature extraction toolkit, which unites feature extraction algorithms from the speech processing and the Music Information Retrieval communities. Audio low-level descriptors such as CHROMA and CENS features, loudness, Mel-frequency cepstral coefficients, perceptual linear predictive cepstral coefficients, linear predictive coefficients, line spectral frequencies, fundamental frequency, and formant frequencies are supported. Delta regression and various statistical functionals can be applied to the low-level descriptors. openSMILE is implemented in C++ with no third-party dependencies for the core functionality. It is fast, runs on Unix and Windows platforms, and has a modular, component based architecture which makes extensions via plug-ins easy. It supports on-line incremental processing for all implemented features as well as off-line and batch processing. Numeric compatibility with future versions is ensured by means of unit tests. openSMILE can be downloaded from http://opensmile.sourceforge.net/.
A Deeper Look into Sarcastic Tweets Using Deep Convolutional Neural Networks
(2016)

Sarcasm detection is a key task for many natural language processing tasks. In sentiment analysis, for example, sarcasm can flip the polarity of an “apparently positive” sentence and, hence, negatively affect polarity detection performance. To date, most approaches to sarcasm detection have treated the task primarily as a text categorization problem. Sarcasm, however, can be expressed in very subtle ways and requires a deeper understanding of natural language that standard text categorization techniques cannot grasp. In this work, we develop models based on a pre-trained convolutional neural network for extracting sentiment, emotion and personality features for sarcasm detection. Such features, along with the network’s baseline features, allow the proposed models to outperform the state of the art on benchmark datasets. We also address the often ignored generalizability issue of classifying data that have not been seen by the models at learning phase.
Convolutional recurrent neural networks: Learning spatial dependencies for image representation
(2015)

In existing convolutional neural networks (CNNs), both convolution and pooling are locally performed for image regions separately, no contextual dependencies between different image regions have been taken into consideration. Such dependencies represent useful spatial structure information in images. Whereas recurrent neural networks (RNNs) are designed for learning contextual dependencies among sequential data by using the recurrent (feedback) connections. In this work, we propose the convolutional recurrent neural network (C-RNN), which learns the spatial dependencies between image regions to enhance the discriminative power of image representation. The C-RNN is trained in an end-to-end manner from raw pixel images. CNN layers are firstly processed to generate middle level features. RNN layer is then learned to encode spatial dependencies. The C-RNN can learn better image representation, especially for images with obvious spatial contextual dependencies. Our method achieves competitive performance on ILSVRC 2012, SUN 397, and MIT indoor.
Traffic Light Control System for Emergency Vehicles Using Radio Frequency
(2013)

Traffic congestion problem is a phenomena which contributed huge impact to the transportation system in country. This causes many problems especially when there are emergency cases at traffic light intersections which are always busy with many vehicles. A traffic light controller system is designed in order to solve these problems. This system was designed to be operated when it received signal from emergency vehicles based on radio frequency (RF) transmission and used the Programmable Integrated Circuit (PIC) 16F877A microcontroller to change the sequence back to the normal sequence before the emergency mode was triggered. This system will reduce accidents which often happen at the traffic light intersections because of other vehicle had to huddle for given a special route to emergency vehicle. As the result, this project successful analyzing and implementing the wireless communication; the radio frequency (RF) transmission in the traffic light control system for emergency vehicles. The prototype of this project is using the frequency of 434 MHz and function with the sequence mode of traffic light when emergency vehicles passing by an intersection and changing the sequence back to the normal sequence before the emergency mode was triggered. In future, this prototype system can be improved by controlling the real traffic situation, in fact improving present traffic light system technology.
The Ease of Doing Business Index as a tool for Investment location decisions
(2010)

The Ease of Doing Business Index (EDBI) uses 41 variables to compare the business environment of different countries. It is widely used by policy makers, researchers and multinational companies. This paper aims to assess EDBI’s consistency and validity in representing the business environment by using factor analysis. It is found that the EDBI presents a limited consistency and descriptive power of a country’s business environment. The consequence of these findings is that multinational firms should handle carefully the EDBI in their investment decisions. GEE The Ease of Doing Business Index as a tool for Investment location decisions – João Zambujal-Oliveira, Ricardo Pinheiro-Alves
Literature Review on Automatic Text Summarization: Single and Multiple Summarizations
(2015)

The online information available on world wide web is in enormous amount. Search engines like Google, Yahoo were developed to retrieve information from the databases. But actual results were not obtained as the electronic information is increasing day by day. Thus automatic summarization came into demand. Automatic summarization gathers several documents as input and provides the shorter summarized version as output which is informative, unambiguous, save valuable time. Research was done on a single document and moved towards multiple documents. This review categorizes single and multiple summarization methods.
AN OVERVIEW OF MASSIVE MIMO SYSTEM IN 5 G
(2016)

4G is proving good speeds up to 1Gbps. Then why do we need anything more. The problem is that it is not able to provide real time applications. 5G is the name given to the next generation of mobile data connectivity. It will definitely provide great speeds between 10Gbps to 100Gbps and it will have enough capacity. But the thing that separated 5G from 4G is latency; the latency provided by 4G is between 40ms to 60ms, whereas in 5G it will provide ultra latency between 1ms to 10ms. The standards for 5G will be set till 2020 and it will be applicable by 2022/23. In this paper we have discussed about 5G and its advantages, a probable architecture for 5G and some challenges in 5G. The main technology that maybe used in 5G are massive MIMO, millimetre wave communication, device to device communication, beam division multiple access etc. In this paper we have discussed about massive MIMO, channel estimate in massive MIMO, beam division multiple access technique to be used in massive MIMO, antenna selection in massive MIMO, capacity and energy efficiency in massive MIMO. In future 5G is going to be a technology which will be invisible, I will be just there everywhere just like electricity. It is a very good area for research as standards and frequency band for 5G are yet to be standardised.
Contextual Dueling Bandits
(2015)

We consider the problem of learning to choose actions using contextual information when provided with limited feedback in the form of relative pairwise comparisons. We study this problem in the dueling-bandits framework of Yue et al. (2009), which we extend to incorporate context. Roughly, the learner’s goal is to find the best policy, or way of behaving, in some space of policies, although “best” is not always so clearly defined. Here, we propose a new and natural solution concept, rooted in game theory, called a von Neumann winner, a randomized policy that beats or ties every other policy. We show that this notion overcomes important limitations of existing solutions, particularly the Condorcet winner which has typically been used in the past, but which requires strong and often unrealistic assumptions. We then present three efficient algorithms for online learning in our setting, and for approximating a von Neumann winner from batch-like data. The first of these algorithms achieves particularly low regret, even when data is adversarial, although its time and space requirements are linear in the size of the policy space. The other two algorithms require time and space only logarithmic in the size of the policy space when provided access to an oracle for solving classification problems on the space.
Beyond Slideware: How a Free-form Presentation Medium Stimulates Free-form Thinking in the Classroom
(2015)

We investigate how presentation in a free-form medium stimulates free-form thinking and discussion in the classroom. Most classroom presentations utilize slideware (e.g. PowerPoint). Yet, slides add intrusive segregations that obstruct the flow of information. In contrast, in a free-form medium of presentation, content is not separated into rigid slide compartments. Instead, it is visually arranged and transformed in a continuous space.
 We develop a case study that investigates student experiences authoring, presenting, viewing, and discussing free-form presentations in a graduate seminar class. We analyze interviews, present a sampling of student presentations, and develop findings: free-form presentation stimulates free-form thinking, spontaneous discussion, and emergent ideation.
Efficient Restoration Method for Images Corrupted with Impulse Noise
(2012)

This paper proposes a two-stage adaptive method for restoration of images corrupted with impulse noise. In the first stage, the pixels which are most likely contaminated by noise are detected based on their intensity values. In the second stage, an efficient average filtering algorithm is used to remove those noisy pixels from the image. Only pixels which are determined to be noisy in the first stage are processed in the second stage. The remaining pixels of the first stage are not processed further and are just copied to their corresponding locations in the restored image. The experimental results for the proposed method demonstrate that it is faster and simpler than even median filtering, and it is very efficient for images corrupted with a wide range of impulse noise densities varying from 10% to 90%. Because of its simplicity, high speed, and low computational complexity, the proposed method can be used in realtime digital image applications, e.g., in consumer electronic products such as digital televisions and cameras.
A Simple Parallel Algorithm for the Maximal Independent Set Problem
(1985)

Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial intelligence. One of the main contributions of this paper is the development of powerful and general techniques for converting Monte Carlo algorithms into deterministic algorithms. These techniques are used to convert the Monte Carlo algorithm for the MIS problem into a simple deterministic algorithm with the same parallel running time.
Interruptions on software teams: a comparison of paired and solo programmers
(2006)

This study explores interruption patterns among software developers who program in pairs versus those who program solo. Ethnographic observations indicate that interruption length, content, type, occurrence time, and interrupter and interruptee strategies differed markedly for radically collocated pair programmers versus the programmers who primarily worked alone. After presenting an analysis of 242 interruptions drawn from more than 40 hours of observation data, we discuss how team configuration and work setting influenced how and when developers handled interruptions. We then suggest ways that CSCW systems might better support pair programming and, more broadly, provide interruption-handling support for workers in knowledge-intensive occupations.
Metric Learning and Manifolds Metric Learning and Manifolds : Preserving the Intrinsic Geometry
(2017)

A variety of algorithms exist for performing non-linear dimension reduction, but these algorithms do not preserve the original geometry of the data except in special cases. In general, in the low-dimensional representations obtained, distances are distorted, as well as angles, areas, etc. This paper proposes a generic method to estimate the distortion incurred at each point of an embedding, and subsequently to correct distances and other intrinsic geometric quantities back to their original values (up to sampling noise). Our approach is based on augmenting the output of an embedding algorithm with geometric information embodied in the Riemannian metric of the manifold. The Riemannian metric allows one to compute geometric quantities (such as angle, length, or volume) for any coordinate system or embedding of the manifold. In this work, we provide an algorithm for estimating the Riemannian metric from data, consider its consistency, and demonstrate the uses of our approach in a variety of examples.
Toward preprototype user acceptance testing of new information systems: implications for software project management
(2004)

Errors in requirements specifications have been identified as a major contributor to costly software project failures. It would be highly beneficial if information systems developers could verify requirements by predicting workplace acceptance of a new system based on user evaluations of its specifications measured during the earliest stages of the development project, ideally before building a working prototype. However, conventional wisdom among system developers asserts that prospective users must have direct hands-on experience with at least a working prototype of a new system before they can provide assessments that accurately reflect future usage behavior after workplace implementation. The present research demonstrates that this assumption is only partially true. Specifically, it is true that stable and predictive assessments of a system's perceived ease of use should be based on direct behavioral experience using the system. However, stable and behaviorally predictive measures of perceived usefulness can be captured from target users who have received information about a system's functionality, but have not had direct hands-on usage experience. This distinction is key because, compared to ease of use, usefulness is generally much more strongly linked to future usage intentions and behaviors in the workplace. Two longitudinal field experiments show that preprototype usefulness measures can closely approximate hands-on based usefulness measures, and are significantly predictive of usage intentions and behavior up to six months after workplace implementation. The present findings open the door toward research on how user acceptance testing may be done much earlier in the system development process than has traditionally been the case. Such preprototype user acceptance tests have greater informational value than their postprototype counterparts because they are captured when only a relatively small proportion of project costs have been incurred and there is greater flexibility to modify a new system's design attributes. Implications are discussed for future research to confirm the robustness of the present findings and to better understand the practical potential and limitations of preprototype user acceptance testing.
Value co-creation between firms and customers: The role of big data-based cooperative assets
(2016)

To better understand how big data interconnects firms and customers in promoting value co-creation, we propose a theoretical framework of big data-based cooperative assets based on evidence of multiple case studies. We identify four types of big data resources and four types of associated digital platforms, and we explore how firms develop the cooperative assets by transforming big data resources via the theoretical lens of service-dominant logic. This study offers a new theoretical perspective on value co-creation and an alternative competitive strategy in the era of big data for firms. ã 2016 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
The TypTop System: Personalized Typo-Tolerant Password Checking
(2017)

Password checking systems traditionally allow login only if the correct password is submitted. Recent work on typo-tolerant password checking suggests that usability can be improved, with negligible security loss, by allowing a small number of typographical errors. Existing systems, however, can only correct a handful of errors, such as accidentally leaving caps lock on or incorrect capitalization of the first letter in a password. This leaves out numerous kinds of typos made by users, such as transposition errors, substitutions, or capitalization errors elsewhere in a password. Some users therefore receive no benefit from existing typo-tolerance mechanisms.
 We introduce personalized typo-tolerant password checking. In our approach, the authentication system learns over time the typos made by a specific user. In experiments using Mechanical Turk, we show that 45% of users would benefit from personalization. Therefore, we design a system, called TypTop, that securely implements personalized typo-tolerance. Underlying TypTop is a new stateful password-based encryption scheme that can be used to store recent failed login attempts. Our formal analysis shows that security in the face of an attacker that obtains the state of the system reduces to the difficulty of a brute-force dictionary attack against the real password. We implement TypTop for Linux and Mac OS login and report on a proof-of-concept deployment.
Markov Logic Networks for Natural Language Question Answering
(2015)

Our goal is to answer elementary-level science questions using knowledge extracted automatically from science textbooks, expressed in a subset of first-order logic. Given the incomplete and noisy nature of these automatically extracted rules, Markov Logic Networks (MLNs) seem a natural model to use, but the exact way of leveraging MLNs is by no means obvious. We investigate three ways of applying MLNs to our task. In the first, we simply use the extracted science rules directly as MLN clauses. Unlike typical MLN applications, our domain has long and complex rules, leading to an unmanageable number of groundings. We exploit the structure present in hard constraints to improve tractability, but the formulation remains ineffective. In the second approach, we instead interpret science rules as describing prototypical entities, thus mapping rules directly to grounded MLN assertions, whose constants are then clustered using existing entity resolution methods. This drastically simplifies the network, but still suffers from brittleness. Finally, our third approach, called Praline, uses MLNs to align the lexical elements as well as define and control how inference should be performed in this task. Our experiments, demonstrating a 15% accuracy boost and a 10x reduction in runtime, suggest that the flexibility and different inference semantics of Praline are a better fit for the natural language question answering task.
The Acquisition , Transfer , and Depreciation of Knowledge in Service Organizations : Productivity in Franchises
(2008)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.