安徽农村金融发展现状、问题及对策

本文回顾了安徽农村金融发展的基本概况,分析了其存在的突出矛盾和问题,提出从六个方面着力改善农村金融服务的对策。     

对具体语境下"诗缘情"的解读——细读陆机《文赋》

本文在分析《文赋》的基础上,通过对《诗经》的以及后世文体发展的探讨,阐述了对“诗缘情”一说的理解,并试图对陆机相对于传统儒家文论的突破(而不是反叛)作出自己的解释。     

解苦以求安宁：韧性视角下老年人的临终生命质量探究

随着人口死亡模式的转变与老龄化进程的加快,老年人的临终生命质量已成为大众关注的社会问题。本研究参考“身心灵平衡”韧性整合模型构建分析框架,运用半结构式访谈法与实物分析法,深入探索影响老年人临终生命质量的风险性与保护性因素及其作用路径。研究指出,身体的衰弱与疾痛和心理的情绪困扰是老年临终生命质量的风险性因素,它们均会损害老年人原有的平衡状态,且身心二者的负面影响存在相互强化的作用;而内在的灵性能力和外在的社会支持作为保护性因素,能够帮助老年人增强死亡准备、重构生命状态。基于上述结论,研究从身心社灵四个维度重点讨论了社会工作介入老年安宁疗护的发展方向。     

欧盟民商事管辖权规则的嬗变——从《布鲁塞尔公约》到《布鲁塞尔条例》

欧盟的民商事管辖权规则经历了从《布鲁塞尔公约》到《布鲁塞尔条例》、《布鲁塞尔条例Ⅱ》和《布鲁塞尔条例Ⅱa》一个不断发展和完善的过程。在该过程中,欧盟所确立的直接国际管辖权制度从一般民商事领域延伸至特殊民商事领域,并以多种连结点作为确定管辖权的依据,而且,管辖权规则在立法形式上实现了由公约向条例的转变,强化了欧盟法的直接效力。     

瑞昌市发展战略定位探讨

瑞昌市处于以长江黄金水段、京九铁路和发展中的公路为依托的点轴系统中,可以充分利用其独特的区位优势和自然资源优势,通过在沿江产业带中进行合理的区域分工,找准其产业定位,进而调整经济结构,同时借助九江出口加工区的建立,组建工业产业集群,促进瑞昌市经济大发展。     

Transparency and Resource Allocation of Grassroots Nonprofits in China

VOLUNTAS: International Journal of Voluntary and Nonprofit Organizations - Organizational transparency has become a prominent concern for the nonprofit sector as it expands globally. Transparency...     

制度自信:民族区域自治制度是解决当代中国民族问题的基本政治制度——“三个自信”与中国民族问题研究系列论文之四

民族区域自治制度的产生、发展与完善取决于我国的历史传承与现实国情,是中国共产党解决当代中国民族问题的基本政治制度.民族问题研究“去政治化”、第二代民族政策等观点的实质就是质疑乃至否定我国的民族政策和民族区域自治制度.坚持民族区域自治制度自信,就是要坚持“三是”、“两必须”、“三不容”的原则,从而促进各民族的团结,增强各民族的国家认同,维护国家领土和主权的统一.     

Benevolence-dominant,authoritarianism-dominant,and classical paternalistic leadership: Testing their relationships with subordinate performance

We propose a new typology of paternalistic leadership styles based on how leaders demonstrate authoritarianism and benevolence, the two essential components of this type of leadership. Benevolence-dominant paternalistic leadership refers to leaders' sole dependence on the use of benevolence without their strong assertion of authority, whereas authoritarianism-dominant paternalistic leadership is based mainly on authoritarianism itself; classical paternalistic leadership, which best fits early observations of paternalistic leaders, refers to the salient combination of both leadership components. We used two distinct samples and methods to test this typology and the association with subordinate performance. Across the two studies, a field investigation with Taiwanese military supervisor-subordinate dyads and a hypothetical scenario experiment with U.S. working adults, we found a positive relationship between classical paternalistic leadership and subordinate performance as strong as that between benevolence-dominant paternalistic leadership and performance. Our findings echo the phenomenon that paternalistic leaders tend to combine benevolence with authoritarianism to affect subordinate performance.     

Relation between the skew-rank of an oriented graph and the independence number of its underlying graph

An oriented graph \(G^\sigma \) is a digraph without loops or multiple arcs whose underlying graph is G. Let \(S\left( G^\sigma \right) \) be the skew-adjacency matrix of \(G^\sigma \) and \(\alpha (G)\) be the independence number of G. The rank of \(S(G^\sigma )\) is called the skew-rank of \(G^\sigma \), denoted by \(sr(G^\sigma )\). Wong et al. (Eur J Comb 54:76–86, 2016) studied the relationship between the skew-rank of an oriented graph and the rank of its underlying graph. In this paper, the correlation involving the skew-rank, the independence number, and some other parameters are considered. First we show that \(sr(G^\sigma )+2\alpha (G)\geqslant 2|V_G|-2d(G)\), where \(|V_G|\) is the order of G and d(G) is the dimension of cycle space of G. We also obtain sharp lower bounds for \(sr(G^\sigma )+\alpha (G),\, sr(G^\sigma )-\alpha (G)\), \(sr(G^\sigma )/\alpha (G)\) and characterize all corresponding extremal graphs.     

A simpler PTAS for connected <Emphasis Type="Italic">k</Emphasis>-path vertex cover in homogeneous wireless sensor network

Because of its application in the field of security in wireless sensor networks, k-path vertex cover (\(\hbox {VCP}_k\)) has received a lot of attention in recent years. Given a graph \(G=(V,E)\), a vertex set \(C\subseteq V\) is a k-path vertex cover (\(\hbox {VCP}_k\)) of G if every path on k vertices has at least one vertex in C, and C is a connected k-path vertex cover of G (\(\hbox {CVCP}_k\)) if furthermore the subgraph of G induced by C is connected. A homogeneous wireless sensor network can be modeled as a unit disk graph. This paper presents a new PTAS for \(\hbox {MinCVCP}_k\) on unit disk graphs. Compared with previous PTAS given by Liu et al., our method not only simplifies the algorithm and reduces the time-complexity, but also simplifies the analysis by a large amount.