1,724,240 research outputs found
Integrity by Cheng Yi and Cheng Hao and its Modern Revelation
No full text解析了程颢和程颐的“诚“思想:他们认为天道、人道以及天人合一之道的最高境界就是“诚“,“诚“是天理的根本道德属性,是人伦的最高道德标准,是天人合一的中介。在此基础上提出,二程的“诚“思想的现代意义更多的应该是体现在对于民众注重修德成善、安身立命的内在价值的取向和引导上。This paper reviews the thought of integrity by Cheng Yi and Cheng Hao,who deem that Integrity is the supremacy of Heaven,Humanity and the heaven,humanity unity,the fundamental moral nature of Heaven principles,the highest moral criteria of human relations and the harmony between heaven and man.The writer holds that the contemporary study of integrity by Cheng Yi and Cheng Hao should focus on raising the public awareness and respect of integrity for one's moral growth and enhancement
Building a trust model in the online market place
No full textWith the advancement of technology, online shopping is becoming a new forum for people who wish to purchase goods and products more conveniently. One of the major setbacks in doing this is the establishment of trust between sellers and buyers, which has proved to be difficult. How can trust be established online? What do organisations have to do in order to gain trust from its online consumers and making sure they will come back more regularly? First of all, we have to find out what consumers expect from online shopping and then how trust can be established accordingly. In this paper we consider all relevant factors that contribute to online shopping from consumer's point of view, and also examine what organisations should provide in terms of trust building. Furthermore, we propose a model of trust that can be utilised in developing an online virtual forum
Worst-Case and Average-Case Hardness of Hypercycle and Database Problems
Get PDFIn this paper we present tight lower-bounds and new upper-bounds for hypergraph and database problems. We give tight lower-bounds for finding minimum hypercycles. We give tight lower-bounds for a substantial regime of unweighted hypercycle. We also give a new faster algorithm for longer unweighted hypercycles. We give a worst-case to average-case reduction from detecting a subgraph of a hypergraph in the worst-case to counting subgraphs of hypergraphs in the average-case. We demonstrate two applications of this worst-case to average-case reduction, which result in average-case lower bounds for counting counting hypercycles in random hypergraphs and queries in average-case databases. Our tight upper and lower bounds for hypercycle detection in the worst-case have immediate implications for the average-case via our worst-case to average-case reductions
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
