Query: Tools to support systematic reviews in software engineering: a feature analysis

Relevant passages:
Lessons from applying the systematic literature review process within the software engineering domain <=SEP=> A consequence of the growing number of empirical studies in software engineering is the need to adopt systematic approaches to assessing and aggregating research outcomes in order to provide a balanced and objective summary of research evidence for a particular topic. The paper reports experiences with applying one such approach, the practice of systematic literature review, to the published studies relevant to topics within the software engineering domain. The systematic literature review process is summarised, a number of reviews being undertaken by the authors and others are described and some lessons about the applicability of this practice to software engineering are extracted. The basic systematic literature review process seems appropriate to software engineering and the preparation and validation of a review protocol in advance of a review activity is especially valuable. The paper highlights areas where some adaptation of the process to accommodate the domain-specific characteristics of software engineering is needed as well as areas where improvements to current software engineering infrastructure and practices would enhance its applicability. In particular, infrastructure support provided by software engineering indexing databases is inadequate. Also, the quality of abstracts is poor; it is usually not possible to judge the relevance of a study from a review of the abstract alone. 2006 Elsevier Inc. All rights reserved.

SLR-Tool - A Tool for Performing Systematic Literature Reviews <=SEP=> Systematic literature reviews (SLRs) have been gaining a significant amount of attention from Software Engineering researchers since 2004. SLRs are considered to be a new research methodology in Software Engineering, which allow evidence to be gathered with regard to the usefulness or effectiveness of the technology proposed in Software Engineering for the development and maintenance of software products. This is demonstrated by the growing number of publications related to SLRs that have appeared in recent years. While some tools exist that can support some or all of the activities of the SLR processes defined in (Kitchenham & Charters, 2007), these are not free. The objective of this paper is to present the SLR-Tool, which is a free tool and is available on the following website: http://alarcosj.esi.uclm.es/SLRTool/, to be used by researchers from any discipline, and not only Software Engineering. SLR-Tool not only supports the process of performing SLRs proposed in (Kitchenham & Charters, 2007), but also provides additional functionalities such as: refining searches within the documents by applying text mining techniques; defining a classification schema in order to facilitate data synthesis; exporting the results obtained to the format of tables and charts; and exporting the references from the primary studies to the formats used in bibliographic packages such as EndNote, BibTeX or Ris. This tool has, to date, been used by members of the Alarcos Research Group and PhD students, and their perception of it is that it is both highly necessary and useful. Our purpose now is to circulate the use of SLR-Tool throughout the entire research community in order to obtain feedback from other users.

Perceived Usefulness, Perceived Ease of Use, and User Acceptance of Information Technology <=SEP=> Valid measurement scales for predicting user acceptance of computers are in short supply. Most subjective measures used in practice are unvalidated, and their relationship to system usage is unknown. The present research develops and validates new scales for two specific variables, perceived usefulness and perceived ease of use, which are hypothesized to be fundamental determinants of user acceptance. Definitions for these two variables were used to develop scale items that were pretested for content validity and then tested for reliability and construct validity in two studies involving a total of 152 users and four application programs. The measures were refined and streamlined, resulting in two six-item scales with reliabilities of .98 for usefulness and .94 for ease of use. The scales exhibited high convergent, discriminant, and factorial validity. Perceived usefulness was significantly correlated with both selfreported current usage (r=.63, Study 1) and self-predicted future usage (r =.85, Study 2). Perceived ease of use was also significantly correlated with current usage (r= .45, Study 1) and future usage (r =.59, Study 2). In both studies, usefulness had a significantly greater correlation with usage behavior than did ease of use. Regression analyses suggest that perceived ease of use may actually be a causal antecedent to perceived usefulness, as opposed to a parallel, direct determinant of system usage. Implications are drawn for future research on user acceptance.

Evidence-based software engineering <=SEP=> Objective: Our objective is to describe how softwareengineering might benefit from an evidence-basedapproach and to identify the potential difficultiesassociated with the approach.Method: We compared the organisation and technicalinfrastructure supporting evidence-based medicine (EBM)with the situation in software engineering. We consideredthe impact that factors peculiar to software engineering(i.e. the skill factor and the lifecycle factor) would haveon our ability to practice evidence-based softwareengineering (EBSE).Results: EBSE promises a number of benefits byencouraging integration of research results with a view tosupporting the needs of many different stakeholdergroups. However, we do not currently have theinfrastructure needed for widespread adoption of EBSE.The skill factor means software engineering experimentsare vulnerable to subject and experimenter bias. Thelifecycle factor means it is difficult to determine howtechnologies will behave once deployed.Conclusions: Software engineering would benefit fromadopting what it can of the evidence approach providedthat it deals with the specific problems that arise from thenature of software engineering.

