首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   287篇
  免费   20篇
  国内免费   20篇
  2023年   1篇
  2022年   3篇
  2021年   9篇
  2020年   6篇
  2019年   5篇
  2018年   5篇
  2017年   9篇
  2016年   14篇
  2015年   11篇
  2014年   11篇
  2013年   31篇
  2012年   6篇
  2011年   5篇
  2010年   4篇
  2009年   11篇
  2008年   20篇
  2007年   18篇
  2006年   12篇
  2005年   16篇
  2004年   13篇
  2003年   9篇
  2002年   14篇
  2001年   11篇
  2000年   9篇
  1999年   6篇
  1998年   11篇
  1997年   9篇
  1996年   11篇
  1995年   4篇
  1994年   5篇
  1993年   5篇
  1992年   4篇
  1991年   1篇
  1990年   1篇
  1989年   2篇
  1988年   2篇
  1985年   2篇
  1983年   2篇
  1982年   1篇
  1980年   2篇
  1978年   2篇
  1976年   3篇
  1975年   1篇
排序方式: 共有327条查询结果,搜索用时 358 毫秒
191.
心理理论的发展对个体社会化具有重要意义。研究通过元分析的方法,表明执行功能能够有效预测个体心理理论的发展水平(r=0.37,p0.001),且具有跨文化和跨人群的稳定性;同时,在个体的毕生发展中,执行功能均与心理理论存在显著相关,证明了执行功能的表达说;但在不同的发展阶段(Q1=411.75,p10.001,df1=90;Q2=219.49,p20.001,df2=50),心理理论的发展会受到执行功能不同成分的影响:0~3岁时抑制控制起关键作用;3~12岁时,心理理论受到抑制控制和灵活转换的共同影响;青春期阶段,灵活转换的作用明显;而到了成年期,抑制控制与灵活转换均会对心理理论产生积极影响。  相似文献   
192.
钱锦昕  余嘉元 《心理学报》2013,45(6):704-714
探讨基因表达式编程对自陈量表测量数据的建模方法。运用威廉斯创造力测验和认知需求量表获得400位中学生的测量分数,通过数据清洗,保留383个被试的分数作为建模的数据集。运用哈曼单因素检验方法没有发现共同方法偏差。采用均匀设计方法对基因表达式编程中的5个参数进行优化配置,在测试拟合度最大的试验条件下,找到了测试误差最小的模型。比较基因表达式编程和BP神经网络、支持向量回归机、多元线性回归、二次多项式回归所建模型的预测精度。研究表明,基因表达式编程能用于自陈量表测量数据的建模,该模型比传统方法所建的模型具有更高的预测精度,而且模型是稳健的。  相似文献   
193.
Multiobjective programming, a technique for solving mathematical optimization problems with multiple conflicting objectives, has received increasing attention among researchers in various academic disciplines. A summary of multiobjective programming techniques and a review of their applications in quantitative psychology are provided.  相似文献   
194.
Using an explicit task cuing paradigm, we tested whether masked cues can trigger task-set activation, which would suggest that unconsciously presented stimuli can impact cognitive control processes. Based on a critical assessment of previous findings on the priming of task-set activation, we present two experiments with a new method to approach this subject. Instead of using a prime, we varied the visibility of the cue. These cues either directly signaled particular tasks in Experiment 1, or certain task transitions (i.e., task repetitions or switches) in Experiment 2. While both masked task and transition cues affected task choice, only task cues affected the speed of task performance. This observation suggests that task-specific stimulus–response rules can be activated only by masked cues that are uniquely associated with a particular task. Taken together, these results demonstrate that unconsciously presented stimuli have the power to activate corresponding task sets.  相似文献   
195.
For classical sets one has with the cumulative hierarchy of sets, with axiomatizations like the system ZF, and with the category SET of all sets and mappings standard approaches toward global universes of all sets.We discuss here the corresponding situation for fuzzy set theory. Our emphasis will be on various approaches toward (more or less naively formed) universes of fuzzy sets as well as on axiomatizations, and on categories of fuzzy sets.What we give is a (critical) survey of quite a lot of such approaches which have been offered in the last approximately 35 years.Part I was devoted to model based and to axiomatic approaches; the present Part II is devoted to category theoretic approaches.This paper is a version of the invited talk given by the author at the conference Trends in Logic III, dedicated to the memory of A. MOSTOWSKI, H. RASIOWA and C. RAUSZER, and held in Warsaw and Ruciane-Nida from 23rd to 25th September 2005.  相似文献   
196.
There appears to be a relative absence of studies that have examined the prevalence of cognitively intact individuals who reside in extended care facilities. Prevalence data were collected on 296 persons who resided in 3 extended care nursing facilities in Central Virginia. Cognitive intactness was evaluated via the Minimum Data Set Cognitive Performance Scale (CPS) and an author-generated survey (i.e., Cognitively Intact Survey [CI Survey]) of select nursing staff members at each facility. The Mini-Mental State Examination (MMSE) was utilized to examine the accuracy of the two measures in identifying cognitive intactness. Findings indicated that prevalence rates of cognitively intact residents varied as a function of the measures utilized to assess intactness. Specifically, a significantly greater proportion of the total sample of residents was judged to be cognitively intact via the CI Survey (34.12%) as compared to the CPS (26.01%). The level of interjudge agreement between the two measures was found to be moderately high (K = 0.68). When the MMSE was employed to verify individuals' levels of intactness, the percentages of residents predicted to actually be cognitively intact were somewhat lower for each measure. Specifically, based on the data obtained via the CI Survey, 22.75% of the total sample were predicted to actually be cognitively intact, whereas 17.85% of the sample were predicted to be intact based on the CPS results. Findings are discussed in light of factors that may have contributed to the differential prevalence rates of cognitively intact individuals obtained across the measures utilized in this study. Concerns regarding the utilization of the MMSE as a criterion measure of cognitive intactness in persons residing in extended care nursing facilities are provided, along with data on the living environments/roommate statuses of those residents judged to be intact via the CI Survey. Implications for the design of future extended care nursing units, as well as future research, are also included.  相似文献   
197.
A neural net based implementation of propositional [0,1]-valued multi-adjoint logic programming is presented, which is an extension of earlier work on representing logic programs in neural networks carried out in [A.S. d'Avila Garcez et al., Neural-Symbolic Learning Systems: Foundations and Applications, Springer, 2002; S. Hölldobler et al., Appl. Intelligence 11 (1) (1999) 45–58]. Proofs of preservation of semantics are given, this makes the extension to be well-founded.The implementation needs some preprocessing of the initial program to transform it into a homogeneous program; then, transformation rules carry programs into neural networks, where truth-values of rules relate to output of neurons, truth-values of facts represent input, and network functions are determined by a set of general operators; the net outputs the values of propositional variables under its minimal model.  相似文献   
198.
This research explores how mood interacts with outcome and implemental mind‐sets to influence motivation to work toward a goal. We propose and demonstrate that being in a positive (vs. neutral) mood increases motivation for those in an outcome mind‐set. Conversely, being in a positive (vs. neutral) mood decreases motivation for those in an implemental mind‐set. We argue that the reason for this is rooted in the role of positive mood on the number of available goal attainment means: Positive (vs. neutral) mood was found to increase the number of accessible goal attainment activities. For those in an outcome mind‐set, the increased number of goal attainment activities increases motivation because more activities are perceived as more available opportunities or strategies that may aid in successful goal attainment. For those in an implemental mind‐set, where one considers detailed steps and processes required for goal completion, motivation is decreased, because availability of more activities increases perceived difficulty of goal execution. Five studies support these hypotheses, showing differences in available activities depending on mood, differences in perceptions of those activities depending on mind‐set, and differences in motivation depending on the interaction of mood and mind‐set.  相似文献   
199.
We propose a framework which extends Antitonic Logic Programs [Damásio and Pereira, in: Proc. 6th Int. Conf. on Logic Programming and Nonmonotonic Reasoning, Springer, 2001, p. 748] to an arbitrary complete bilattice of truth-values, where belief and doubt are explicitly represented. Inspired by Ginsberg and Fitting's bilattice approaches, this framework allows a precise definition of important operators found in logic programming, such as explicit and default negation. In particular, it leads to a natural semantical integration of explicit and default negation through the Coherence Principle [Pereira and Alferes, in: European Conference on Artificial Intelligence, 1992, p. 102], according to which explicit negation entails default negation. We then define Coherent Answer Sets, and the Paraconsistent Well-founded Model semantics, generalizing many paraconsistent semantics for logic programs. In particular, Paraconsistent Well-Founded Semantics with eXplicit negation (WFSXp) [Alferes et al., J. Automated Reas. 14 (1) (1995) 93–147; Damásio, PhD thesis, 1996]. The framework is an extension of Antitonic Logic Programs for most cases, and is general enough to capture Probabilistic Deductive Databases, Possibilistic Logic Programming, Hybrid Probabilistic Logic Programs, and Fuzzy Logic Programming. Thus, we have a powerful mathematical formalism for dealing simultaneously with default, paraconsistency, and uncertainty reasoning. Results are provided about how our semantical framework deals with inconsistent information and with its propagation by the rules of the program.  相似文献   
200.
In this paper the existence of natural models for a paraconsistent version of naive set theory is discussed. These stand apart from the previous attempts due to the presence of some non-monotonic ingredients in the comprehension scheme they fulfill. Particularly, it is proved here that allowing the equality relation in formulae defining sets, within an extensional universe, compels the use of non-monotonic operators. By reviewing the preceding attempts, we show how our models can naturally be obtained as fixed points of some functor acting on a suitable category (stressing the use of fixed-point arguments in obtaining such alternative semantics).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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