OpenRaiser/Intern-Atlas huggingface dataset:
Bringing Back-in-Time Debugging Down to the Database
Venue: arXiv cs.SE 2017
Year: 2017

With back-in-time debuggers, developers can explore what happened before observable failures by following infection chains back to their root causes. While there are several such debuggers for object-oriented programming languages, we do not know of any back-in-time capabilities at the database-level. Thus, if failures are caused by SQL scripts or stored procedures, developers have difficulties in understanding their unexpected behavior. In this paper, we present an approach for bringing back-in-time debugging down to the SAP HANA in-memory database. Our TARDISP debugger allows developers to step queries backwards and inspecting the database at previous and arbitrary points in time. With the help of a SQL extension, we can express queries covering a period of execution time within a debugging session and handle large amounts of data with low overhead on performance and memory. The entire approach has been evaluated within a development project at SAP and shows promising results with respect to the gathered developer feedback.
Fuzzy Ontology-Based Sentiment Analysis of Transportation and City Feature Reviews for Safe Traveling
Venue: arXiv cs.AI 2017
Year: 2017

Traffic congestion is rapidly increasing in urban areas, particularly in mega cities. To date, there exist a few sensor network based systems to address this problem. However, these techniques are not suitable enough in terms of monitoring an entire transportation system and delivering emergency services when needed. These techniques require real-time data and intelligent ways to quickly determine traffic activity from useful information. In addition, these existing systems and websites on city transportation and travel rely on rating scores for different factors (e.g., safety, low crime rate, cleanliness, etc.). These rating scores are not efficient enough to deliver precise information, whereas reviews or tweets are significant, because they help travelers and transportation administrators to know about each aspect of the city. However, it is difficult for travelers to read, and for transportation systems to process, all reviews and tweets to obtain expressive sentiments regarding the needs of the city. The optimum solution for this kind of problem is analyzing the information available on social network platforms and performing sentiment analysis. On the other hand, crisp ontology-based frameworks cannot extract blurred information from tweets and reviews; therefore, they produce inadequate results. In this regard, this paper proposes fuzzy ontology-based sentiment analysis and SWRL rule-based decision-making to monitor transportation activities and to make a city- feature polarity map for travelers. This system retrieves reviews and tweets related to city features and transportation activities. The feature opinions are extracted from these retrieved data, and then fuzzy ontology is used to determine the transportation and city-feature polarity. A fuzzy ontology and an intelligent system prototype are developed by using Protégé OWL and Java, respectively.
Measurement and Analysis of Quality of Service of Mobile Networks in Afghanistan End User Perspective
Venue: arXiv cs.NI 2017
Year: 2017

Enhanced Quality of Service (QoS) and satisfaction of mobile phone user are major concerns of a service provider. In order to manage network efficiently and to provide enhanced end to end Quality of Experience (QoE), operator is expected to measure and analyze QoS from various perspectives and at different relevant points of network. The scope of this paper is measurement and statistically analysis of QoS of mobile networks from end user perspective in Afghanistan. The study is based on primary data collected on random basis from 1,515 mobile phone users of five cellular operators. The paper furthermore proposes adequate technical solutions to mobile operators in order to address existing challenges in the area of QoS and to remain competitive in the market. Based on the result of processed data, considering geographical locations, population and telecom regulations of the government, authors recommend deployment of small cells (SCs), increasing number of regular performance tests, optimal placement of base stations, increasing number of carriers, and high order sectorization as proposed technical solutions.
A task-driven implementation of a simple numerical solver for hyperbolic conservation laws
Venue: arXiv cs.DC 2017
Year: 2017

This article describes the implementation of an all-in-one numerical procedure within the runtime StarPU. In order to limit the complexity of the method, for the sake of clarity of the presentation of the non-classical task-driven programming environnement, we have limited the numerics to first order in space and time. Results show that the task distribution is efficient if the tasks are numerous and individually large enough so that the task heap can be saturated by tasks which computational time covers the task management overhead. Next, we also see that even though they are mostly faster on graphic cards, not all the tasks are suitable for GPUs, which brings forward the importance of the task scheduler. Finally, we look at a more realistic system of conservation laws with an expensive source term, what allows us to conclude and open on future works involving higher local arithmetic intensity, by increasing the order of the numerical method or by enriching the model (increased number of parameters and therefore equations).
A Novel Multi-Secret Sharing Approach for Secure Data Warehousing and On-Line Analysis Processing in the Cloud
Venue: arXiv cs.DB 2017
Year: 2017

