Query: Design, Implementation and Performance Analysis of Highly Efficient Algorithms for AES Key Retrieval in Access-driven Cache-based Side Channel Attacks

Relevant passages:
Cryptanalysis of DES Implemented on Computers with Cache <=SEP=> This paper presents the results of applying an attack against the Data Encryption Standard (DES) implemented in some applications, using side-channel information based on CPU delay as proposed in [11]. This cryptanalysis technique uses side-channel information on encryption processing to select and collect effective plaintexts for cryptanalysis, and infers the information on the expanded key from the collected plaintexts. On applying this attack, we found that the cipher can be broken with 2 known plaintexts and 2 calculations at a success rate > 90%, using a personal computer with 600-MHz Pentium III. We discuss the feasibility of cache attack on ciphers that need many S-box look-ups, through reviewing the results of our experimental attacks on the block ciphers excluding DES, such as AES.

Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems <=SEP=> By carefully measuring the amount of time required to perform private key operations, attackers may be able to nd xed Di eHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known ciphertext. Actual systems are potentially at risk, including cryptographic tokens, network-based cryptosystems, and other applications where attackers can make reasonably accurate timing measurements. Techniques for preventing the attack for RSA and Di e-Hellman are presented. Some cryptosystems will need to be revised to protect against the attack, and new protocols and algorithms may need to incorporate measures to prevent timing attacks.

The RC5 Encryption Algorithm <=SEP=> This document describes the RC encryption algorithm a fast symmetric block cipher suitable for hardware or software imple mentations A novel feature of RC is the heavy use of data dependent rotations RC has a variable word size a variable number of rounds and a variable length secret key The encryption and decryption algorithms are exceptionally simple

Differential Power Analysis <=SEP=> are the property of their respective owners. The information contained in this presentation is provided for illustrative purposes only, and is provided without any guarantee or warranty whatsoever, and does not necessarily represent official opinions of CRI or its partners. Confidential-unauthorized copying, use or redistribution is prohibited.

Blind Signatures for Untraceable Payments <=SEP=> 

On the importance of accurate weak classifier learning for boosted weak classifiers <=SEP=> Recent work has shown that improving model learning for weak classifiers can yield significant gains in the overall accuracy of a boosted classifier. However, most published classifier boosting research relies only on rudimentary learning techniques for weak classifiers. So while it is known that improving the model learning can greatly improve the accuracy of the resulting strong classifier, it remains to be shown how much can yet be gained by further improving the model learning at the weak classifier level. This paper derives a very accurate model learning method for weak classifiers based on the popular Haar-like features and presents an investigation of its usefulness compared to the standard and recent approaches. The accuracy of the new method is shown by demonstrating the new models ability to predict ROC performance on validation data. A discussion of the problems in learning accurate weak hypotheses is given, along with example solutions. It is also shown that a previous simpler method can be further improved. Lastly, we show that improving model accuracy does not continue to yield improved overall classification beyond a certain point. At this point the learning technique, in this case RealBoost, is unable to make gains from the improved model data. The method has been tested on pedestrian detection tasks using classifiers boosted using the RealBoost boosting algorithm. A subset of our most interesting results is shown to demonstrate the value of method.

Probabilistic vehicle trajectory prediction over occupancy grid map via recurrent neural network <=SEP=> In this paper, we propose an efficient vehicle trajectory prediction framework based on recurrent neural network. Basically, the characteristic of the vehicle's trajectory is different from that of regular moving objects since it is affected by various latent factors including road structure, traffic rules, and driver's intention. Previous state of the art approaches use sophisticated vehicle behavior model describing these factors and derive the complex trajectory prediction algorithm, which requires a system designer to conduct intensive model optimization for practical use. Our approach is data-driven and simple to use in that it learns complex behavior of the vehicles from the massive amount of trajectory data through deep neural network model. The proposed trajectory prediction method employs the recurrent neural network called long short-term memory (LSTM) to analyze the temporal behavior and predict the future coordinate of the surrounding vehicles. The proposed scheme feeds the sequence of vehicles' coordinates obtained from sensor measurements to the LSTM and produces the probabilistic information on the future location of the vehicles over occupancy grid map. The experiments conducted using the data collected from highway driving show that the proposed method can produce reasonably good estimate of future trajectory.