Factors Influencing the Usage of Websites: The Case of a Generic Portal in the Netherlands <=SEP=> In this paper, we empirically investigate an extension of the Technology Acceptance Model (TAM, Davis, 1989) to explain the individual acceptance and usage of websites. Conceptually, we examine perceived ease-of-use, usefulness, enjoyment, and their impact on attitude towards using, intention to use and actual use. The paper also introduces a new construct, “perceived visual attractiveness” of the website and suggest that it influences usefulness, enjoyment, and ease-of-use. For our empirical research we partnered with a Dutch generic portal site with over 300 000 subscribers at the time the research was conducted. The websurvey resulted in sample size of 825 respondents. The results confirmed all of the 12 hypotheses formulated. Three findings are worth mentioning in particular: (1) intention is most dominantly influenced by attitude (β = 0.51), (2) ease-of-use, enjoyment, and usefulness contribute equally to attitude towards using (β = 0.23, 0.23, and 0.17 respectively) and (3) visual attractiveness contributes remarkably well to both ease-of-use, enjoyment, and usefulness (β = 0.41, 0.35, and 0.21). Although this is not the first research to apply TAM to an internet context, we claim three major contributions: (1) a single website as the unit of analysis, (2) the introduction of visual attractiveness, and (3) the use of “real” website visitors rather than student samples. Promising future research lies in the conceptual connection between actual website features and website use, a connection for which the TAM framework provides a meaningful bridge. Factors Influencing the Usage of Websites: The Case of a Generic Portal in the Netherlands

A Comparative Study of Data Clustering Algorithms <=SEP=> Data clustering is a process of partitioning data points into meaningful clusters such that a cluster holds similar data and different clusters hold dissimilar data. It is an unsupervised approach to classify data into different patterns. In general, the clustering algorithms can be classified into the following two categories: firstly, hard clustering, where a data object can belong to a single and distinct cluster and secondly, soft clustering, where a data object can belong to different clusters. In this report we have made a comparative study of three major data clustering algorithms highlighting their merits and demerits. These algorithms are: k-means, fuzzy c-means and K-NN clustering algorithm. Choosing an appropriate clustering algorithm for grouping the data takes various factors into account for illustration one is the size of data to be partitioned.

A low-Cost, Open-Source, BCI- VR Game Control Development Environment Prototype for Game Based Neurorehabilitation <=SEP=> In this paper we present a low-cost and open-source brain-computer interface (BCI) virtual-reality (VR) Game Control Development Environment prototype, which we demonstrate using real-time signal processing of Electroencephalography (EEG) event-related desynchronization and synchronization changes (ERD/ERS) within the Precentral Gyrus (Motor Cortex), allowing a user to control a 3D object within a Virtual Reality Environment. This BCI-VR system prototype was functionally tested on multiple participants and demonstrated live before an audience during the 2017 ‘Hack the Brain’ at the Dublin Science Gallery. The availability of such an open-source, effective, BCI-VR Game Control Development Environment, at a level acceptable for industry experimentation, has the potential to open up this field to a much wider range of researchers and games developers and to assist the investigation of gaming experiences which both incorporate the specific control features available through BCI as a core element of the game play and the potential for its use in neurorehabilitation.

Self-esteem and perceived regard: how I see myself affects my relationship satisfaction. <=SEP=> The authors explored the relations among self-esteem, perceived regard, and satisfaction in dating relationships. On the basis of the dependency regulation model (T. DeHart, B. Pelham, & S. Murray, 2004), the authors hypothesized that self-esteem would influence individuals' self-perceptions and views of how their partners perceive them (metaperception). They also hypothesized that perceived regard (self-perception minus metaperception) would predict relationship satisfaction. Regression analyses indicated that for moderate relationship-relevant traits (i.e., caring, loving), high self-esteem was associated with self-enhancement (idealization), whereas low self-esteem was associated with self-deprecation. For low relationship-relevant traits (i.e., quiet, reserved), both low and high self-esteem individuals self-enhanced. Hierarchical regression analyses indicated that self-esteem and perceived regard for moderate relationship-relevant traits predicted satisfaction. The authors discuss the implications of idealization, self-verification, and self-deprecation for the perceivers and their relationships.

