首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   26433篇
  免费   361篇
  国内免费   5篇
  2024年   13篇
  2023年   78篇
  2022年   102篇
  2021年   130篇
  2020年   179篇
  2019年   175篇
  2018年   3698篇
  2017年   3028篇
  2016年   2460篇
  2015年   368篇
  2014年   290篇
  2013年   966篇
  2012年   1041篇
  2011年   2816篇
  2010年   2756篇
  2009年   1640篇
  2008年   2046篇
  2007年   2451篇
  2006年   324篇
  2005年   449篇
  2004年   318篇
  2003年   273篇
  2002年   212篇
  2001年   99篇
  2000年   145篇
  1999年   69篇
  1998年   59篇
  1997年   42篇
  1996年   36篇
  1995年   23篇
  1994年   23篇
  1993年   23篇
  1992年   37篇
  1991年   37篇
  1990年   35篇
  1989年   31篇
  1988年   29篇
  1987年   20篇
  1986年   13篇
  1985年   15篇
  1984年   19篇
  1983年   15篇
  1982年   11篇
  1979年   19篇
  1978年   11篇
  1976年   16篇
  1974年   14篇
  1973年   11篇
  1970年   11篇
  1968年   15篇
排序方式: 共有10000条查询结果,搜索用时 78 毫秒
81.
82.
How can we explain that an assertion on something perceived can be understood in the same manner by somebody who cannot perceive that scene? This problem bases the interest in computational linguistics in how listener modeling could possibly be harmonized with reference semantics. Mental images substituting real perception appear as a way out. The architecture of the listener model has to be adapted to the creation and use of such pictorial data structures. Furthermore, the relation between the latter and a verbal (i. e., propositional) representation must be understood. The resulting architecture of a listener model with reference semantics can be employed to solve communicational problems from three general classes in a better way, as is demonstrated by an example implementation.  相似文献   
83.
84.
85.
86.
87.
Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of ordern ×n as a linear combination of 1/2n(n+1) fixed rank one matrices, thus constructing an explicit tensor basis for the set of symmetricn ×n matrices. Zellini's decomposition is based on properties of persymmetric matrices. In the present paper, a simplified tensor basis is given, by showing that a symmetric matrix can also be decomposed in terms of 1/2n(n+1) fixed binary matrices of rank one. The decomposition implies that ann ×n ×p array consisting ofp symmetricn ×n slabs has maximal rank 1/2n(n+1). Likewise, an unconstrained INDSCAL (symmetric CANDECOMP/PARAFAC) decomposition of such an array will yield a perfect fit in 1/2n(n+1) dimensions. When the fitting only pertains to the off-diagonal elements of the symmetric matrices, as is the case in a version of PARAFAC where communalities are involved, the maximal number of dimensions can be further reduced to 1/2n(n–1). However, when the saliences in INDSCAL are constrained to be nonnegative, the tensor basis result does not apply. In fact, it is shown that in this case the number of dimensions needed can be as large asp, the number of matrices analyzed.  相似文献   
88.
Rajeev Goré 《Studia Logica》1994,53(3):433-457
We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logicsS4.3, S4.3.1 andS4.14. When the modality is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points.Although cut-free, the last two systems do not possess the subformula property. But for any given finite set of formulaeX the superformulae involved are always bounded by a finite set of formulaeX* L depending only onX and the logicL. Thus each system gives a nondeterministic decision procedure for the logic in question. The completeness proofs yield deterministic decision procedures for each logic because each proof is constructive.Each tableau system has a cut-free sequent analogue proving that Gentzen's cut-elimination theorem holds for these latter systems. The techniques are due to Hintikka and Rautenberg.Presented byDov M. Gabbay  相似文献   
89.
Increasingly, contemporary medical ethicists have become aware of the need to explicate a foundation for their various models of applied ethics. Many of these theories are inspired by the apparent incompatibility of patient autonomy and provider beneficence. The principle of patient autonomy derives its current primacy to a large extent from its legal origins. However, this principle seems at odds with the clinical reality. In the bioethical literature, the notion of authenticity has been proposed as an alternative foundational principle to autonomy. This article examines this proposal in reference to various existentialist philosophers (Heidegger, Sartre, Camus and Marcel). It is concluded that the principle of autonomy fails to do what it is commonly supposed to do: provide a criterion of distinction that can be invoked to settle moral controversies between patients and providers. The existentialist concept of authenticity is more promising in at least one crucial respect: It acknowledges that the essence of human life disappears from sight if life's temporal character is reduced to a series of present decisions and actions. This also implies that the very quest for a criterion that allows physicians to distinguish between sudden, unexpected decisions of their patients to be or not to be respected, without recourse to the patient's past or future, is erroneous.  相似文献   
90.
Effects of the similarity between target and distractors in a visual search task were investigated in several experiments. Both familiar (numerals and letters) and unfamiliar (connected figures in a 5 × 5 matrix) stimuli were used. The observer had to report on the presence or absence of a target among a variable number of homogeneous distractors as fast and as accurately as possible. It was found that physical difference had the same clear effect on processing time far familiar and for unfamiliar stimuli: processing time decreased monotonically with increasing physical difference. Distractors unrelated to the target and those related to the target by a simple transformation (180° rotation, horizontal or vertical reflection) were also compared, while the physical difference was kept constant. For familiar stimuli, transformational relatedness increased processing time in comparison with that fort unrelated stimulus pairs. It was further shown in a scaling experiment that this effect could be accounted for by the amount of perceived similarity of the target-distractor pairs. For unfamiliar stimuli, transformational relatedness did have a smaller and less pronounced effect. Various comparable unrelated distractors resulted in a full range of processing times. Results from a similarity scaling experiment correlated well with the outcome of the experiments with unfamiliar stimuli. These results are interpreted in terms of an underlying continuum of perceived similarity as the basis of the speed of visual search, rather than a dichotomy of parallel versus serial processing.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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