A Spiking Neural Network Based Cortex-Like Mechanism and Application to Facial Expression Recognition <=SEP=> In this paper, we present a quantitative, highly structured cortex-simulated model, which can be simply described as feedforward, hierarchical simulation of ventral stream of visual cortex using biologically plausible, computationally convenient spiking neural network system. The motivation comes directly from recent pioneering works on detailed functional decomposition analysis of the feedforward pathway of the ventral stream of visual cortex and developments on artificial spiking neural networks (SNNs). By combining the logical structure of the cortical hierarchy and computing power of the spiking neuron model, a practical framework has been presented. As a proof of principle, we demonstrate our system on several facial expression recognition tasks. The proposed cortical-like feedforward hierarchy framework has the merit of capability of dealing with complicated pattern recognition problems, suggesting that, by combining the cognitive models with modern neurocomputational approaches, the neurosystematic approach to the study of cortex-like mechanism has the potential to extend our knowledge of brain mechanisms underlying the cognitive analysis and to advance theoretical models of how we recognize face or, more specifically, perceive other people's facial expression in a rich, dynamic, and complex environment, providing a new starting point for improved models of visual cortex-like mechanism.

LINE: Large-scale Information Network Embedding <=SEP=> This paper studies the problem of embedding very large information networks into low-dimensional vector spaces, which is useful in many tasks such as visualization, node classification, and link prediction. Most existing graph embedding methods do not scale for real world information networks which usually contain millions of nodes. In this paper, we propose a novel network embedding method called the ``LINE,'' which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted. The method optimizes a carefully designed objective function that preserves both the local and global network structures. An edge-sampling algorithm is proposed that addresses the limitation of the classical stochastic gradient descent and improves both the effectiveness and the efficiency of the inference. Empirical experiments prove the effectiveness of the LINE on a variety of real-world information networks, including language networks, social networks, and citation networks. The algorithm is very efficient, which is able to learn the embedding of a network with millions of vertices and billions of edges in a few hours on a typical single machine. The source code of the LINE is available online\footnote{\url{https://github.com/tangjianpku/LINE}}.

Reverse wire bonding and phosphor printing for LED wafer level packaging <=SEP=> Solid state lighting is a good alternative light source with reduced energy consumption. Light-emitting diode (LED) is very efficient in turning electrical energy into light. LED has a number of advantages over the traditional light sources. The optical performance of the LED component is very critical. In general, white light can be obtained by applying phosphor on a blue LED chip. The blue light from the LED excites the phosphor to emit yellow light. The blue and yellow light mixes together to give white light. In order to obtain a good optical performance, it is necessary to apply phosphor properly. It is challenging to distribute a right amount of phosphor on the LED die. Besides, phosphor dispensing is usually the slowest process when compared with die bonding and wire bonding. This controls the overall throughput of the LED packaging process. There are different methods to apply the phosphor. The phosphor is mixed with epoxy or silicone to form slurry and is then dispensed onto the chip. However, the spatial color distribution is poor if phosphor slurry is used. Conformal phosphor coating can be used to improve the spatial color distribution. In this paper, an innovative phosphor stencil printing method is proposed. This paper demonstrates the feasibility of the phosphor stencil printing process for wafer-level LED packaging. LEDs are first mounted on a wafer submount. Wire bonds are used as interconnect. The phosphor is stencil printed on the chip surface after wire bond. The minimum phosphor layer thickness is controlled by the wire bond loop height. In order to achieve a low loop height, reverse wire bonding is used. The first bond is on the wafer submount and the second bond is on the LED chip. The reverse wire bond has a very low profile which allows a thin layer of phosphor to be printed on the chip surface. Prototypes are successfully fabricated. A uniform layer of phosphor is stencil printed on the LED chip on the wafer submount. Experimental result shows that the proposed phosphor printing method is very effective in distributing the right amount of phosphor on the chip surface.

5G cellular network integration with SDN: Challenges, issues and beyond <=SEP=> The tremendous growth in communication technology is shaping a hyper-connected network where billions or connected devices are producing a huge volume of data. Cellular and mobile network is a major contributor towards this technology shift and require new architectural paradigm to provide low latency, high performance in a resource constrained environment. 5G technology deployment with fully IP-based connectivity is anticipated by 2020. However, there is no standard established for 5G technology and many efforts are being made to establish a unified 5G stander. In this context, variant technology such as Software Defined Network (SDN) and Network Function virtualization (NFV) are the best candidate. SDN dissociate control plane from data plane and network management is done on the centralized control plane. In this paper, a survey on state of the art on the 5G integration with the SDN is presented. A comprehensive review is presented for the different integrated architectures of 5G wireless network and the generalized solutions over the period 2010–2016. This comparative analysis of the existing solutions of SDN-based cellular network (5G) implementations provides an easy and concise view of the emerging trends by 2020.

Adversarial and Perceptual Refinement for Compressed Sensing MRI Reconstruction <=SEP=> Deep learning approaches have shown promising performance for compressed sensing-based Magnetic Resonance Imaging. While deep neural networks trained with mean squared error (MSE) loss functions can achieve high peak signal to noise ratio, the reconstructed images are often blurry and lack sharp details, especially for higher undersampling rates. Recently, adversarial and perceptual loss functions have been shown to achieve more visually appealing results. However, it remains an open question how to (1) optimally combine these loss functions with the MSE loss function and (2) evaluate such a perceptual enhancement. In this work, we propose a hybrid method, in which a visual refinement component is learnt on top of an MSE loss-based reconstruction network. In addition, we introduce a semantic interpretability score, measuring the visibility of the region of interest in both ground truth and reconstructed images, which allows us to objectively quantify the usefulness of the image quality for image post-processing and analysis. Applied on a large cardiac MRI dataset simulated with 8-fold undersampling, we demonstrate significant improvements (p < 0.01) over the state-of-the-art in both a human observer study and the semantic interpretability score.

A Pose-Invariant Descriptor for Human Detection and Segmentation <=SEP=> We present a learning-based, sliding window-style approach for the problem of detecting humans in still images. Instead of traditional concatenation-style image location-based feature encoding, a global descriptor more invariant to pose variation is introduced. Specifically, we propose a principled approach to learning and classifying human/non-human image patterns by simultaneously segmenting human shapes and poses, and extracting articulation-insensitive features. The shapes and poses are segmented by an efficient, probabilistic hierarchical part-template matching algorithm, and the features are collected in the context of poses by tracing around the estimated shape boundaries. Histograms of oriented gradients are used as a source of low-level features from which our pose-invariant descriptors are computed, and kernel SVMs are adopted as the test classifiers. We evaluate our detection and segmentation approach on two public pedestrian datasets.

Interpretable Neural Architectures for Attributing an Ad's Performance to its Writing Style <=SEP=> How much does “free shipping!” help an advertisement’s ability to persuade? This paper presents two methods for performance attribution: finding the degree to which an outcome can be attributed to parts of a text while controlling for potential confounders1. Both algorithms are based on interpreting the behaviors and parameters of trained neural networks. One method uses a CNN to encode the text, an adversarial objective function to control for confounders, and projects its weights onto its activations to interpret the importance of each phrase towards each output class. The other method leverages residualization to control for confounds and performs interpretation by aggregating over learned word vectors. We demonstrate these algorithms’ efficacy on 118,000 internet search advertisements and outcomes, finding language indicative of high and low click through rate (CTR) regardless of who the ad is by or what it is for. Our results suggest the proposed algorithms are high performance and data efficient, able to glean actionable insights from fewer than 10,000 data points. We find that quick, easy, and authoritative language is associated with success, while lackluster embellishment is related to failure. These findings agree with the advertising industry’s emperical wisdom, automatically revealing insights which previously required manual A/B testing to discover.

A survey on comparison of electric motor types and drives used for electric vehicles <=SEP=> In this study, Switched Reluctance Motor (SRM), Induction Motor (IM), Brushless DC Motor, and Permanent Magnet Motor (PM), and their drives have been compared with the efficiency, cost, weight, cooling, maximum speed, reliability, fault tolerance, power ratings, and vehicle acceleration time. Hence, a comprehensive literature research on motor types and their drives used in EV has been made. According to these researches, some conclusions have been obtained. It has been seen that PM BLDC motors and their drives are the most efficient and have high power density, brushless DC motors and their drives have low cost, IM is appropriate for controllability and cost, the weight of SRM is low, its reliability is high, it operates fault-tolerance and according to the acceleration time, its performance is better than IM and BLDC. Hence, SRM is the most appropriate motor for EV.

Vision-as-Inverse-Graphics: Obtaining a Rich 3D Explanation of a Scene from a Single Image <=SEP=> We develop an inverse graphics approach to the problem of scene understanding, obtaining a rich representation that includes descriptions of the objects in the scene and their spatial layout, as well as global latent variables like the camera parameters and lighting. The framework's stages include object detection, the prediction of the camera and lighting variables, and prediction of object-specific variables (shape, appearance and pose). This acts like the encoder of an autoencoder, with graphics rendering as the decoder Importantly the scene representation is interpretable and is of variable dimension to match the detected number of objects plus the global variables. For the prediction of the camera latent variables we introduce a novel architecture termed Probabilistic HoughNets (PHNs), which provides a principled approach to combining information from multiple detections. We demonstrate the quality of the reconstructions obtained quantitatively on synthetic data, and qualitatively on real scenes.

Think-aloud protocols: Analyzing three different think-aloud protocols with counts of verbalized frustrations in a usability study of an information-rich Web site <=SEP=> We describe an empirical, between-subjects study on the use of think-aloud protocols in usability testing of an information-rich Web site. This double-blind study used three different types of think-aloud protocols: a traditional protocol, a speech-communication protocol, and a coaching protocol. A silent condition served as the control. Eighty participants were recruited and randomly pre-assigned to one of four conditions. With the goal of keeping unintended bias to a minimum, data analysis did not count the number of identified usability problems by condition, which was considered too subjective. Rather, the study collected the number of verbalized and non-verbalized counts of frustration by condition that users experienced. The study also did a count of the number of verbalized and non-verbalized instances of positive comments by condition that users expressed. Results show that there were no statistical differences in the number of counts by condition with respect to the traditional, speech communication, or coaching condition. The study concludes that simply counting the verbalizations of users by condition does not give enough information to determine whether any of the conditions would lead to a better understanding of the usability problems associated with the Web site.

Bacteriocins: developing innate immunity for food. <=SEP=> Bacteriocins are bacterially produced antimicrobial peptides with narrow or broad host ranges. Many bacteriocins are produced by food-grade lactic acid bacteria, a phenomenon which offers food scientists the possibility of directing or preventing the development of specific bacterial species in food. This can be particularly useful in preservation or food safety applications, but also has implications for the development of desirable flora in fermented food. In this sense, bacteriocins can be used to confer a rudimentary form of innate immunity to foodstuffs, helping processors extend their control over the food flora long after manufacture.

Distributed Auction Algorithms for the Assignment Problem with Partial Information <=SEP=> operations centers (MOC), in which multiple DMs with partial information and partial control over assets are involved in the development of operational level plans. The MOC emphasizes standardized processes and methods, centralized assessment and guidance, networked distributed planning capabilities, and decentralized execution for assessing, planning and executing missions across a range of military operations  Abstract—Task-asset assignment is a fundamental problem paradigm in a wide variety of applications. Typical problem setting involves a single decision maker (DM) who has complete knowledge of the weight (reward, benefit, accuracy) matrix and who can control any of the assets to execute the tasks. Motivated by planning problems arising in distributed organizations, this paper introduces a novel variation of the assignment problem, wherein there are multiple DMs and each DM knows only a part of the weight matrix and/or controls a subset of the assets. We extend the auction algorithm to such realistic settings with various partial information structures using a blackboard coordination structure. We show that by communicating the bid, the best and the second best profits among DMs and with a coordinator, the DMs can reconstruct the centralized assignment solution. The auction setup provides a nice analytical framework for formalizing how team members build internal models of other DMs and achieve team cohesiveness over time. [1]. In this vein, we are developing analytical and computational models for multi-level coordinated mission planning and monitoring processes associated with MOCs, so that they can function effectively in highly dynamic, asymmetric, and unpredictable mission environments. Two key problem areas are: 1) realistic modeling of multi-level coordination structures that link tactical, operational and strategic levels of decision making; and 2) collaborative planning with partial information and partial control of assets. In the collaborating planning problem, each DM “owns” a set of assets and is responsible for planning certain tasks. Each task is characterized by a vector of resource requirements, while each asset is characterized by a vector of resource capabilities (see Fig. 1). Multiple assets (from the same DM or multiple DMs) may be required to process a task. The degree of match between the task-resource requirement vector and asset-resource capability vector determines the accuracy of task execution. In addition, the elements of

