OpenRaiser/Intern-Atlas huggingface dataset:
Bi-modal First Impressions Recognition using Temporally Ordered Deep Audio and Stochastic Visual Features
Venue: arXiv cs.CV 2016
Year: 2016

We propose a novel approach for First Impressions Recognition in terms of the Big Five personality-traits from short videos. The Big Five personality traits is a model to describe human personality using five broad categories: Extraversion, Agreeableness, Conscientiousness, Neuroticism and Openness. We train two bi-modal end-to-end deep neural network architectures using temporally ordered audio and novel stochastic visual features from few frames, without over-fitting. We empirically show that the trained models perform exceptionally well, even after training from a small sub-portions of inputs. Our method is evaluated in ChaLearn LAP 2016 Apparent Personality Analysis (APA) competition using ChaLearn LAP APA2016 dataset and achieved excellent performance.
On Regulatory and Organizational Constraints in Visualization Design and Evaluation
Venue: arXiv cs.HC 2016
Year: 2016

Problem-based visualization research provides explicit guidance toward identifying and designing for the needs of users, but absent is more concrete guidance toward factors external to a user's needs that also have implications for visualization design and evaluation. This lack of more explicit guidance can leave visualization researchers and practitioners vulnerable to unforeseen constraints beyond the user's needs that can affect the validity of evaluations, or even lead to the premature termination of a project. Here we explore two types of external constraints in depth, regulatory and organizational constraints, and describe how these constraints impact visualization design and evaluation. By borrowing from techniques in software development, project management, and visualization research we recommend strategies for identifying, mitigating, and evaluating these external constraints through a design study methodology. Finally, we present an application of those recommendations in a healthcare case study. We argue that by explicitly incorporating external constraints into visualization design and evaluation, researchers and practitioners can improve the utility and validity of their visualization solution and improve the likelihood of successful collaborations with industries where external constraints are more present.
Optimal Signaling for Secure Communications over Gaussian MIMO Wiretap Channels
Venue: arXiv cs.IT 2016
Year: 2016

Optimal signalling over the Gaussian MIMO wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obtained when the channel is strictly degraded. In combination with the rank-1 solution, this provides the complete characterization of the optimal covariance for the case of two transmit antennas. The cases of weak eavesdropper and high SNR are considered. It is shown that the optimal covariance does not converge to a scaled identity in the high-SNR regime. Necessary optimality conditions and a tight upper bound on the rank of an optimal covariance matrix are established for the general case, along with a lower bound to the secrecy capacity, which is tight in a number of scenarios.
LAST but not Least: Online Spanners for Buy-at-Bulk
Venue: arXiv cs.DS 2016
Year: 2016

The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-costs exhibit economy-of-scale. Previous approaches to this problem used tree- embeddings, giving us randomized algorithms. Moreover, the optimal results with a logarithmic competitive ratio requires the metric on which the network is being built to be known up-front; the competitive ratios then depend on the size of this metric (which could be much larger than the number of terminals that arrive). We consider the buy-at-bulk problem in the least restrictive model where the metric is not known in advance, but revealed in parts along with the demand points seeking connectivity arriving online. For the single sink buy-at-bulk problem, we give a deterministic online algorithm with competitive ratio that is logarithmic in k, the number of terminals that have arrived, matching the lower bound known even for the online Steiner tree problem. In the oblivious case when the buy-at-bulk function used to compute the edge-costs of the network is not known in advance (but is the same across all edges), we give a deterministic algorithm with competitive ratio polylogarithmic in k, the number of terminals. At the heart of our algorithms are optimal constructions for online Light Approximate Shortest-path Trees (LASTs) and spanners, and their variants. We give constructions that have optimal trade-offs in terms of cost and stretch. We also define and give constructions for a new notion of LASTs where the set of roots (in addition to the points) expands over time. We expect these techniques will find applications in other online network-design problems.
Application Specific Instrumentation (ASIN): A Bio-inspired Paradigm to Instrumentation using recognition before detection
Venue: arXiv cs.OH 2016
Year: 2016

In this paper we present a new scheme for instrumentation, which has been inspired by the way small mammals sense their environment. We call this scheme Application Specific Instrumentation (ASIN). A conventional instrumentation system focuses on gathering as much information about the scene as possible. This, usually, is a generic system whose data can be used by another system to take a specific action. ASIN fuses these two steps into one. The major merit of the proposed scheme is that it uses low resolution sensors and much less computational overhead to give good performance for a highly specialised application
Opportunistic Advertisement Scheduling in Live Social Media: A Multiple Stopping Time POMDP Approach
Venue: arXiv cs.SI 2016
Year: 2016