Cloud computing helps reduce costs, increase business agility and deploy solutions with a high return on investment for many types of applications, including data warehouses and on-line analytical processing. However, storing and transferring sensitive data into the cloud raises legitimate security concerns. In this paper, we propose a new multi-secret sharing approach for deploying data warehouses in the cloud and allowing on-line analysis processing, while enforcing data privacy, integrity and availability. We first validate the relevance of our approach theoretically and then experimentally with both a simple random dataset and the Star Schema Benchmark. We also demonstrate its superiority to related methods.
Healing Data Loss Problems in Android Apps
Venue: arXiv cs.SE 2017
Year: 2017

Android apps should be designed to cope with stop-start events, which are the events that require stopping and restoring the execution of an app while leaving its state unaltered. These events can be caused by run-time configuration changes, such as a screen rotation, and by context-switches, such as a switch from one app to another. When a stop-start event occurs, Android saves the state of the app, handles the event, and finally restores the saved state. To let Android save and restore the state correctly, apps must provide the appropriate support. Unfortunately, Android developers often implement this support incorrectly, or do not implement it at all. This bad practice makes apps to incorrectly react to stop-start events, thus generating what we defined data loss problems, that is Android apps that lose user data, behave unexpectedly, and crash due to program variables that lost their values. Data loss problems are difficult to detect because they might be observed only when apps are in specific states and with specific inputs. Covering all the possible cases with testing may require a large number of test cases whose execution must be checked manually to discover whether the app under test has been correctly restored after each stop-start event. It is thus important to complement traditional in-house testing activities with mechanisms that can protect apps as soon as a data loss problem occurs in the field. In this paper we present DataLossHealer, a technique for automatically identifying and healing data loss problems in the field as soon as they occur. DataLossHealer is a technique that checks at run-time whether states are recovered correctly, and heals the app when needed. DataLossHealer can learn from experience, incrementally reducing the overhead that is introduced avoiding to monitor interactions that have been managed correctly by the app in the past.
Techniques for Dealing with Uncertainty in Cognitive Radio Networks
Venue: arXiv cs.IT 2017
Year: 2017

A cognitive radio system has the ability to observe and learn from the environment, adapt to the environmental conditions, and use the radio spectrum more efficiently. However, due to multipath fading, shadowing, or varying channel conditions, uncertainty affects the cognitive cycle processes, measurements, decisions, and actions. In the observing step, measurements (i.e., information) taken by the secondary users (SUs) are uncertain. In the next step, the SUs make decisions based on what has already been observed using their knowledge bases, which may have been impacted by the uncertainty, leading to wrong decisions. In the last step, uncertainty can affect the decision of the cognitive radio system, which sometimes can lead to the wrong action. Thus, the uncertainty propagation influences the cognitive radio performance. Therefore, mitigating the uncertainty in the cognitive cycle is a necessity. This paper provides a deep overview of techniques that handle uncertainty in cognitive radio networks.
Harnessing Cognitive Features for Sarcasm Detection
Venue: arXiv cs.CL 2017
Year: 2017

In this paper, we propose a novel mechanism for enriching the feature vector, for the task of sarcasm detection, with cognitive features extracted from eye-movement patterns of human readers. Sarcasm detection has been a challenging research problem, and its importance for NLP applications such as review summarization, dialog systems and sentiment analysis is well recognized. Sarcasm can often be traced to incongruity that becomes apparent as the full sentence unfolds. This presence of incongruity- implicit or explicit- affects the way readers eyes move through the text. We observe the difference in the behaviour of the eye, while reading sarcastic and non sarcastic sentences. Motivated by his observation, we augment traditional linguistic and stylistic features for sarcasm detection with the cognitive features obtained from readers eye movement data. We perform statistical classification using the enhanced feature set so obtained. The augmented cognitive features improve sarcasm detection by 3.7% (in terms of F-score), over the performance of the best reported system.
Fast and Efficient Skin Detection for Facial Detection
Venue: arXiv cs.CV 2017
Year: 2017

In this paper, an efficient skin detection system is proposed. The algorithm is based on a very fast efficient pre-processing step utilizing the concept of ternary conversion in order to identify candidate windows and subsequently, a novel local two-stage diffusion method which has F-score accuracy of 0.5978 on SDD dataset. The pre-processing step has been proven to be useful to boost the speed of the system by eliminating 82% of an image in average. This is obtained by keeping the true positive rate above 98%. In addition, a novel segmentation algorithm is also designed to process candidate windows which is quantitatively and qualitatively proven to be very efficient in term of accuracy. The algorithm has been implemented in FPGA to obtain real-time processing speed. The system is designed fully pipeline and the inherent parallel structure of the algorithm is fully exploited to maximize the performance. The system is implemented on a Spartan-6 LXT45 Xilinx FPGA and it is capable of processing 98 frames of 640*480 24-bit color images per second.
Energy-efficient Analog Sensing for Large-scale, High-density Persistent Wireless Monitoring
Venue: arXiv cs.NI 2017
Year: 2017