A systematic survey on automated concurrency bug detection, exposing, avoidance, and fixing techniques <=SEP=> Currently, concurrent programs are becoming increasingly widespread to meet the demands of the rapid development of multi-core hardware. However, it could be quite expensive and challenging to guarantee the correctness and efficiency of concurrent programs. In this paper, we provide a systematic review of the existing research on fighting against concurrency bugs, including automated concurrency bug exposing, detection, avoidance, and fixing. These four categories cover the different aspects of concurrency bug problems and are complementary to each other. For each category, we survey the motivation, key issues, solutions, and the current state of the art. In addition, we summarize the classical benchmarks widely used in previous empirical studies and the contribution of active research groups. Finally, some future research directions on concurrency bugs are recommended. We believe this survey would be useful for concurrency programmers and researchers.

[Skin signs in child abuse]. <=SEP=> Child abuse is far more prevalent today than is generally recognized. Up to 90% of victims suffer physical abuse that can be observed in signs on the skin. Dermatologists are particularly qualified to identify these signs and distinguish them from other conditions that can mimic abuse. This review covers the signs of child abuse that can be observed on the skin. We discuss clues that can help differentiate between lesions caused by abuse and those that are accidental, and we describe the skin conditions that mimic physical abuse.

Entity Resolution: Theory, Practice & Open Challenges <=SEP=> This tutorial brings together perspectives on ER from a variety of fields, including databases, machine learning, natural language processing and information retrieval, to provide, in one setting, a survey of a large body of work. We discuss both the practical aspects and theoretical underpinnings of ER. We describe existing solutions, current challenges, and open research problems.

Survey on 3D Hand Gesture Recognition <=SEP=> Three-dimensional hand gesture recognition has attracted increasing research interests in computer vision, pattern recognition, and human-computer interaction. The emerging depth sensors greatly inspired various hand gesture recognition approaches and applications, which were severely limited in the 2D domain with conventional cameras. This paper presents a survey of some recent works on hand gesture recognition using 3D depth sensors. We first review the commercial depth sensors and public data sets that are widely used in this field. Then, we review the state-of-the-art research for 3D hand gesture recognition in four aspects: 1) 3D hand modeling; 2) static hand gesture recognition; 3) hand trajectory gesture recognition; and 4) continuous hand gesture recognition. While the emphasis is on 3D hand gesture recognition approaches, the related applications and typical systems are also briefly summarized for practitioners.

Model-Driven ERP Implementation <=SEP=> Enterprise Resource Planning (ERP) implementations are very complex. To obtain a fair level of understanding of the system, it is then necessary to model the supported business processes. However, the problem is the accuracy of the mapping between this model and the actual technical implementation. A solution is to make use of the OMG’s Model-Driven Architecture (MDA) framework. In fact, this framework lets the developer model his system at a high abstraction level and allows the MDA tool to generate the implementation details. This paper presents our results in applying the MDA framework to ERP implementation based on a high level model of the business processes. Then, we show how our prototype is structured and implemented in the IBM/Rational XDE environment

A General Divide and Conquer Approach for Process Mining <=SEP=> Operational processes leave trails in the information systems supporting them. Such event data are the starting point for process mining – an emerging scientific discipline relating modeled and observed behavior. The relevance of process mining is increasing as more and more event data become available. The increasing volume of such data (“Big Data”) provides both opportunities and challenges for process mining. In this paper we focus on two particular types of process mining: process discovery (learning a process model from example behavior recorded in an event log) and conformance checking (diagnosing and quantifying discrepancies between observed behavior and modeled behavior). These tasks become challenging when there are hundreds or even thousands of different activities and millions of cases. Typically, process mining algorithms are linear in the number of cases and exponential in the number of different activities. This paper proposes a very general divide-and-conquer approach that decomposes the event log based on a partitioning of activities. Unlike existing approaches, this paper does not assume a particular process representation (e.g., Petri nets or BPMN) and allows for various decomposition strategies (e.g., SESEor passage-based decomposition). Moreover, the generic divide-andconquer approach reveals the core requirements for decomposing process discovery and conformance checking problems.

