Inviting Strangers to Participate in Collaborative Consumption through Mobile App

ABSTRACT

Mobile technology has facilitated an emerging form of consumption practices called collaborative consumption. In this study, we investigate one such manifestation whereby merchants send group discount coupons to nearby consumers and encourage them to invite surrounding people to enjoy the discount together. We are interested to know if timing (morning vs. afternoon) and message framing (active vs. passive mutual helping tone) would increase the chance of an individual deciding to invite strangers (and invite a higher proportion of strangers if they did) to participate in the collaborative consumption. Facilitating the participation among strangers can help elevate the reach and influence of collaborative consumption, allowing its potential to be better exploited. Our field experiment findings show that in general people are more likely to invite strangers (and also a higher proportion of strangers in all their invitations) in the morning than in the afternoon. In addition, a message framed to ask the focal individual to actively help others enjoy the deal (active tone) is more effective than a message framed passively, i.e., to let others help him/her (passive tone) in the morning. However, passive tone framing can induce individuals to invite a higher proportion of strangers in the afternoon if they did invite others. These findings have important implications to merchants and app providers on how to more fully tap into the potential of collaborative consumption via mobile technology.     

采用碳足迹分析的产品低碳优化设计

为了给低碳产品开发提供辅助支持,采用模块化思想和生命周期分析方法建立了基于产品结构的碳足迹分析模型;基于敏感性分析方法研究关键低碳设计参数变化与碳排放变化之间的映射关系,在对分析结果进行处理的基础上,以各低碳设计参数改进引起的碳足迹最小为优化目标,构建关键模块单元低碳设计改进的多约束目标优化模型,并采用回溯算法和遗传算法对优化模型进行求解.最后以洗碗机为例,验证了文中方法的可行性和有效性.     

基于工作任务的“4-5-6”情景化项目驱动教学模式的设计与实践

目前我国高职教育正处于改革的重要阶段,创新课程的教学模式,是高职教育的要求,也是课程建设与职业岗位有效接轨的要求。基于工作任务的"4-5-6"情景化项目驱动教学模式,是以职业能力培养为目标,围绕"岗位工作任务"这一主题,以"4"个阶段来划分能力培养过程,以"5"化教学作为教学设计,以"6"个步骤作为教学实施的教学法。通过在Linux操作系统课程教学中的改革实践表明,该教学模式培养了学生的自我学习能力和创造力,提高了学生的职业能力。     

New series expansions for fundamental solutions of linear elastostatics in 2D

Series expansions of fundamental solutions are essential to algorithms and analysis of the null field method (NFM) and to analysis of the method of fundamental solutions (MFS). For linear elastostatics, new Fourier series expansions of FS are derived, directly from integration. The new expansions of the FS are simpler than those in Chen et?al. (J Mech 26(3):393?C401, 2010), thus facile to application in NFM and MFS. The new series expansions of FS in this paper are important to both theory and computation of linear elastostatics. Some computation of the MFS for linear elastostatics is provided, where the expansions of fundamental solutions are a basis tool in analysis. Numerical results of a simple example are reported, accompanied with error analysis.     

New receipt-free voting scheme using double-trapdoor commitment

It is considered to be the most suitable solution for large scale elections to design an electronic voting scheme using blind signatures and anonymous channels. Based on this framework, Okamoto first proposed a receipt-free voting scheme [30] for large scale elections. However, in the following paper, Okamoto [31] proved that the scheme [30] was not receipt-free and presented two improved schemes. One scheme requires the help of the parameter registration committee and the other needs a stronger physical assumption of the voting booth. In this paper, we utilize the double-trapdoor commitment to propose a new receipt-free voting scheme based on blind signatures for large scale elections. Neither the parameter registration committee nor the voting booth is required in our scheme. We also present a more efficient zero-knowledge proof for secret permutation. Therefore, our scheme is much more efficient than Okamoto’s schemes [30] and [31] with the weaker physical assumptions. Moreover, we prove that our scheme can achieve the desired security properties.     

A Complex View of Barycentric Mappings

Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex functions has various advantages when interpolating two‐dimensional data in the plane, and in particular for holomorphic maps. We extend and generalize these results by investigating the complex representation of real‐valued barycentric coordinates, when applied to planar domains. We show how the construction for generating real‐valued barycentric coordinates from a given weight function can be applied to generating complex‐valued coordinates, thus deriving complex expressions for the classical barycentric coordinates: Wachspress, mean value, and discrete harmonic. Furthermore, we show that a complex barycentric map admits the intuitive interpretation as a complex‐weighted combination of edge‐to‐edge similarity transformations, allowing the design of “home‐made” barycentric maps with desirable properties. Thus, using the tools of complex analysis, we provide a methodology for analyzing existing barycentric mappings, as well as designing new ones.     

Collision and intersection detection of two ruled surfaces using bracket method

Collision and intersection detection of surfaces is an important problem in computer graphics and robotic engineering. A key idea of our paper is to use the bracket method to derive the necessary and sufficient conditions for the collision of two ruled surfaces. Then the numerical intersection curve can be characterized. The cases for two bounded ruled surfaces are also discussed.     

Strong stability of the mono-tubular heat exchanger equation with output feedback

We investigate asymptotic behavior of the C₀-semigroup T(t) associated with the mono-tubular heat exchanger equation with output feedback by a perturbation method. It is shown that T(t) is bounded if a constraint is satisfied by the parameters and the spatial distribution function. Further, applying the Arendt-Batty-Lyubich-Vu theorem, a criterion is established to judge strong stability of T(t).     

一种基于码本聚类的低复杂度用户选择算法

现有块对角化(BD)预编码系统用户选择算法较少考虑利用已选用户与剩余用户之间的关系来排除不可选用户.针对这点不足,给出了一种采用码本聚类的低复杂度用户选择算法( CodeGreedy算法).该算法采用弦距离刻画用户信道的相关性,以此为依据将用户划分到不同码本空间中,聚集在同一码本空间的用户信道具有较强的相关性,形成互斥...