The research challenge of current Wireless Sensor Networks~(WSNs) is to design energy-efficient, low-cost, high-accuracy, self-healing, and scalable systems for applications such as environmental monitoring. Traditional WSNs consist of low density, power-hungry digital motes that are expensive and cannot remain functional for long periods on a single charge. In order to address these challenges, a \textit{dumb-sensing and smart-processing} architecture that splits sensing and computation capabilities among tiers is proposed. Tier-1 consists of dumb sensors that only sense and transmit, while the nodes in Tier-2 do all the smart processing on Tier-1 sensor data. A low-power and low-cost solution for Tier-1 sensors has been proposed using Analog Joint Source Channel Coding~(AJSCC). An analog circuit that realizes the rectangular type of AJSCC has been proposed and realized on a Printed Circuit Board for feasibility analysis. A prototype consisting of three Tier-1 sensors (sensing temperature and humidity) communicating to a Tier-2 Cluster Head has been demonstrated to verify the proposed approach. Results show that our framework is indeed feasible to support large scale high density and persistent WSN deployment.
Towards the Assessment of Stress and Emotional Responses of a Salutogenesis-Enhanced Software Tool Using Psychophysiological Measurements
Venue: arXiv cs.SE 2017
Year: 2017

Software development is intellectual, based on collaboration, and performed in a highly demanding economic market. As such, it is dominated by time pressure, stress, and emotional trauma. While studies of affect are emerging and rising in software engineering research, stress has yet to find its place in the literature despite that it is highly related to affect. In this paper, we study stress coping with the affect-laden framework of Salutogenesis, which is a validated psychological framework for enhancing mental health through a feeling of coherence. We propose a controlled experiment for testing our hypotheses that a static analysis tool enhanced with the Salutogenesis model will bring 1) a higher number of fixed quality issues, 2) reduced cognitive load, 3) reduction of the overall stress, and 4) positive affect induction effects to developers. The experiment will make use of validated physiological measurements of stress as proxied by cortisol and alpha-amylase levels in saliva samples, a psychometrically validated measurement of mood and affect disposition, and stress inductors such as a cognitive load task. Our hypotheses, if empirically supported, will lead to the creation of environments, methods, and tools that alleviate stress among developers while enhancing affect on the job and task performance.
Two Evidential Data Based Models for Influence Maximization in Twitter
Venue: arXiv cs.SI 2017
Year: 2017

Influence maximization is the problem of selecting a set of influential users in the social network. Those users could adopt the product and trigger a large cascade of adoptions through the " word of mouth " effect. In this paper, we propose two evidential influence maximization models for Twitter social network. The proposed approach uses the theory of belief functions to estimate users influence. Furthermore, the proposed influence estimation measure fuses many influence aspects in Twitter, like the importance of the user in the network structure and the popularity of user's tweets (messages). In our experiments, we compare the proposed solutions to existing ones and we show the performance of our models.
Random Caching Based Cooperative Transmission in Heterogeneous Wireless Networks
Venue: arXiv cs.IT 2017
Year: 2017

Base station cooperation in heterogeneous wireless networks (HetNets) is a promising approach to improve the network performance, but it also imposes a significant challenge on backhaul. On the other hand, caching at small base stations (SBSs) is considered as an efficient way to reduce backhaul load in HetNets. In this paper, we jointly consider SBS caching and cooperation in a downlink largescale HetNet. We propose two SBS cooperative transmission schemes under random caching at SBSs with the caching distribution as a design parameter. Using tools from stochastic geometry and adopting appropriate integral transformations, we first derive a tractable expression for the successful transmission probability under each scheme. Then, under each scheme, we consider the successful transmission probability maximization by optimizing the caching distribution, which is a challenging optimization problem with a non-convex objective function. By exploring optimality properties and using optimization techniques, under each scheme, we obtain a local optimal solution in the general case and global optimal solutions in some special cases. Compared with some existing caching designs in the literature, e.g., the most popular caching, the i.i.d. caching and the uniform caching, the optimal random caching under each scheme achieves better successful transmission probability performance. The analysis and optimization results provide valuable design insights for practical HetNets.
BigDAWG Polystore Release and Demonstration
Venue: arXiv cs.DB 2017
Year: 2017

The Intel Science and Technology Center for Big Data is developing a reference implementation of a Polystore database. The BigDAWG (Big Data Working Group) system supports "many sizes" of database engines, multiple programming languages and complex analytics for a variety of workloads. Our recent efforts include application of BigDAWG to an ocean metagenomics problem and containerization of BigDAWG. We intend to release an open source BigDAWG v1.0 in the Spring of 2017. In this article, we will demonstrate a number of polystore applications developed with oceanographic researchers at MIT and describe our forthcoming open source release of the BigDAWG system.
Integration of Preferences in Decomposition Multi-Objective Optimization
Venue: arXiv cs.NE 2017
Year: 2017