An empirical study on the use of i* by non-technical stakeholders: the case of strategic dependency diagrams <=SEP=> Early phases of information systems engineering include the understanding of the enterprise’s context and the construction of models at different levels of decomposition, required to design the system architecture. These time-consuming activities are usually conducted by relatively large teams, composed of groups of non-technical stakeholders playing mostly an informative role (i.e. not involved in documentation and even less in modelling), led by few experienced technical consultants performing most of the documenting and modelling effort. This paper evaluates the ability of non-technical stakeholders to create strategic dependency diagrams written with the i* language in the design of the context model of a system architecture, and find out which difficulties they may encounter and what the quality of the models they build is. A case study involving non-technical stakeholders from 11 organizational areas in an Ecuadorian university held under the supervision and coordination of the two authors acting as consultants. The non-technical stakeholders identified the majority of the dependencies that should appear in the case study’s context model, although they experienced some difficulties in declaring the type of dependency, representing such dependencies graphically and applying the description guidelines provided in the training. Managers were observed to make more mistakes than other more operational roles. From the observations of these results, a set of methodological advices were compiled for their use in future, similar endeavours. It is concluded that non-technical stakeholders can take an active role in the construction of the context model. This conclusion is relevant for both researchers and practitioners involved in technology transfer actions with use of i*.