Survey of Consistent Network Updates <=SEP=> Computer networks have become a critical infrastructure. As such, networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be very flexible and support fast updates, e.g., due to a change in the security policy, increasing traffic, or failures. In this paper, we present a structured survey of mechanisms and protocols to update computer networks in a fast and consistent manner. In particular, we identify and discuss the different desirable consistency properties that should be provided throughout a network update, the algorithmic techniques which are needed to meet these consistency properties, and the implications on the speed and costs at which updates can be performed. We also explain the relationship between consistent network update problems and classic algorithmic optimization ones. While our survey is mainly motivated by the advent of Software-Defined Networks (SDNs) and their primary need for correct and efficient update techniques, the fundamental underlying problems are not new, and we provide a historical perspective of the subject as well. CCS Concepts: rGeneral and reference → Surveys and overviews; rNetworks → Network algorithms; rComputer systems organization→ Distributed architectures;

Supervised Bilingual Lexicon Induction with Multiple Monolingual Signals <=SEP=> Prior research into learning translations from source and target language monolingual texts has treated the task as an unsupervised learning problem. Although many techniques take advantage of a seed bilingual lexicon, this work is the first to use that data for supervised learning to combine a diverse set of signals derived from a pair of monolingual corpora into a single discriminative model. Even in a low resource machine translation setting, where induced translations have the potential to improve performance substantially, it is reasonable to assume access to some amount of data to perform this kind of optimization. Our work shows that only a few hundred translation pairs are needed to achieve strong performance on the bilingual lexicon induction task, and our approach yields an average relative gain in accuracy of nearly 50% over an unsupervised baseline. Large gains in accuracy hold for all 22 languages (low and high resource) that we investigate.

HEVC/H.265 vs. VP9 state-of-the-art video coding comparison for HD and UHD applications <=SEP=> High Efficiency Video Coding (HEVC) and VP9 are the latest state-of-the-art high-efficiency video coding standards. Both standards aim to decrease the bit-rate while improving the compression efficiency. HEVC/H.265 video standard was collaboratively developed by ITU-T and ISO/IEC with up to 50% bit-rate reduction as compared to its predecessor H.264/AVC. On the other hand, VP9 is an open source video standard developed by Google. While maintaining the same video quality, VP9 has achieved 50% bit-rate reduction as compared to its predecessor VP8. This research paper focuses on the comparison of HEVC and VP9 based on both subjective as well as objective assessments. First, detailed differences in design and specification of the two standards are discussed. Later experiment results are provided, which compare the coding efficiency of both standards on various high-definition 720p, 1090p, and 2160p sample test bench videos. According to our experimental results, it has been empirically proved that HEVC/H.265 outperforms VP9 in bit-rate savings.

The Narrative Advantage : Gender and the Language of Crowdfunding <=SEP=> In this study, we set out to examine the role of language in the success of online fundraising—a new form of entrepreneurial project financing. In particular, we evaluate the influence of linguistic content on fundraising outcomes, above and beyond type of product or service offered. Online fundraising settings pose an interesting empirical puzzle: women are systematically more successful than men, an outcome contrary to offline gender inequality. We propose that this outcome is partially explained by linguistic differences between men and women in terms of language they use, and we test this mechanism using data from the online crowdfunding platform Indiegogo. The results support our theory, suggesting a link between micro-level linguistic choices and macro level outcomes: the institution of crowdfunding may reduce gender inequalities in the fundraising arena by benefitting the communication style of women.

Low voltage sub-nanosecond pulsed current driver IC for high-resolution LIDAR applications <=SEP=> This paper introduces a new low voltage sub-nanosecond monolithic pulsed current driver for light detection and ranging (LIDAR) applications. Unique architecture based on a controlled current source and Vernier activation sequence, combined with a monolithic implementation that allows operation with low input voltage levels, high-resolution pulse width and sub-nanosecond rise and fall times. An on-chip low voltage pulsed driver sub-nanosecond prototype has been implemented in a TS 0.18-μm 5V-gated power management process. It incorporates an integrated wide range sesnseFET based current sensor and a rail-to-rail comparator for current regulation. To characterize the avalanche capabilities of the integrated lateral MOSFET power devices required for the driver IC, a separate line of investigation has been carried out. Several lateral diffused MOS (LDMOS) power devices have been custom designed and experimentally evaluated for a life-cycle performance characterization. Post-layout analysis of the power driver IC is in a good agreement with the theoretical predictions. For a 5V input voltage, rise and fall times of the laser pulse light output are on the order of hundreds of picoseconds, with currents up to 5A. To validate the concept of high-resolution pulse width generation and short fall time, a discrete prototype has been constructed and experimentally tested.