Most existing studies on evolutionary multi-objective optimization focus on approximating the whole Pareto-optimal front. Nevertheless, rather than the whole front, which demands for too many points (especially in a high-dimensional space), the decision maker might only interest in a partial region, called the region of interest. In this case, solutions outside this region can be noisy to the decision making procedure. Even worse, there is no guarantee that we can find the preferred solutions when tackling problems with complicated properties or a large number of objectives. In this paper, we develop a systematic way to incorporate the decision maker's preference information into the decomposition-based evolutionary multi-objective optimization methods. Generally speaking, our basic idea is a non-uniform mapping scheme by which the originally uniformly distributed reference points on a canonical simplex can be mapped to the new positions close to the aspiration level vector specified by the decision maker. By these means, we are able to steer the search process towards the region of interest either directly or in an interactive manner and also handle a large number of objectives. In the meanwhile, the boundary solutions can be approximated given the decision maker's requirements. Furthermore, the extent of the region of the interest is intuitively understandable and controllable in a closed form. Extensive experiments, both proof-of-principle and on a variety of problems with 3 to 10 objectives, fully demonstrate the effectiveness of our proposed method for approximating the preferred solutions in the region of interest.
Distributed Random-Fixed Projected Algorithm for Constrained Optimization Over Digraphs
Venue: arXiv cs.DC 2017
Year: 2017

This paper is concerned with a constrained optimization problem over a directed graph (digraph) of nodes, in which the cost function is a sum of local objectives, and each node only knows its local objective and constraints. To collaboratively solve the optimization, most of the existing works require the interaction graph to be balanced or "doubly-stochastic", which is quite restrictive and not necessary as shown in this paper. We focus on an epigraph form of the original optimization to resolve the "unbalanced" problem, and design a novel two-step recursive algorithm with a simple structure. Under strongly connected digraphs, we prove that each node asymptotically converges to some common optimal solution. Finally, simulations are performed to illustrate the effectiveness of the proposed algorithms.
ARM Wrestling with Big Data: A Study of Commodity ARM64 Server for Big Data Workloads
Venue: arXiv cs.DC 2017
Year: 2017

ARM processors have dominated the mobile device market in the last decade due to their favorable computing to energy ratio. In this age of Cloud data centers and Big Data analytics, the focus is increasingly on power efficient processing, rather than just high throughput computing. ARM's first commodity server-grade processor is the recent AMD A1100-series processor, based on a 64-bit ARM Cortex A57 architecture. In this paper, we study the performance and energy efficiency of a server based on this ARM64 CPU, relative to a comparable server running an AMD Opteron 3300-series x64 CPU, for Big Data workloads. Specifically, we study these for Intel's HiBench suite of web, query and machine learning benchmarks on Apache Hadoop v2.7 in a pseudo-distributed setup, for data sizes up to $20GB$ files, $5M$ web pages and $500M$ tuples. Our results show that the ARM64 server's runtime performance is comparable to the x64 server for integer-based workloads like Sort and Hive queries, and only lags behind for floating-point intensive benchmarks like PageRank, when they do not exploit data parallelism adequately. We also see that the ARM64 server takes $\frac{1}{3}^{rd}$ the energy, and has an Energy Delay Product (EDP) that is $50-71\%$ lower than the x64 server. These results hold promise for ARM64 data centers hosting Big Data workloads to reduce their operational costs, while opening up opportunities for further analysis.
Applying empirical software engineering to software architecture: challenges and lessons learned
Venue: arXiv cs.SE 2017
Year: 2017

In the last 15 years, software architecture has emerged as an important software engineering field for managing the development and maintenance of large, software- intensive systems. Software architecture community has developed numerous methods, techniques, and tools to support the architecture process (analysis, design, and review). Historically, most advances in software architecture have been driven by talented people and industrial experience, but there is now a growing need to systematically gather empirical evidence about the advantages or otherwise of tools and methods rather than just rely on promotional anecdotes or rhetoric. The aim of this paper is to promote and facilitate the application of the empirical paradigm to software architecture. To this end, we describe the challenges and lessons learned when assessing software architecture research that used controlled experiments, replications, expert opinion, systematic literature reviews, obser- vational studies, and surveys. Our research will support the emergence of a body of knowledge consisting of the more widely-accepted and well-formed software architecture theories.
Joint secrecy over the K-Transmitter Multiple Access Channel
Venue: arXiv cs.IT 2017
Year: 2017

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K messages to an eavesdropper is made vanishing). As a result, we establish the joint secrecy achievable rate region. To this end, our results build upon two techniques in addition to the standard information-theoretic methods. The first is a generalization of Chia-El Gamal's lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with properties of mutual information, leads to an efficient Fourier-Motzkin elimination. These two approaches could also be of independent interests in other contexts.