首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   452篇
  免费   389篇
  国内免费   76篇
  2024年   2篇
  2023年   8篇
  2022年   4篇
  2021年   23篇
  2020年   30篇
  2019年   20篇
  2018年   26篇
  2017年   19篇
  2016年   18篇
  2015年   23篇
  2014年   21篇
  2013年   42篇
  2012年   19篇
  2011年   31篇
  2010年   33篇
  2009年   35篇
  2008年   24篇
  2007年   28篇
  2006年   20篇
  2005年   29篇
  2004年   17篇
  2003年   32篇
  2002年   16篇
  2001年   13篇
  2000年   22篇
  1999年   17篇
  1998年   19篇
  1997年   9篇
  1996年   21篇
  1995年   14篇
  1994年   20篇
  1993年   16篇
  1992年   25篇
  1991年   14篇
  1990年   5篇
  1989年   16篇
  1988年   12篇
  1987年   7篇
  1986年   14篇
  1985年   16篇
  1984年   14篇
  1983年   21篇
  1982年   18篇
  1981年   15篇
  1980年   12篇
  1979年   15篇
  1978年   18篇
  1977年   11篇
  1976年   11篇
  1975年   2篇
排序方式: 共有917条查询结果,搜索用时 15 毫秒
101.
102.
选题是计算机化自适应测验(CAT)测试过程的关键环节,选题策略的目标是要达到较高的测量精度,同时也实现试题曝光率控制及其他测验目标的实现.本文根据选题策略的基本原理和衍生发展,将众多CAT选题策略分为五大选题策略系列:Fisher函数系列、K-LI函数系列、α分层系列、贝叶斯系列、b匹配系列;并根据测验目标(测验精度、试题曝光率控制、内容平衡、多条件约束)对这些选题策略进行了细分,并对CAT选题策略的选择思路进行归纳.  相似文献   
103.
104.
Collecting samples is a challenging task for face recognition, especially for some real-world applications such as law enhancement and ID card identification, where there is usually single sample per person (SSPS) used to train a face recognition system. To extract discriminative features from the small size samples, in this paper we propose virtual samples via bidirectional feature selection with global and local structure preservation (VS-BFS-GL) to augment the number of training samples. In VS-BFS-GL, bidirectional feature selection is developed, which introduces L2,1 norm to explore the face variations from both horizontal and vertical directions. Further, to include more variations in the virtual images, the global structure information and sample-specified local structure information of the SSPP training set are considered. By integrating bidirectional feature selection, global and local structure, the limited training samples are fully utilized and more knowledge are mined. To further improve the effectiveness of VS-BFS-GL, an auxiliary database containing different face variations can be used to explore the local structure information. We extensively evaluated the proposed approach on AR and FERET database. The promising recognition results demonstrate that VS-BFS-GL is robust to expression, pose and partial occlusion variations in the faces.  相似文献   
105.
This study presents the Kent Face Matching Test (KFMT), which comprises 200 same-identity and 20 different-identity pairs of unfamiliar faces. Each face pair consists of a photograph from a student ID card and a high-quality portrait that was taken at least three months later. The test is designed to complement existing resources for face-matching research, by providing a more ecologically valid stimulus set that captures the natural variability that can arise in a person's appearance over time. Two experiments are presented to demonstrate that the KFMT provides a challenging measure of face matching but correlates with established tests. Experiment 1 compares a short version of this test with the optimized Glasgow Face Matching Test (GFMT). In Experiment 2, a longer version of the KFMT, with infrequent identity mismatches, is correlated with performance on the Cambridge Face Memory Test (CFMT) and the Cambridge Face Perception Test (CFPT). The KFMT is freely available for use in face-matching research.  相似文献   
106.
Until now, the equivalence property of reflexivity—matching physically identical stimuli to themselves after training on a set of arbitrary matching relations—has not been demonstrated in any animal, human or nonhuman. Previous reports of reflexivity have either implicitly or explicitly involved reinforced training on other identity matching relations. Here we demonstrate reflexivity without prior identity matching training. Pigeons received concurrent successive matching training on three arbitrary matching tasks: AB (hue–form), BC (form–hue), and AC (hue–hue with different hues in the A and C sets). Afterwards, pigeons were tested for BB (form–form) reflexivity. Consistent with the predictions of Urcuioli's ( 2008 ) theory, pigeons preferentially responded to B comparison stimuli that matched the preceding B sample stimuli in testing (i.e., BB reflexivity). A separate experiment showed that a slightly different set of arbitrary matching baseline relations yielded a theoretically predicted “anti‐reflexivity” (or emergent oddity) effect in two of five pigeons. Finally, training on just two arbitrary successive matching tasks (AB and BC) did not yield any differential BB responding in testing for five of eight pigeons, with two others showing reflexivity and one showing antireflexivity. These data complement previous findings of symmetry and transitivity (the two other properties of equivalence) in pigeons.  相似文献   
107.
Atypical forgetting functions have been demonstrated in several recent studies of delayed matching to sample, in which experimental conditions are altered partway through the retention interval. The forgetting functions are atypical in that accuracy or discriminability is not always a negatively accelerated monotonic function of increasing retention interval duration, but may increase at later times in the retention interval. Atypical forgetting functions reflect changes in levels of discrimination. A switch from a lower level to a higher level of discrimination, or vice versa, can occur at any time in the retention interval. The behavioral theories of remembering proposed by Nevin, Davison, Odum, and Shahan (2007), and White and Brown (2014), offer quantitative predictions of forgetting functions that differ in intercept or slope. Both theories are able to account for atypical forgetting functions, by assuming time‐independent changes in the mediating effect of attending to sample and comparison stimuli (in Nevin et al.'s model) or in the direct effect of the context of reinforcement of the conditional discrimination (in White & Brown's model). Despite differences in their main assumptions, the theories have an edge over any theory that assumes that forgetting is time‐dependent.  相似文献   
108.
A direct‐suppression, or subtractive, model of punishment has been supported as the qualitatively and quantitatively superior matching law‐based punishment model (Critchfield, Paletz, MacAleese, & Newland, 2003; de Villiers, 1980; Farley, 1980). However, this conclusion was made without testing the model against its predecessors, including the original (Herrnstein, 1961) and generalized (Baum, 1974) matching laws, which have different numbers of parameters. To rectify this issue, we reanalyzed a set of data collected by Critchfield et al. (2003) using information theoretic model selection criteria. We found that the most advanced version of the direct‐suppression model (Critchfield et al., 2003) does not convincingly outperform the generalized matching law, an account that does not include punishment rates in its prediction of behavior allocation. We hypothesize that this failure to outperform the generalized matching law is due to significant theoretical shortcomings in model development. To address these shortcomings, we present a list of requirements that all punishment models should satisfy. The requirements include formal statements of flexibility, efficiency, and adherence to theory. We compare all past punishment models to the items on this list through algebraic arguments and model selection criteria. None of the models presented in the literature thus far meets all of the requirements.  相似文献   
109.
Traditionally, behavior analysts have studied stimulus equivalence using a matching‐to‐sample (MTS) preparation. Although researchers have shown the utility of MTS to yield equivalence classes, the procedure requires several prerequisite skills for a learner to accurately respond. Previous research with humans and nonhumans has shown that relational responding can be produced via compound stimulus discrimination and successive matching‐to‐sample (S‐MTS). We conducted four experiments with college students to further evaluate the effectiveness of S‐MTS in the establishment of stimulus relations. S‐MTS trials consisted of the presentation of a single sample stimulus followed by one comparison in a fixed location on a computer screen. Depending upon the sample–comparison relation, participants touched (i.e., go) or did not touch (i.e., no‐go) the comparison stimulus. Following training of the baseline relations (AB/BC), we assessed the emergence of symmetry, transitivity, and equivalence performances (i.e., BA/CB and AC/CA). Results support the utility of the S‐MTS procedure as a possible alternative to traditional MTS. This study has direct implications for participants for whom traditional three‐array MTS procedures may be challenging.  相似文献   
110.
The present experiment investigated the effects of preliminary training with pictorial stimuli on the subsequent formation of three 5‐member equivalence classes (A?B?C?D?E) in 84 university students assigned to seven groups of 12. In the Abstract (ABS) group, all stimuli were abstract shapes. In the Picture (PIC) group, the C stimuli were pictures, and the remaining stimuli were the same abstract shapes as in the ABS group. For the remaining five groups, all stimuli were the same abstract shapes as in the ABS group. However, across groups, preliminary training involved either the establishment of conditional relations with simultaneous (SMTS) or delayed (DMTS) matching‐to‐sample with 0 s, 3 s, 6 s, or 9 s between the abstract C stimuli and the meaningful pictures. For the ABS and the PIC groups, 16.7% and 83.3% of participants formed classes, respectively. Preliminary training with SMTS and DMTS with 0 s, 3 s, and 6 s produced a linear increase in the likelihood of equivalence class formation, 41.7%, 50%, and 75%, respectively. Increasing the duration of delay further from 6 s to 9 s produced a substantial decline, 50%. This experiment extends knowledge about how including meaningful pictures enhances equivalence class formation.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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