Semi-Paired Discrete Hashing: Learning Latent Hash Codes for Semi-Paired Cross-View Retrieval <=SEP=> Due to the significant reduction in computational cost and storage, hashing techniques have gained increasing interests in facilitating large-scale cross-view retrieval tasks. Most cross-view hashing methods are developed by assuming that data from different views are well paired, e.g., text-image pairs. In real-world applications, however, this fully-paired multiview setting may not be practical. The more practical yet challenging semi-paired cross-view retrieval problem, where pairwise correspondences are only partially provided, has less been studied. In this paper, we propose an unsupervised hashing method for semi-paired cross-view retrieval, dubbed semi-paired discrete hashing (SPDH). In specific, SPDH explores the underlying structure of the constructed common latent subspace, where both paired and unpaired samples are well aligned. To effectively preserve the similarities of semi-paired data in the latent subspace, we construct the cross-view similarity graph with the help of anchor data pairs. SPDH jointly learns the latent features and hash codes with a factorization-based coding scheme. For the formulated objective function, we devise an efficient alternating optimization algorithm, where the key binary code learning problem is solved in a bit-by-bit manner with each bit generated with a closed-form solution. The proposed method is extensively evaluated on four benchmark datasets with both fully-paired and semi-paired settings and the results demonstrate the superiority of SPDH over several other state-of-the-art methods in term of both accuracy and scalability.

Exploration and apprenticeship learning in reinforcement learning <=SEP=> We consider reinforcement learning in systems with unknown dynamics. Algorithms such as E3 (Kearns and Singh, 2002) learn near-optimal policies by using "exploration policies" to drive the system towards poorly modeled states, so as to encourage exploration. But this makes these algorithms impractical for many systems; for example, on an autonomous helicopter, overly aggressive exploration may well result in a crash. In this paper, we consider the apprenticeship learning setting in which a teacher demonstration of the task is available. We show that, given the initial demonstration, no explicit exploration is necessary, and we can attain near-optimal performance (compared to the teacher) simply by repeatedly executing "exploitation policies" that try to maximize rewards. In finite-state MDPs, our algorithm scales polynomially in the number of states; in continuous-state linear dynamical systems, it scales polynomially in the dimension of the state. These results are proved using a martingale construction over relative losses.

Simple, Accurate, and Robust Nonparametric Blind Super-Resolution <=SEP=> This paper proposes a simple, accurate, and robust approach to single image nonparametric blind Super-Resolution (SR). This task is formulated as a functional to be minimized with respect to both an intermediate super-resolved image and a nonparametric blur-kernel. The proposed approach includes a convolution consistency constraint which uses a non-blind learning-based SR result to better guide the estimation process. Another key component is the unnatural bi-l0-l2-norm regularization imposed on the super-resolved, sharp image and the blur-kernel, which is shown to be quite beneficial for estimating the blur-kernel accurately. The numerical optimization is implemented by coupling the splitting augmented Lagrangian and the conjugate gradient (CG). Using the pre-estimated blur-kernel, we finally reconstruct the SR image by a very simple non-blind SR method that uses a natural image prior. The proposed approach is demonstrated to achieve better performance than the recent method by Michaeli and Irani [2] in both terms of the kernel estimation accuracy and image SR quality.

A Framework based on SDN and Containers for Dynamic Service Chains on IoT Gateways <=SEP=> In this paper, we describe a new approach for managing service function chains in scenarios where data from Internet of Things (IoT) devices is partially processed at the network edge. Our framework is enabled by two emerging technologies, Software-Defined Networking (SDN) and container based virtualization, which ensure several benefits in terms of flexibility, easy programmability, and versatility. These features are well suitable with the increasingly stringent requirements of IoT applications, and allow a dynamic and automated network service chaining. An extensive performance evaluation, which has been carried out by means of a testbed, seeks to understand how our proposed framework performs in terms of computational overhead, network bandwidth, and energy consumption. By accounting for the constraints of typical IoT gateways, our evaluation tries to shed light on the actual deployability of the framework on low-power nodes.

