首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   69篇
  免费   5篇
管理学   16篇
人口学   3篇
理论方法论   21篇
综合类   1篇
社会学   26篇
统计学   7篇
  2024年   1篇
  2023年   1篇
  2022年   1篇
  2019年   3篇
  2018年   1篇
  2017年   3篇
  2016年   2篇
  2015年   1篇
  2014年   2篇
  2013年   7篇
  2012年   3篇
  2011年   3篇
  2010年   1篇
  2009年   2篇
  2008年   3篇
  2007年   4篇
  2006年   3篇
  2005年   3篇
  2003年   1篇
  2002年   1篇
  2001年   2篇
  1999年   1篇
  1998年   2篇
  1997年   4篇
  1996年   3篇
  1995年   1篇
  1993年   4篇
  1992年   1篇
  1990年   1篇
  1989年   2篇
  1988年   5篇
  1982年   1篇
  1973年   1篇
排序方式: 共有74条查询结果,搜索用时 187 毫秒
71.
Early research in the field of bereavement and widowhood was often problem generated and focused on intrapersonal issues such as health consequences. More recent research has emphasized that, to understand the grieving individual, we must also understand the social context in which the bereavement occurred and in which recovery must progress. This introduction traces the historical development of theory, empirical research, and methodology in the field, and places current developments in perspective. The papers in this issue underline the complexity of the bereavement phenomenon, and the need for conceptual perspectives with which to understand the cultural, socioeconomic, interpersonal, and physiological determinants of grief, mourning, and recovery.  相似文献   
72.
73.
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from Istrate et al. (2006), that incorporates information on both arrival times, and the dynamics of packet IDs. An important component of this model is a many-to-one mapping FB from sequences of IDs into a sequence of buffer sizes. We show that: i) Given a buffer sequence B, constructing a sequence A of IDs that belongs to the preimage of B is no harder than finding matchings in bipartite graph. ii) Counting the number of sequences A of packet IDs that belong to the preimage of B can be done in linear time in the special case when there exists a constant upper bound on the maximum entry in B. iii) This problem also has a fully polynomial randomized approximation scheme when we have a constant upper bound on the number of repeats in the packet sequences in the preimage. We also provide experimental evidence that the two previous results suffice to efficiently count the number of preimages for buffer sequences observed in real TCP data.  相似文献   
74.
Moral philosophy is a rich tradition that contains many alternative approaches to determining what is right and wrong. A limited account that only considers (hedonistic) utilitarianism and deontology cannot do justice to moral philosophy. It is necessary to also consider the many other general-purpose moral theories that have been proposed, as well as the approaches developed in various branches of applied ethics, such as healthcare ethics, the ethics of technology, and the ethics of risk.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号