全文获取类型
收费全文 | 4701篇 |
免费 | 80篇 |
国内免费 | 3篇 |
专业分类
教育 | 3636篇 |
科学研究 | 201篇 |
各国文化 | 74篇 |
体育 | 470篇 |
综合类 | 4篇 |
文化理论 | 37篇 |
信息传播 | 362篇 |
出版年
2023年 | 14篇 |
2021年 | 36篇 |
2020年 | 54篇 |
2019年 | 79篇 |
2018年 | 164篇 |
2017年 | 158篇 |
2016年 | 139篇 |
2015年 | 121篇 |
2014年 | 165篇 |
2013年 | 1094篇 |
2012年 | 176篇 |
2011年 | 168篇 |
2010年 | 150篇 |
2009年 | 159篇 |
2008年 | 109篇 |
2007年 | 107篇 |
2006年 | 108篇 |
2005年 | 75篇 |
2004年 | 64篇 |
2003年 | 54篇 |
2002年 | 61篇 |
2001年 | 50篇 |
2000年 | 63篇 |
1999年 | 49篇 |
1998年 | 51篇 |
1997年 | 51篇 |
1996年 | 79篇 |
1995年 | 131篇 |
1994年 | 79篇 |
1993年 | 90篇 |
1992年 | 84篇 |
1991年 | 72篇 |
1990年 | 70篇 |
1989年 | 33篇 |
1988年 | 33篇 |
1987年 | 26篇 |
1986年 | 22篇 |
1985年 | 27篇 |
1984年 | 37篇 |
1983年 | 23篇 |
1982年 | 25篇 |
1981年 | 25篇 |
1980年 | 39篇 |
1979年 | 64篇 |
1978年 | 50篇 |
1977年 | 52篇 |
1976年 | 29篇 |
1975年 | 23篇 |
1974年 | 30篇 |
1973年 | 14篇 |
排序方式: 共有4784条查询结果,搜索用时 281 毫秒
1.
Gale Macleod Robin Dallas-Childs Colin Brough Martin Toye 《Journal of Research in Special Educational Needs》2021,21(Z1):25-35
In this article we examine the complex relationship between care experience, mental health and exclusion from school and how young people (YP) negotiate these different experiences and identities. The study is a secondary analysis, informed by symbolic interactionist theory, of interviews conducted with 19 care experienced YP in Scotland. Not all of the YP were excluded and not all had a formal mental health diagnosis, as such our study design allows interrogation of the contexts and relationships which not only facilitate but also disrupt pathways to exclusion. It also allows reconsideration of assumptions of vulnerability which are often applied to care experienced YP. Our findings suggest that these YP are moving beyond ‘role playing’ the identities ascribed to them and actively seek out relationships which enable them to construct alternative identities. 相似文献
2.
[目的/意义] 通过构建二模复杂网络模型,揭示隐藏在海量文献中的隐性知识。[方法/过程] 通过NetworkX复杂网络工具包,依据任意两个节点的共现关系构建二模复杂网络模型;对网络模型中节点的共现关系进行加权,计算网络的拓扑信息并进行AP聚类,提取节点间的直接关系;采用AUC方法对AA、JC、加权改进的wAA和wJC等4种链路预测算法进行评价,遴选出最合适的预测算法,并对复杂网络的隐性关系进行预测分析。[结果/结论] 以潜在药物靶点挖掘为例进行的实证研究结果表明,wAA链路预测算法为最优的链路预测算法;二模复杂网络模型、指标和方法体系在美国化学文摘社数据库中的药物靶点挖掘中具有一定的有效性。下一步计划在其他数据库中或其他研究领域中进行尝试,以进一步验证该模型的通用性和有效性。 相似文献
3.
Although there has been a great deal of research into Collaborative Information Retrieval (CIR) and Collaborative Information Seeking (CIS), the majority has assumed that team members have the same level of unrestricted access to underlying information. However, observations from different domains (e.g. healthcare, business, etc.) have suggested that collaboration sometimes involves people with differing levels of access to underlying information. This type of scenario has been referred to as Multi-Level Collaborative Information Retrieval (MLCIR). To the best of our knowledge, no studies have been conducted to investigate the effect of awareness, an existing CIR/CIS concept, on MLCIR. To address this gap in current knowledge, we conducted two separate user studies using a total of 5 different collaborative search interfaces and 3 information access scenarios. A number of Information Retrieval (IR), CIS and CIR evaluation metrics, as well as questionnaires were used to compare the interfaces. Design interviews were also conducted after evaluations to obtain qualitative feedback from participants. Results suggested that query properties such as time spent on query, query popularity and query effectiveness could allow users to obtain information about team's search performance and implicitly suggest better queries without disclosing sensitive data. Besides, having access to a history of intersecting viewed, relevant and bookmarked documents could provide similar positive effect as query properties. Also, it was found that being able to easily identify different team members and their actions is important for users in MLCIR. Based on our findings, we provide important design recommendations to help develop new CIR and MLCIR interfaces. 相似文献
4.
5.
Mike Cass Dennis Cates Michelle Smith Cynthia Jackson 《Learning disabilities research & practice》2003,18(2):112-120
Abstract. A multiple baseline design was employed to test the effect of manipulative instruction on the perimeter and area problem‐solving performance of middle and high school students who had been diagnosed with LD in the area of mathematics. Modeling, prompting/guided practice, and independent practice in conjunction with manipulative training were employed to teach both perimeter and area problem‐solving skills. Analysis of data revealed that the students rapidly acquired the problem‐solving‐skills, maintained these skills over a two‐month period, and transferred these skills to a paper and pencil problem‐solving format. This research extends previous findings by revealing that use of concrete manipulatives promotes the long‐term maintenance of skills. 相似文献
6.
7.
8.
Elizabeth Bruce PhD, a psychologist in private practice, and Cynthia Schultz PhD, honorary associate at LaTrobe University, both live and work in Australia. Their work on supporting parents who have children with special needs, however, has been published around the world. In this article Bruce and Schultz explore the notion of 'non-finite loss', defined as the ongoing sense of grief experienced by parents caring for children with severe disabilities. The authors discuss the issues that professionals need to consider when working with parents in these circumstances. The article closes with a set of recommendations for promoting more effective partnerships between parents and professionals. 相似文献
9.
Martin R?tteler 《Informatik - Forschung und Entwicklung》2006,55(3):3-20
Quantum algorithms are a field of growing interest within the theoretical computer science as
well as the physics community. Surprisingly, although the number of researchers working on the subject
is ever-increasing, the number of quantum algorithms found so far is quite small. In fact, the task of
designing new quantum algorithms has been proven to be extremely difficult. In this paper we give an overview
of the known quantum algorithms and briefly describe the underlying ideas. Roughly, the algorithms presented
are divided into hidden subgroup type algorithms and in amplitude amplification type algorithms. While
the former deal with problems of group-theoretical nature and have the promise to yield strong separations
of classical and quantum algorithms, the latter have been proved to be a prolific source of algorithms
in which a polynomial speed-up as compared to classical algorithms can be achieved. We also discuss
quantum algorithms which do not fall under these two categories and give a survey of techniques of
general interest in quantum computing such as adiabatic computing, lower bounds for quantum algorithms,
and quantum interactive proofs. 相似文献
10.