An industrial study on the risk of software changes <=SEP=> Modelling and understanding bugs has been the focus of much of the Software Engineering research today. However, organizations are interested in more than just bugs. In particular, they are more concerned about managing risk, i.e., the likelihood that a code or design change will cause a negative impact on their products and processes, regardless of whether or not it introduces a bug. In this paper, we conduct a year-long study involving more than 450 developers of a large enterprise, spanning more than 60 teams, to better understand risky changes, i.e., changes for which developers believe that additional attention is needed in the form of careful code or design reviewing and/or more testing. Our findings show that different developers and different teams have their own criteria for determining risky changes. Using factors extracted from the changes and the history of the files modified by the changes, we are able to accurately identify risky changes with a recall of more than 67%, and a precision improvement of 87% (using developer specific models) and 37% (using team specific models), over a random model. We find that the number of lines and chunks of code added by the change, the bugginess of the files being changed, the number of bug reports linked to a change and the developer experience are the best indicators of change risk. In addition, we find that when a change has many related changes, the reliability of developers in marking risky changes is negatively affected. Our findings and models are being used today in practice to manage the risk of software projects.

The Role of the Gut Microbiota in Childhood Obesity. <=SEP=> BACKGROUND
Childhood and adolescent obesity has reached epidemic proportions worldwide. The pathogenesis of obesity is complex and multifactorial, in which genetic and environmental contributions seem important. The gut microbiota is increasingly documented to be involved in the dysmetabolism associated with obesity.


METHODS
We conducted a systematic search for literature available before October 2015 in the PubMed and Scopus databases, focusing on the interplay between the gut microbiota, childhood obesity, and metabolism.


RESULTS
The review discusses the potential role of the bacterial component of the human gut microbiota in childhood and adolescent-onset obesity, with a special focus on the factors involved in the early development of the gut bacterial ecosystem, and how modulation of this microbial community might serve as a basis for new therapeutic strategies in combating childhood obesity. A vast number of variables are influencing the gut microbial ecology (e.g., the host genetics, delivery method, diet, age, environment, and the use of pre-, pro-, and antibiotics); but the exact physiological processes behind these relationships need to be clarified.


CONCLUSIONS
Exploring the role of the gut microbiota in the development of childhood obesity may potentially reveal new strategies for obesity prevention and treatment.

Determination of the plan of the A Famosa Fortress , Malaysia <=SEP=> The “A Famosa Fortress” is one of the oldest partially extant European buildings in Malaysia. It was built in 1511 by the Portuguese and went through several architectural developments and changes before being largely destroyed during the British occupation in 1824. With the subsequent overbuilding of the site by Melaka city today, it is impossible to fully reconstruct this fortress in its physical context. In this paper, we focus on determining the fortress layout based on various textual descriptions and old drawings and plans in preparation to building a detailed 3-D digital model. We have identified several important issues arising from the lack of any authoritative documentation. Such plans as exist not only differ in their depiction of the fort, but also use various ancient measurement systems. The paper gives examples of these problems and shows how a verifiable conjectural layout has been constructed. This is then compared against such archaeological evidence as is currently available. We are not aware of any previously published attempt to verify the consistency, similarity and integrity of the documentary data.

Learning effective Gait features using LSTM <=SEP=> Human gait is an important biometric feature for person identification in surveillance videos because it can be collected at a distance without subject cooperation. Most existing gait recognition methods are based on Gait Energy Image (GEI). Although the spatial information in one gait sequence can be well represented by GEI, the temporal information is lost. To solve this problem, we propose a new feature learning method for gait recognition. Not only can the learned feature preserve temporal information in a gait sequence, but it can also be applied to cross-view gait recognition. Heatmaps extracted by a convolutional neutral network (CNN) based pose estimate method are used to describe the gait information in one frame. To model a gait sequence, the LSTM recurrent neural network is naturally adopted. Our LSTM model can be trained with unlabeled data, where the identity of the subject in a gait sequence is unknown. When labeled data are available, our LSTM works as a frame to frame view transformation model (VTM). Experiments on a gait benchmark demonstrate the efficacy of our method.