Live online social broadcasting services like YouTube Live and Twitch have steadily gained popularity due to improved bandwidth, ease of generating content and the ability to earn revenue on the generated content. In contrast to traditional cable television, revenue in online services is generated solely through advertisements, and depends on the number of clicks generated. Channel owners aim to opportunistically schedule advertisements so as to generate maximum revenue. This paper considers the problem of optimal scheduling of advertisements in live online social media. The problem is formulated as a multiple stopping problem and is addressed in a partially observed Markov decision process (POMDP) framework. Structural results are provided on the optimal advertisement scheduling policy. By exploiting the structure of the optimal policy, best linear thresholds are computed using stochastic approximation. The proposed model and framework are validated on real datasets, and the following observations are made: (i) The policy obtained by the multiple stopping problem can be used to detect changes in ground truth from online search data (ii) Numerical results show a significant improvement in the expected revenue by opportunistically scheduling the advertisements. The revenue can be improved by $20-30\%$ in comparison to currently employed periodic scheduling.
StegHash: New Method for Information Hiding in Open Social Networks
Venue: arXiv cs.CR 2016
Year: 2016

In this paper a new method for information hiding in open social networks is introduced. The method, called StegHash, is based on the use of hashtags in various open social networks to connect multimedia files (like images, movies, songs) with embedded hidden messages. The evaluation of the system was performed on two social media services (Twitter and Instagram) with a simple environment as a proof of concept. The experiments proved that the initial idea was correct, thus the proposed system could create a completely new area of threats in social networks.
Overview of Spintronic Sensors, Internet of Things, and Smart Living
Venue: arXiv cs.OH 2016
Year: 2016

Smart living is a trending lifestyle that envisions lower energy consumption, sound public services, and better quality of life for human being. The Internet of Things (IoT) is a compelling platform connecting various sensors around us to the Internet, providing great opportunities for the realization of smart living. Spintronic sensors with superb measuring ability and multiple unique advantages can be an important piece of cornerstone for IoT. In this review, we discuss successful applications of spintronic sensors in electrical current sensing, transmission and distribution lines monitoring, vehicle detection, and biodetection. Traditional monitoring systems with limited sensors and wired communication can merely collect fragmented data in the application domains. In this paper, the wireless spintronic sensor networks (WSSNs) will be proposed and illustrated to provide pervasive monitoring systems, which facilitate the intelligent surveillance and management over building, power grid, transport, and healthcare. The database of collected information will be of great use to the policy making in public services and city planning. This work provides insights for realizing smart living through the integration of IoT with spintronic sensor technology.
On Event Reduction in Localization of DES Supervisory Control
Venue: arXiv cs.SY 2016
Year: 2016

Supervisor localization procedure can be used to construct local controllers corresponding to each component agent in discrete-event systems. This procedure is based on state reduction of a monolithic supervisor with respect to each set of controllable events corresponding to each component agent. State reduction from the reduced supervisor to each local controller is an important criterion. In this paper, we deal with event reduction. It is proved that the number of events in each local controller is less than the event cardinality in the reduced supervisor, provided that each local controller has less number of states comparing to the reduced supervisor. It shows that each local controller needs less number of events to make consistent decisions. Having this property, we can evaluate the localizability of a supervisor by event reduction criteria instead of state reduction criteria. State reduction facilitates the implementation of local controllers on industrial systems. Whereas, event reduction reduces communication traffic between each pair of local controllers.
Faster decoding for subword level Phrase-based SMT between related languages
Venue: arXiv cs.CL 2016
Year: 2016

A common and effective way to train translation systems between related languages is to consider sub-word level basic units. However, this increases the length of the sentences resulting in increased decoding time. The increase in length is also impacted by the specific choice of data format for representing the sentences as subwords. In a phrase-based SMT framework, we investigate different choices of decoder parameters as well as data format and their impact on decoding time and translation accuracy. We suggest best options for these settings that significantly improve decoding time with little impact on the translation accuracy.
Using Artificial Intelligence to Identify State Secrets
Venue: arXiv cs.CY 2016
Year: 2016

Whether officials can be trusted to protect national security information has become a matter of great public controversy, reigniting a long-standing debate about the scope and nature of official secrecy. The declassification of millions of electronic records has made it possible to analyze these issues with greater rigor and precision. Using machine-learning methods, we examined nearly a million State Department cables from the 1970s to identify features of records that are more likely to be classified, such as international negotiations, military operations, and high-level communications. Even with incomplete data, algorithms can use such features to identify 90% of classified cables with <11% false positives. But our results also show that there are longstanding problems in the identification of sensitive information. Error analysis reveals many examples of both overclassification and underclassification. This indicates both the need for research on inter-coder reliability among officials as to what constitutes classified material and the opportunity to develop recommender systems to better manage both classification and declassification.
A High Throughput Pilot Allocation for M2M Communication in Crowded Massive MIMO Systems
Venue: arXiv cs.IT 2016
Year: 2016

