Innovation, interaction, and inclusion : heritage luxury brands in collusion with the consumer

Many luxury heritage brands operate on the misconception that heritage is interchangeable with history rather than representative of the emotional response they originally developed in their customer. This idea of heritage as static history inhibits innovation, prevents dynamic renewal and impedes their ability to redefine, strengthen and position their brand in current and emerging marketplaces. This paper examines a number of heritage luxury brands that have successfully identified the original emotional responses they developed in their customers and, through innovative approaches in design, marketing, branding and distribution evoke these responses in contemporary consumers. Using heritage and innovation hand-in-hand, these brands have continued to grow and develop a vision of heritage that incorporates both historical and contemporary ideas to meet emerging customer needs. While what constitutes a ‘luxury’ item is constantly challenged in this era of accessible luxury products, up scaling and aspirational spending, this paper sees consumers’ emotional needs as the key element in defining the concept of luxury. These emotional qualities consistently remain relevant due to their ability to enhance a positive sense of identity for the brand user. Luxury is about the ‘experience’ not just the product providing the consumer with a sense of enhanced status or identity through invoked feelings of exclusivity, authenticity, quality, uniqueness and culture. This paper will analyse luxury heritage brands that have successfully combined these emotional values with those of their ‘heritage’ to create an aura of authenticity and nostalgia that appeals to contemporary consumers. Like luxury, the line where clothing becomes fashion is blurred in the contemporary fashion industry; however, consumer emotion again plays an important role. For example, clothing becomes ‘fashion’ for consumers when it affects their self perception rather than fulfilling basic functions of shelter and protection. Successful luxury heritage brands can enhance consumers’ sense of self by involving them in the ‘experience’ and ‘personality’ of the brand so they see it as a reflection of their own exclusiveness, authentic uniqueness, belonging and cultural value. Innovation is a valuable tool for heritage luxury brands to successfully generate these desired emotional responses and meet the evolving needs of contemporary consumers. While traditionally fashion has been a monologue from brand to consumer, new technology has given consumers a voice to engage brands in a conversation to express their evolving needs, ideas and feedback. As a result, in this consumer-empowered era of information sharing, this paper defines innovation as the ability of heritage luxury brands to develop new design and branding strategies in response to this consumer feedback while retaining the emotional core values of their heritage. This paper analyses how luxury heritage brands can effectively position themselves in the contemporary marketplace by separating heritage from history to incorporate innovative strategies that will appeal to consumer needs of today and tomorrow.

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d = VC(F) bound on the graph density of a subgraph of the hypercube—oneinclusion graph. The first main result of this paper is a density bound of n [n−1 <=d-1]/[n <=d] < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d contractible simplicial complexes, extending the well-known characterization that d = 1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VCdimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(logn) and is shown to be optimal up to an O(logk) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout.

Corrigendum to “Shifting : one-inclusion mistake bounds and sample compression” [J. Comput. System Sci. 75 (1) (2009) 37–59]

H. Simon and B. Szörényi have found an error in the proof of Theorem 52 of “Shifting: One-inclusion mistake bounds and sample compression”, Rubinstein et al. (2009). In this note we provide a corrected proof of a slightly weakened version of this theorem. Our new bound on the density of one-inclusion hypergraphs is again in terms of the capacity of the multilabel concept class. Simon and Szörényi have recently proved an alternate result in Simon and Szörényi (2009).

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d=VC(F) bound on the graph density of a subgraph of the hypercube—one-inclusion graph. The first main result of this report is a density bound of n∙choose(n-1,≤d-1)/choose(n,≤d) < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d-contractible simplicial complexes, extending the well-known characterization that d=1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VC-dimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(log n) and is shown to be optimal up to a O(log k) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout

Are low CO2 emitters in rural areas also socially excluded? An empirical investigation of travel diary data from rural Northern Ireland

The reduction of CO2 emissions and social exclusion are two key elements of UK transport strategy. Despite intensive research on each theme, little effort has so far been made linking the relationship between emissions and social exclusion. In addition, current knowledge on each theme is limited to urban areas; little research is available on these themes for rural areas. This research contributes to this gap in the literature by analysing 157 weekly activity-travel diary data collected from three case study areas with differential levels of area accessibility and area mobility options, located in rural Northern Ireland. Individual weekly CO2 emission levels from personal travel diaries (both hot exhaust emission and cold-start emission) were calculated using average speed models for different modes of transport. The socio-spatial patterns associated with CO2 emissions were identified using a general linear model whereas binary logistic regression analyses were conducted to identify mode choice behaviour and activity patterns. This research found groups that emitted a significantly lower level of CO2 included individuals living in an area with a higher level of accessibility and mobility, non-car, non-working, and low-income older people. However, evidence in this research also shows that although certain groups (e.g. those working, and residing in an area with a lower level of accessibility) emitted higher levels of CO2, their rate of participation in activities was however found to be significantly lower compared to their counterparts. Based on the study findings, this research highlights the need for both soft (e.g. teleworking) and physical (e.g. accessibility planning) policy measures in rural areas in order to meet government’s stated CO2 reduction targets while at the same time enhancing social inclusion.

Numerical methods for second-order stochastic differential equations

We seek numerical methods for second‐order stochastic differential equations that reproduce the stationary density accurately for all values of damping. A complete analysis is possible for scalar linear second‐order equations (damped harmonic oscillators with additive noise), where the statistics are Gaussian and can be calculated exactly in the continuous‐time and discrete‐time cases. A matrix equation is given for the stationary variances and correlation for methods using one Gaussian random variable per timestep. The only Runge–Kutta method with a nonsingular tableau matrix that gives the exact steady state density for all values of damping is the implicit midpoint rule. Numerical experiments, comparing the implicit midpoint rule with Heun and leapfrog methods on nonlinear equations with additive or multiplicative noise, produce behavior similar to the linear case.