信任缺失:新生代农民工身份建构与政治认同

新生代农民工城市融入的本质是新生代农民工与城市市民、城市社会组织及政治的互动与认同,这种互动与认同以信任为基础。其中人际信任、组织信任与政治信任分别构成新生代农民工身份建构的基础、融入城市的社会资本与政治认同的基础。由于当前社会人际信任缺失、组织信任匮乏与政治信任偏低,导致新生代农民工陷入身份建构与政治认同困境。因此只有通过修复新生代农民工的人际信任、增进其组织信任、重构政治信任方能构建起积极的身份认同。     

新疆文物保护和旅游开发应当走可持续发展道路

文物管理部门必须转变观念,面对发展中遇到的新问题,主动迎接挑战。总的思路是,对文物这种公共性资源,单纯强调保护或单纯强调开发利用都是片面的,应参照国际通行做法,坚持保护第一的原则,在保护和开发之间寻找一种平衡,走可持续发展的道路。     

优良学风是培养高质量人才的根本保证

本文从南昌航空工业学院多年来在学风建设方面所做的主要工作和取得的积极成果出发 ,系统地论述了学风建设对人才培养质量的重要作用 ,得出了优良学风是培养高质量人才的根本保证的基本结论 ,并对如何培育优良学风进行了积极的思考 ,提出了相应的对策。     

What is this moment we are caught in?

Our response to the question ‘What is this moment we are caught in?' is articulated through our collaborative reading of Berlant's (2011) Cruel Optimism (Durham, NC: Duke University Press). Cruel optimism, Berlant suggests, is a desire for something that undermines its own potentiality. As queer academics we expose the cruelty of our desires to live a good academic life, and we do so from our different positions as postdoctoral fellow, tenured academic and PhD candidate. In labouring to consolidate relationships and practices that hold the promise of our own sustainability, we give accounts of the material and affective work we perform to constitute what Berlant calls an intimate public, a collective space of mediation that functions as a key tactic to manage our academic life. These accounts take the form of three vignettes, each inflected by the specificities of our different positions and histories of becoming academics. We use Berlant as a point of departure to both interrogate practices of self‐management and find possibilities for a collective response to the moments in which we find ourselves caught.     

A modified common factor model for modelling mortality jointly for both sexes

Journal of Population Research - There is an increasing attention on the joint modelling of multiple populations. Populations are related in several ways, such as neighbouring countries, females...     

族群、族群认同与族群建构论的实践——以两岸客家和当代台湾族群建构为例

本文从族群概念的争鸣入手,以两岸客家和台湾族群的建构为实例,阐释了族群——族群认同——族群建构论这一组密切相关的概念的内涵,在肯定族群建构论合理性的同时,也指出了在台湾族群建构过程中建构论被过分夸大的负面影响。     

CRM赢回策略对消费者购买行为影响的实证研究

一直以来,营销学界都把客户关系管理(Customer Rehtionship Management)的重点放在如何获得新顾客和维持现有顾客身上,而流失顾客赢回管理工作的重要性却长久地被忽视.为了证明失而复得顾客的重要价值,作者把顾客在流失前、赢回后两个不同阶段的满意度和购买份额作对比分析,结果发现,赢回后的顾客满意度和购买份额较流失前显著增加;用关系投资或价格促销策略赢回来的顾客满意度和购买份额,较被关系投资或价格促销吸引来的新顾客满意度和购买份额显著提高;流失前,顾客满意度与购买份额之间拟合的函数曲线呈反S型,厂商策略对这一阶段的顾客行为影响不显著;赢回后,顾客满意度与购买份额之间拟合的函数曲线呈S型,赢回策略对这一阶段的顾客行为影响显著;满意度与购买份额拟合的函数曲线参考点发生了位移.     

服务业员工情绪劳动策略效能的实证研究

有关服务业中情绪劳动的管理研究正在引起关注。已有研究认为员工的情绪智力影响情绪劳动中的工作绩效、工作满意度以及工作压力感,本文进一步提出个体的情绪劳动策略对此起到中介作用。通过对电信服务业员工情绪智力、情绪劳动策略和工作绩效、工作满意度、压力感的实证分析,发现情绪劳动策略在情绪智力和员工的工作绩效、工作满意度和工作压力感之间起到部分中介作用。研究结果对服务型企业的人力资源管理实践具有一定的借鉴意义。     

A continuous characterization of the maximum vertex-weighted clique in hypergraphs

For a simple graph G on n vertices with adjacency matrix A, Motzkin and Strauss established a remarkable connection between the clique number and the global maximum value of the quadratic programm: \(\textit{max}\{ \mathbf {x}^T A \mathbf {x}\}\) on the standard simplex: \(\{\sum _{i=1}^{n} x_i =1, x_i \ge 0 \}\). In Gibbons et al. (Math Oper Res 122:754–768, 1997), an extension of the Motzkin–Straus formulation was provided for the vertex-weighted clique number of a graph. In this paper, we provide a continuous characterization of the maximum vertex-weighted clique problem for vertex-weighted uniform hypergraphs.     

Reliable Ad Hoc Routing Based on Mobility Prediction

Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, because some of the wireless links along a shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes may result in substantial data loss and message exchange overhead. In this paper, we study reliable ad hoc routing in the urban environment. Specifically, we formulate and study two optimization problems. In the minimum Cost Duration-bounded Path (CDP) routing problem, we seek a minimum cost source to destination path with duration no less than a given threshold. In the maximum Duration Cost-bounded Path (DCP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given threshold. We use a waypoint graph to model the working area of a MANET and present an offline algorithm to compute a duration prediction table for the given waypoint graph. An entry in the duration prediction table contains the guaranteed worst-case duration of the corresponding wireless link. We then present an efficient algorithm which computes a minimum cost duration-bounded path, using the information provided in the duration prediction table. We also present a heuristic algorithm for the DCP routing problem. In addition, we show that the proposed prediction and routing schemes can be easily applied for designing reliable ad hoc routing protocols. Simulation results show that our mobility prediction based routing algorithms lead to higher network throughput and longer average path duration, compared with the shortest path routing. This research was supported in part by ARO grant W911NF-04-1-0385 and NSF grant CCF-0431167. The information reported here does not reflect the position or the policy of the federal government.