A new scheme to resolve the intra-cell pilot collision for M2M communication in crowded massive multiple-input multiple-output (MIMO) systems is proposed. The proposed scheme permits those failed user equipments (UEs), judged by a strongest-user collision resolution (SUCR) protocol, to contend for the idle pilots, i.e., the pilots that are not selected by any UE in the initial step. This scheme is called as SUCR combined idle pilots access (SUCR-IPA). To analyze the performance of the SUCR-IPA scheme, we develop a simple method to compute the access success probability of the UEs in each random access slot (RAST). The simulation results coincide well with the analysis. It is also shown that, compared to the SUCR protocol, the proposed SUCR-IPA scheme increases the throughput of the system significantly, and thus decreases the number of access attempts dramatically.
Modal Analysis of Masonry Structures
Venue: arXiv cs.CE 2016
Year: 2016

This paper presents a new numerical procedure for evaluating the vibration frequencies and mode shapes of masonry buildings in the presence of cracks. The algorithm has been implemented within the NOSA-ITACA code, which models masonry as a nonlinear elastic material with zero tensile strength. Some case studies are reported, and the differences between linear and nonlinear behavior highlighted.
Hybrid CPU-GPU generation of the Hamiltonian and Overlap matrices in FLAPW methods
Venue: arXiv cs.CE 2016
Year: 2016

In this paper we focus on the integration of high-performance numerical libraries in ab initio codes and the portability of performance and scalability. The target of our work is FLEUR, a software for electronic structure calculations developed in the Forschungszentrum Jülich over the course of two decades. The presented work follows up on a previous effort to modernize legacy code by re-engineering and rewriting it in terms of highly optimized libraries. We illustrate how this initial effort to get efficient and portable shared-memory code enables fast porting of the code to emerging heterogeneous architectures. More specifically, we port the code to nodes equipped with multiple GPUs. We divide our study in two parts. First, we show considerable speedups attained by minor and relatively straightforward code changes to off-load parts of the computation to the GPUs. Then, we identify further possible improvements to achieve even higher performance and scalability. On a system consisting of 16-cores and 2 GPUs, we observe speedups of up to 5x with respect to our optimized shared-memory code, which in turn means between 7.5x and 12.5x speedup with respect to the original FLEUR code.
Engagement dynamics and sensitivity analysis of YouTube videos
Venue: arXiv cs.SI 2016
Year: 2016

YouTube, with millions of content creators, has become the preferred destination for watching videos online. Through the Partner program, YouTube allows content creators to monetize their popular videos. Of significant importance for content creators is which meta-level features (e.g. title, tag, thumbnail) are most sensitive for promoting video popularity. The popularity of videos also depends on the social dynamics, i.e. the interaction of the content creators (or channels) with YouTube users. Using real-world data consisting of about 6 million videos spread over 25 thousand channels, we empirically examine the sensitivity of YouTube meta-level features and social dynamics. The key meta-level features that impact the view counts of a video include: first day view count , number of subscribers, contrast of the video thumbnail, Google hits, number of keywords, video category, title length, and number of upper-case letters in the title respectively and illustrate that these meta-level features can be used to estimate the popularity of a video. In addition, optimizing the meta-level features after a video is posted increases the popularity of videos. In the context of social dynamics, we discover that there is a causal relationship between views to a channel and the associated number of subscribers. Additionally, insights into the effects of scheduling and video playthrough in a channel are also provided. Our findings provide a useful understanding of user engagement in YouTube.
A Novel Hybrid Beamforming Algorithm with Unified Analog Beamforming by Subspace Construction Based on Partial CSI for Massive MIMO-OFDM Systems
Venue: arXiv cs.IT 2016
Year: 2016

Hybrid beamforming (HB) has been widely studied for reducing the number of costly radio frequency (RF) chains in massive multiple-input multiple-output (MIMO) systems. However, previous works on HB are limited to a single user equipment (UE) or a single group of UEs, employing the frequency-flat first-level analog beamforming (AB) that cannot be applied to multiple groups of UEs served in different frequency resources in an orthogonal frequency-division multiplexing (OFDM) system. In this paper, a novel HB algorithm with unified AB based on the spatial covariance matrix (SCM) knowledge of all UEs is proposed for a massive MIMO-OFDM system in order to support multiple groups of UEs. The proposed HB method with a much smaller number of RF chains can achieve more than 95% performance of full digital beamforming. In addition, a novel practical subspace construction (SC) algorithm based on partial channel state information is proposed to estimate the required SCM. The proposed SC method can offer more than 97% performance of the perfect SCM case. With the proposed methods, significant cost and power savings can be achieved without large loss in performance. Furthermore, the proposed methods can be applied to massive MIMO-OFDM systems in both time-division duplex and frequency-division duplex.
Optical Flow Estimation using a Spatial Pyramid Network
Venue: arXiv cs.CV 2016
Year: 2016

