首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   471篇
  免费   15篇
  国内免费   2篇
管理学   5篇
民族学   1篇
人口学   5篇
丛书文集   38篇
理论方法论   7篇
综合类   335篇
社会学   23篇
统计学   74篇
  2021年   2篇
  2020年   2篇
  2019年   2篇
  2018年   7篇
  2017年   5篇
  2016年   6篇
  2015年   13篇
  2014年   20篇
  2013年   31篇
  2012年   34篇
  2011年   38篇
  2010年   23篇
  2009年   29篇
  2008年   38篇
  2007年   36篇
  2006年   44篇
  2005年   32篇
  2004年   30篇
  2003年   22篇
  2002年   20篇
  2001年   16篇
  2000年   10篇
  1999年   8篇
  1998年   2篇
  1997年   2篇
  1996年   3篇
  1995年   1篇
  1994年   3篇
  1993年   2篇
  1992年   1篇
  1991年   1篇
  1990年   2篇
  1988年   1篇
  1984年   1篇
  1980年   1篇
排序方式: 共有488条查询结果,搜索用时 15 毫秒
1.
We sought to evaluate the efficacy of successive matching training for establishing generalized reflexive matching across 4 children with autism. In Experiment 1, differential reinforcement with delay fading was efficacious in establishing “yes” and “no” matching and nonmatching responses in 2 participants when 2 identical or nonidentical picture stimuli were presented. In addition, emergent visual–visual reflexive relational responses were observed using novel picture stimuli in a transfer test phase. In Experiment 2, differential reinforcement alone was efficacious in establishing matching and nonmatching responses in the other 2 participants when 2 identical or nonidentical objects were presented. Transfer to identical objects presented through touch (i.e., tactile discrimination) was additionally observed for both participants. Procedures in the study were adapted from the PEAK Relational Training System to aid in clinical replication, and the translational results have implications for language training with individuals with autism.  相似文献   
2.
Two symmetrical fractional factorial designs are said to be combinatorially equivalent if one design can be obtained from another by reordering the runs, relabeling the factors and relabeling the levels of one or more factors. This article presents concepts of ordered distance frequency matrix, distance frequency vector, and reduced distance frequency vector for a design. Necessary conditions for two designs to be combinatorial equivalent based on these concepts are presented. A new algorithm based on the results obtained is proposed to check combinatorial non-equivalence of two factorial designs and several illustrating examples are provided.  相似文献   
3.
For a fixed positive integer k, limit laws of linearly normalized kth upper order statistics are well known. In this article, a comprehensive study of tail behaviours of limit laws of normalized kth upper order statistics under fixed and random sample sizes is carried out using tail equivalence which leads to some interesting tail behaviours of the limit laws. These lead to definitive answers about their max domains of attraction. Stochastic ordering properties of the limit laws are also studied. The results obtained are not dependent on linear norming and apply to power norming as well and generalize some results already available in the literature. And the proofs given here are elementary.  相似文献   
4.
In this paper, locally D-optimal saturated designs for a logistic model with one and two continuous input variables have been constructed by modifying the famous Fedorov exchange algorithm. A saturated design not only ensures the minimum number of runs in the design but also simplifies the row exchange computation. The basic idea is to exchange a design point with a point from the design space. The algorithm performs the best row exchange between design points and points form a candidate set representing the design space. Naturally, the resultant designs depend on the candidate set. For gain in precision, intuitively a candidate set with a larger number of points and the low discrepancy is desirable, but it increases the computational cost. Apart from the modification in row exchange computation, we propose implementing the algorithm in two stages. Initially, construct a design with a candidate set of affordable size and then later generate a new candidate set around the points of design searched in the former stage. In order to validate the optimality of constructed designs, we have used the general equivalence theorem. Algorithms for the construction of optimal designs have been implemented by developing suitable codes in R.  相似文献   
5.
由于负载着特殊的民族文化内涵,中国文化负载词往往成为信息传递的障碍,也构成了翻译中的难点。在翻译文化负载词的过程中,力求实现文化等值已成为翻译界的更高标准,也是翻译文化负载词时归化和异化策略选择的依据。归化和异化策略各有侧重,它们不是互相矛盾,而是相辅相成的。灵活适当的归化和异化不仅能够很好地将源语中的文化信息传递到目的语中,而且更易于被读者接受。  相似文献   
6.
经典的作品一经译介,往往会有许多重译本.受译作产生年代、所处社会环境及译入语语言发展变化等因素的影响,同一著作的不同译本往往会有所不同.本文以奈达的功能对等理论为基础,对《警察与赞美诗》两个中译本——李文俊和潘明元译本进行比较研究,兼探讨功能对等理论在翻译实践中的应用和意义.本文尝试以这一理论为基础,通过对翻译文本和例句的分析,重点探讨两译本中选词、句式以及风格等方面的差异及在翻译实践中的一些规律,力图从不同的角度丰富翻译理论及实践.  相似文献   
7.
作为一类特殊文本,法律的翻译必须将准确性置于首要位置.奈达的功能对等理论为法律翻译提供了切实可行的指导思想.文章从词汇、句子、篇章及文体四个方面探讨了功能对等理论在法律翻译中的具体应用,并得出结论:法律翻译应尽量追求原文与文本的功能对等.  相似文献   
8.
破产概率是非寿险保险风险理论的核心问题。与经典的Cramér-Lundberg模型相比, 由Li Zehui等建立的现代风险模型更为准确地描述了非寿险保险运营的主要特征, 对现实保险业务具有较好的解释力。本文基于现代风险模型, 考虑保险公司多个险种混合经营这一更为现实的情形, 在索赔额服从正则尾分布条件下获得了破产概率的渐近等价估计。我们发现, 在具有大额索赔特征的多个险种混合的条件下, 公司面临的极端索赔风险将由索赔额分布尾部最厚的那些险种决定, 而索赔额分布尾部相对较薄的那些险种的影响作用将被淹没。该结论的有效性可用MATLAB数值模拟得到理想的验证。本文结果是对风险模型研究的重要推广, 也为多险种混合情形下保险公司的风险控制与初始保证金界定提供了依据。  相似文献   
9.
We propose localized spectral estimators for the quadratic covariation and the spot covolatility of diffusion processes, which are observed discretely with additive observation noise. The appropriate estimation for time‐varying volatilities is based on an asymptotic equivalence of the underlying statistical model to a white‐noise model with correlation and volatility processes being constant over small time intervals. The asymptotic equivalence of the continuous‐time and discrete‐time experiments is proved by a construction with linear interpolation in one direction and local means for the other. The new estimator outperforms earlier non‐parametric methods in the literature for the considered model. We investigate its finite sample size characteristics in simulations and draw a comparison between various proposed methods.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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