Intervention Studies on Forgiveness : A Meta-Analysis <=SEP=> 79 A promising area of counseling research that emerged in the 1990s is the scientific investigation of forgiveness interventions. Although the notion of forgiving is ancient (Enright & the Human Development Study Group, 1991), it has not been systematically studied until relatively recently (Enright, Santos, & Al-Mabuk, 1989). Significant to counseling because of its interpersonal nature, forgiveness issues are relevant to the contexts of marriage and dating relationships, parent–child relationships, friendships, professional relationships, and others. In addition, forgiveness is integral to emotional constructs such as anger. As forgiveness therapies (Ferch, 1998; Fitzgibbons, 1986) and the empirical study of these therapies (Freedman & Enright, 1996) begin to unfold, it is important to ask if these interventions can consistently demonstrate salient positive effects on levels of forgiveness and on the mental health of targeted clients. The purpose of this article is to analyze via meta-analysis the existing published interventions on forgiveness. Meta-analysis is a popular vehicle of synthesizing results across multiple studies. Recent successful uses of this method include the study by McCullough (1999), who analyzed five studies that compared the efficacy for depression of standard approaches with counseling with religion-accommo-dative approaches. Furthermore, in order to reach conclusions about the influence of hypnotherapy on treatment for clients with obesity, Allison and Faith (1996) used meta-analysis to examine six studies that compared the efficacy of using cognitive-behavioral therapy (CBT) alone with the use of CBT combined with hypnotherapy. Finally, Morris, Audet, Angelillo, Chalmers, and Mosteller (1992) used meta-analysis to combine the results of 10 studies with contradictory findings to show that the benefits of chlorinating drinking water far outweighed the risks. Although there may be some concern that using forgiveness as an intervention in counseling is in too early a stage of development and that too few studies exist for a proper meta-analysis, the effectiveness of these recent meta-analyses supports this meta-analytic investigation. Certainly any findings must be tempered with due caution. However, this analysis may serve as important guidance for the structure and development of future counseling studies of forgiveness. We first examine the early work in forgiveness interventions by examining the early case studies. From there, we define forgiveness, discuss the models of forgiveness in counseling and the empirically based interventions, and then turn to the meta-analysis. The early clinical case studies suggested that forgiveness might be helpful for people who have experienced deep emotional pain because of unjust treatment. For …

Supervised Representation Learning for Audio Scene Classification <=SEP=> This paper investigates the use of supervised feature learning approaches for extracting relevant and discriminative features from acoustic scene recordings. Owing to the recent release of open datasets for acoustic scene classification problems, representation learning techniques can now be envisioned for solving the problem of feature extraction. This paper makes a step toward this goal by first introducing a supervised nonnegative matrix factorization SNMF. Our goal through this SNMF is to induce the matrix decomposition to carry out discriminative information in addition to the usual generative ones. We achieve this objective by augmenting the nonnegative matrix factorization optimization problem with a novel loss function related to class labels of each column of the matrix to decompose. While the scale of the datasets available is still small compared to those available in computer vision, we have studied models based on convolutional neural networks. We have analyzed the performances of these models on the DCASE-16 dataset and a corrected version of the LITIS Rouen one. Our experiments show that despite the small-scale setting, supervised feature learning is favorably competitive compared to the current state-of-the-art features. We also point out that for smaller scale dataset, SNMF is indeed slightly less prone to overfitting than convolutional neural networks. While the performances of these learned features are interesting per se, a deeper analysis of their behavior in the acoustic scene problem context raises open and difficult questions that we believe, need to be addressed for further performance breakthroughs.

Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent <=SEP=> We study the resilience to Byzantine failures of distributed implementations of Stochastic Gradient Descent (SGD). So far, distributed machine learning frameworks have largely ignored the possibility of failures, especially arbitrary (i.e., Byzantine) ones. Causes of failures include software bugs, network asynchrony, biases in local datasets, as well as attackers trying to compromise the entire system. Assuming a set of n workers, up to f being Byzantine, we ask how resilient can SGD be, without limiting the dimension, nor the size of the parameter space. We first show that no gradient aggregation rule based on a linear combination of the vectors proposed by the workers (i.e, current approaches) tolerates a single Byzantine failure. We then formulate a resilience property of the aggregation rule capturing the basic requirements to guarantee convergence despite f Byzantine workers. We propose Krum, an aggregation rule that satisfies our resilience property, which we argue is the first provably Byzantine-resilient algorithm for distributed SGD. We also report on experimental evaluations of Krum.