首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1557篇
  免费   97篇
  国内免费   4篇
  2023年   19篇
  2022年   22篇
  2021年   22篇
  2020年   31篇
  2019年   43篇
  2018年   65篇
  2017年   65篇
  2016年   73篇
  2015年   40篇
  2014年   46篇
  2013年   181篇
  2012年   83篇
  2011年   52篇
  2010年   57篇
  2009年   46篇
  2008年   51篇
  2007年   69篇
  2006年   61篇
  2005年   43篇
  2004年   51篇
  2003年   55篇
  2002年   48篇
  2001年   30篇
  2000年   34篇
  1999年   28篇
  1998年   25篇
  1997年   18篇
  1996年   13篇
  1995年   14篇
  1994年   9篇
  1993年   8篇
  1992年   15篇
  1991年   8篇
  1990年   9篇
  1989年   8篇
  1988年   12篇
  1987年   12篇
  1985年   11篇
  1984年   10篇
  1982年   10篇
  1981年   10篇
  1979年   8篇
  1977年   7篇
  1976年   9篇
  1975年   10篇
  1973年   9篇
  1971年   9篇
  1970年   10篇
  1968年   7篇
  1967年   9篇
排序方式: 共有1658条查询结果,搜索用时 15 毫秒
901.
Memory and planning processes in solutions to well-structured problems   总被引:1,自引:0,他引:1  
Although many studies in the problem-solving literature have considered the factors that might determine the strategies that are employed to solve well-structured problems, these have typically focused upon variants of means-end analysis. In general, such models imply that strategies unfold in a temporally forward direction, that problem solvers typically restrict forward-planning activities to just one or two moves ahead of the current problem state, and that one important heuristic is the avoidance of previous moves. Although studies have demonstrated the importance of such anti-looping heuristics, few have systematically explored the possibility that problem solvers may also plan retrospectively in order to try and assess whether a move might take them back to a state that they have previously visited. Those models of problem solving that promote the role of an anti-looping heuristic have assumed that the ability to use such a heuristic is based upon memory for previous states, but other interpretations are possible. In this paper several studies are reported that attempt systematically to explore participants' attempts to recognize previously visited problem solving states. The findings suggest that there is a systematic relationship between the success of this process, the time taken to make this judgement, and distance from the current state. It is also demonstrated that estimations about where future positions are likely to occur are symmetrical to estimations about past positions. It is suggested that this provides evidence that problem solvers engage in retrospective planning processes in order to try and avoid previous moves, and that this strategy may not be based straightforwardly upon their ability to remember previous problem states.  相似文献   
902.
903.
Reply to Lassiter   总被引:1,自引:0,他引:1  
  相似文献   
904.
Why a Diagram is (Sometimes) Worth Ten Thousand Words   总被引:1,自引:0,他引:1  
We distinguish diagrammatic from sentential paper-and-pencil representations of information by developing alternative models of information-processing systems that are informationally equivalent and that can be characterized as sentential or diagrammatic. Sentential representations are sequential, like the propositions in a text. Diagrammatic representations are indexed by location in a plane. Diagrammatic representations also typically display information that is only implicit in sentential representations and that therefore has to be computed, sometimes at great cost, to make it explicit for use. We then contrast the computational efficiency of these representations for solving several illustrative problems in mathematics and physics. When two representations are informationally equivalent, their computational efficiency depends on the information-processing operators that act on them. Two sets of operators may differ in their capabilities for recognizing patterns, in the inferences they can carry out directly, and in their control strategies (in particular, the control of search). Diagrammatic and sentential representations support operators that differ in all of these respects. Operators working on one representation may recognize features readily or make inferences directly that are difficult to realize in the other representation. Most important, however, are differences in the efficiency of search for information and in the explicitness of information. In the representations we call diagrammatic, information is organized by location, and often much of the information needed to make an inference is present and explicit at a single location. In addition, cues to the next logical step in the problem may be present at an adjacent location. Therefore problem solving can proceed through a smooth traversal of the diagram, and may require very little search or computation of elements that had been implicit.  相似文献   
905.
906.
907.
908.
909.
910.
In spite of policies advocating the involvement of families in the care of mental health service users in the UK, there are few examples of initiatives to develop staff confidence and skills in partnership working. This article describes a whole team training initiative and family liaison service to promote family inclusive working on in‐patient wards for older people in Somerset, UK. A three‐day staff‐training programme is described and training outcomes are reported. Staff report a substantial increase in confidence and family meetings held. A pre‐and post‐ training case note audit shows increased consideration of the needs of families. To further increase face to face meetings with families a family liaison service has been established, whereby a staff member with systemic family therapy training joins ward staff to hold family meetings as part of the assessment/admission process. Evaluation of this service has shown it to be effective with positive feedback from families and staff.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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