A high-PSR LDO using a feedforward supply-noise cancellation technique <=SEP=> A feed-forward noise cancellation (FFNC) technique to improve the power supply noise rejection (PSR) of a low dropout regulator (LDO) is presented. The proposed FFNC operates in conjunction with a conventional LDO and extends the noise rejection bandwidth by nearly an order of magnitude. Fabricated in 0.18µm CMOS, at 10mA load current, the prototype achieves a PSR of −50dB and −25dB at 1MHz and 10MHz supply noise frequencies, respectively. Compared to a conventional LDO, this represents an improvement of at least 30dB at 1MHz and 15dB at 10MHz. The prototype uses only 20pF load capacitance and occupies an active area of 0.04mm2.

Orthogonal nonnegative matrix tri-factorization for co-clustering: Multiplicative updates on Stiefel manifolds <=SEP=> Matrix factorization-based methods become popular in dyadic data analysis, where a fundamental problem, for example, is to perform document clustering or co-clustering words and documents given a term-document matrix. Nonnegative matrix tri-factorization (NMTF) emerges as a promising tool for co-clustering, seeking a 3-factor decomposition X USV with all factor matrices restricted to be nonnegative, i.e., U P 0; S P 0;V P 0: In this paper we develop multiplicative updates for orthogonal NMTF where X USV is pursued with orthogonality constraints, UU 1⁄4 I; and VV 1⁄4 I, exploiting true gradients on Stiefel manifolds. Experiments on various document data sets demonstrate that our method works well for document clustering and is useful in revealing polysemous words via co-clustering words and documents. 2010 Elsevier Ltd. All rights reserved.