We learn to compute optical flow by combining a classical spatial-pyramid formulation with deep learning. This estimates large motions in a coarse-to-fine approach by warping one image of a pair at each pyramid level by the current flow estimate and computing an update to the flow. Instead of the standard minimization of an objective function at each pyramid level, we train one deep network per level to compute the flow update. Unlike the recent FlowNet approach, the networks do not need to deal with large motions; these are dealt with by the pyramid. This has several advantages. First, our Spatial Pyramid Network (SPyNet) is much simpler and 96% smaller than FlowNet in terms of model parameters. This makes it more efficient and appropriate for embedded applications. Second, since the flow at each pyramid level is small (< 1 pixel), a convolutional approach applied to pairs of warped images is appropriate. Third, unlike FlowNet, the learned convolution filters appear similar to classical spatio-temporal filters, giving insight into the method and how to improve it. Our results are more accurate than FlowNet on most standard benchmarks, suggesting a new direction of combining classical flow methods with deep learning.
HPVM: A Portable Virtual Instruction Set for Heterogeneous Parallel Systems
Venue: arXiv cs.PL 2016
Year: 2016

We describe a programming abstraction for heterogeneous parallel hardware, designed to capture a wide range of popular parallel hardware, including GPUs, vector instruction sets and multicore CPUs. Our abstraction, which we call HPVM, is a hierarchical dataflow graph with shared memory and vector instructions. We use HPVM to define both a virtual instruction set (ISA) and also a compiler intermediate representation (IR). The virtual ISA aims to achieve both functional portability and performance portability across heterogeneous systems, while the compiler IR aims to enable effective code generation and optimization for such systems. HPVM effectively supports all forms of parallelism used to achieve computational speedups (as opposed to concurrency), including task parallelism, coarse-grain data parallelism, fine-grain data parallelism, and pipelined parallelism. HPVM also enables flexible scheduling and tiling: different nodes in the dataflow graph can be mapped flexibly to different combinations of compute units, and the graph hierarchy expresses memory tiling, essential for achieving high performance on GPU and CPU targets.
A Dichotomy for Regular Expression Membership Testing
Venue: arXiv cs.DS 2016
Year: 2016

We study regular expression membership testing: Given a regular expression of size $m$ and a string of size $n$, decide whether the string is in the language described by the regular expression. Its classic $O(nm)$ algorithm is one of the big success stories of the 70s, which allowed pattern matching to develop into the standard tool that it is today. Many special cases of pattern matching have been studied that can be solved faster than in quadratic time. However, a systematic study of tractable cases was made possible only recently, with the first conditional lower bounds reported by Backurs and Indyk [FOCS'16]. Restricted to any "type" of homogeneous regular expressions of depth 2 or 3, they either presented a near-linear time algorithm or a quadratic conditional lower bound, with one exception known as the Word Break problem. In this paper we complete their work as follows: 1) We present two almost-linear time algorithms that generalize all known almost-linear time algorithms for special cases of regular expression membership testing. 2) We classify all types, except for the Word Break problem, into almost-linear time or quadratic time assuming the Strong Exponential Time Hypothesis. This extends the classification from depth 2 and 3 to any constant depth. 3) For the Word Break problem we give an improved $\tilde{O}(n m^{1/3} + m)$ algorithm. Surprisingly, we also prove a matching conditional lower bound for combinatorial algorithms. This establishes Word Break as the only intermediate problem. In total, we prove matching upper and lower bounds for any type of bounded-depth homogeneous regular expressions, which yields a full dichotomy for regular expression membership testing.
Frame Theory for Signal Processing in Psychoacoustics
Venue: arXiv cs.SD 2016
Year: 2016

This review chapter aims to strengthen the link between frame theory and signal processing tasks in psychoacoustics. On the one side, the basic concepts of frame theory are presented and some proofs are provided to explain those concepts in some detail. The goal is to reveal to hearing scientists how this mathematical theory could be relevant for their research. In particular, we focus on frame theory in a filter bank approach, which is probably the most relevant view-point for audio signal processing. On the other side, basic psychoacoustic concepts are presented to stimulate mathematicians to apply their knowledge in this field.