首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   27377篇
  免费   396篇
  国内免费   5篇
  2024年   16篇
  2023年   95篇
  2022年   127篇
  2021年   167篇
  2020年   206篇
  2019年   216篇
  2018年   3763篇
  2017年   3084篇
  2016年   2506篇
  2015年   389篇
  2014年   320篇
  2013年   1086篇
  2012年   1077篇
  2011年   2855篇
  2010年   2800篇
  2009年   1646篇
  2008年   2084篇
  2007年   2477篇
  2006年   351篇
  2005年   487篇
  2004年   345篇
  2003年   292篇
  2002年   228篇
  2001年   104篇
  2000年   155篇
  1999年   94篇
  1998年   63篇
  1997年   49篇
  1996年   42篇
  1995年   28篇
  1994年   34篇
  1993年   26篇
  1992年   45篇
  1991年   35篇
  1990年   36篇
  1989年   35篇
  1988年   31篇
  1987年   27篇
  1986年   15篇
  1985年   21篇
  1984年   22篇
  1983年   16篇
  1979年   18篇
  1976年   19篇
  1974年   17篇
  1973年   18篇
  1972年   14篇
  1971年   18篇
  1968年   23篇
  1965年   14篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Per-erik Malmnäs 《Synthese》1994,99(2):233-249
It is argued that existing axiomatic theories of utility do not provide the utility principle or the principle of maximising expected utility with a formal justification. It is also argued that these theories only put mild constraints on a decision-maker in a decision-context. Finally, it is argued that the prospects are not particularly bright for finding formal non-circular arguments for the utility principle that do not rely on the law of large numbers.  相似文献   
102.
103.
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.  相似文献   
104.
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  相似文献   
105.
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.  相似文献   
106.
Angular induction is the process by which one line segment can bias judgment of orientation and/or collinearity of another segment, and it has been established that the magnitude of error is a determinate function of the relative angle between the two. We examined how these known relationships are affected by decomposing the induction segment into an array of scattered points. The bias that was produced by such arrays was found to be consistent with a formal model of angular induction, with the strength of the effect decreasing as the scatter among the points was increased. This decline in strength was almost linear with a logarithmic transform of the dimensions of the stimulus array. We also evaluated the hypothesis that the induction stimulus is detected by one or more channels—for example, neurons—for which the sensitivity profiles are modeled as Gabor wavelets. The change in induction strength with increasing point scatter was not predicted by a single width of channel. However, the combined activity of an ensemble of channels that differed in width did match the perceptual effects if one also stipulated that each channel would respond maximally to a fine-line stimulus.  相似文献   
107.
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.  相似文献   
108.
109.
110.
Whereas the unique axes properties of PARAFAC1 have been examined extensively, little is known about uniqueness properties for the PARAFAC2 model for covariance matrices. This paper is concerned with uniqueness in the rank two case of PARAFAC2. For this case, Harshman and Lundy have recently shown, subject to mild assumptions, that PARAFAC2 is unique when five (covariance) matrices are analyzed. In the present paper, this result is sharpened. PARAFAC2 is shown to be usually unique with four matrices. With three matrices it is not unique unless a certain additional assumption is introduced. If, for instance, the diagonal matrices of weights are constrained to be non-negative, three matrices are enough to have uniqueness in the rank two case of PARAFAC2. The authors are obliged to Richard Harshman for stimulating this research, and to the Associate Editor and reviewers for suggesting major improvements in the presentation.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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