Molecular assembly on two-dimensional materials. <=SEP=> Molecular self-assembly is a well-known technique to create highly functional nanostructures on surfaces. Self-assembly on two-dimensional (2D) materials is a developing field driven by the interest in functionalization of 2D materials in order to tune their electronic properties. This has resulted in the discovery of several rich and interesting phenomena. Here, we review this progress with an emphasis on the electronic properties of the adsorbates and the substrate in well-defined systems, as unveiled by scanning tunneling microscopy. The review covers three aspects of the self-assembly. The first one focuses on non-covalent self-assembly dealing with site-selectivity due to inherent moiré pattern present on 2D materials grown on substrates. We also see that modification of intermolecular interactions and molecule-substrate interactions influences the assembly drastically and that 2D materials can also be used as a platform to carry out covalent and metal-coordinated assembly. The second part deals with the electronic properties of molecules adsorbed on 2D materials. By virtue of being inert and possessing low density of states near the Fermi level, 2D materials decouple molecules electronically from the underlying metal substrate and allow high-resolution spectroscopy and imaging of molecular orbitals. The moiré pattern on the 2D materials causes site-selective gating and charging of molecules in some cases. The last section covers the effects of self-assembled, acceptor and donor type, organic molecules on the electronic properties of graphene as revealed by spectroscopy and electrical transport measurements. Non-covalent functionalization of 2D materials has already been applied for their application as catalysts and sensors. With the current surge of activity on building van der Waals heterostructures from atomically thin crystals, molecular self-assembly has the potential to add an extra level of flexibility and functionality for applications ranging from flexible electronics and OLEDs to novel electronic devices and spintronics.

Modelling Valence and Arousal in Facebook posts <=SEP=> Access to expressions of subjective personal posts increased with the popularity of Social Media. However, most of the work in sentiment analysis focuses on predicting only valence from text and usually targeted at a product, rather than affective states. In this paper, we introduce a new data set of 2895 Social Media posts rated by two psychologicallytrained annotators on two separate ordinal nine-point scales. These scales represent valence (or sentiment) and arousal (or intensity), which defines each post’s position on the circumplex model of affect, a well-established system for describing emotional states (Russell, 1980; Posner et al., 2005). The data set is used to train prediction models for each of the two dimensions from text which achieve high predictive accuracy – correlated at r = .65 with valence and r = .85 with arousal annotations. Our data set offers a building block to a deeper study of personal affect as expressed in social media. This can be used in applications such as mental illness detection or in automated large-scale psychological studies.

Gesture Recognition with a 3-D Accelerometer <=SEP=> Gesture-based interaction, as a natural way for human-computer interaction, has a wide range of applications in ubiquitous computing environment. This paper presents an acceleration-based gesture recognition approach, called FDSVM (Frame-based Descriptor and multi-class SVM), which needs only a wearable 3-dimensional accelerometer. With FDSVM, firstly, the acceleration data of a gesture is collected and represented by a frame-based descriptor, to extract the discriminative information. Then a SVM-based multi-class gesture classifier is built for recognition in the nonlinear gesture feature space. Extensive experimental results on a data set with 3360 gesture samples of 12 gestures over weeks demonstrate that the proposed FDSVM approach significantly outperforms other four methods: DTW, Naïve Bayes, C4.5 and HMM. In the user-dependent case, FDSVM achieves the recognition rate of 99.38% for the 4 direction gestures and 95.21% for all the 12 gestures. In the user-independent case, it obtains the recognition rate of 98.93% for 4 gestures and 89.29% for 12 gestures. Compared to other accelerometer-based gesture recognition approaches reported in literature FDSVM gives the best resulrs for both user-dependent and user-independent cases.

Efficient and Effective Solutions for Video Classification <=SEP=> 

Literature Review of Automatic Multiple Documents Text Summarization <=SEP=> For the blessing of World Wide Web, the corpus of online information is gigantic in its volume. Search engines have been developed such as Google, AltaVista, Yahoo, etc., to retrieve specific information from this huge amount of data. But the outcome of search engine is unable to provide expected result as the quantity of information is increasing enormously day by day and the findings are abundant. So, the automatic text summarization is demanded for salient information retrieval. Automatic text summarization is a system of summarizing text by computer where a text is given to the computer as input and the output is a shorter and less redundant form of the original text. An informative précis is very much helpful in our daily life to save valuable time. Research was first started naively on single document abridgement but recently information is found from various sources about a single topic in different website, journal, newspaper, text book, etc., for which multi-document summarization is required. In this paper, automatic multiple documents text summarization task is addressed and different procedure of various researchers are discussed. Various techniques are compared here that have done for multi-document summarization. Some promising approaches are indicated here and particular concentration is dedicated to describe different methods from raw level to similar like human experts, so that in future one can get significant instruction for further analysis.

Genome-Wide Regression and Prediction with the BGLR Statistical Package <=SEP=> Many modern genomic data analyses require implementing regressions where the number of parameters (p, e.g., the number of marker effects) exceeds sample size (n). Implementing these large-p-with-small-n regressions poses several statistical and computational challenges, some of which can be confronted using Bayesian methods. This approach allows integrating various parametric and nonparametric shrinkage and variable selection procedures in a unified and consistent manner. The BGLR R-package implements a large collection of Bayesian regression models, including parametric variable selection and shrinkage methods and semiparametric procedures (Bayesian reproducing kernel Hilbert spaces regressions, RKHS). The software was originally developed for genomic applications; however, the methods implemented are useful for many nongenomic applications as well. The response can be continuous (censored or not) or categorical (either binary or ordinal). The algorithm is based on a Gibbs sampler with scalar updates and the implementation takes advantage of efficient compiled C and Fortran routines. In this article we describe the methods implemented in BGLR, present examples of the use of the package, and discuss practical issues emerging in real-data analysis.

An Algorithm to Find Overlapping Community Structure in Networks <=SEP=> Abstract. Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint communities, but in many real-world networks communities overlap to some extent. We present a new algorithm for discovering overlapping communities in networks, by extending Girvan and Newman’s well-known algorithm based on the betweenness centrality measure. Like the original algorithm, ours performs hierarchical clustering — partitioning a network into any desired number of clusters — but allows them to overlap. Experiments confirm good performance on randomly generated networks based on a known overlapping community structure, and interesting results have also been obtained on a range of real-world networks.

Emotional Integration and Advertising Effectiveness : Case of Perfumes Advertising <=SEP=> This paper examines emotions in advertising, its effects and functioning. Using an interview-based experiment on 256 participants, we found that emotions perceived during an advertising exposure could play an important role in eliciting responses towards the ad and the brand. However, this process is true provided that consumers associate the perceived emotion to the exposed brand or its consumption experience. Furthermore, we have identified efficiency differences between magazine ads, depending on how they visually describe emotions. In particular, we study emotional integration in advertising, i.e. salience of emotions expressed towards the ad, the presence of core brand information and clarity of the advertising message about the hedonic attributes of consumption. Interestingly, the impact of the staging process of emotions is moderated by respondents-specific variables, including their need for emotion, tolerance for ambiguity, their need for structure and need for cognition. KeywordsEmotional Reactions ;Emotional Integration; Need for Emotion; Tolerance for Ambiguity; Need for Structure; Need for Cognition; Advertising Effectiveness.