首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11557篇
  免费   1篇
教育   8919篇
科学研究   1215篇
各国文化   1篇
体育   360篇
文化理论   388篇
信息传播   675篇
  2022年   6篇
  2021年   2篇
  2020年   1篇
  2019年   3篇
  2018年   2173篇
  2017年   2077篇
  2016年   1565篇
  2015年   114篇
  2014年   115篇
  2013年   87篇
  2012年   219篇
  2011年   692篇
  2010年   834篇
  2009年   429篇
  2008年   641篇
  2007年   1150篇
  2006年   66篇
  2005年   392篇
  2004年   444篇
  2003年   357篇
  2002年   129篇
  2001年   9篇
  2000年   21篇
  1998年   1篇
  1997年   15篇
  1996年   1篇
  1993年   1篇
  1991年   7篇
  1989年   1篇
  1988年   1篇
  1984年   1篇
  1980年   1篇
  1979年   1篇
  1976年   2篇
排序方式: 共有10000条查询结果,搜索用时 500 毫秒
951.
Search engine discoverability programs have changed the fundamentals of book marketing by enabling content inside the book to be used as the source of marketing itself via search results inside books. The internet trifecta of search, browse, buy is the end game but the complexities of making this work is explored along with an in-depth overview of the potential upside and difficulties of online content purchase models.  相似文献   
952.
In February 2008 the Book Industry Study Group (BISG) conducted a survey of U.S. publishers to determine the extent of technology-driven innovation and experimentation. The survey findings were published alongside a set of 10 case studies in May 2008 as “From experimentation to innovation in the digital age—case studies from the North American Book Industry 2008”. This article, written by Michael Healy, Executive Director of the BISG, summarizes the circumstances that led to the survey and shares the key findings.  相似文献   
953.
Collaborative Filtering (CF) Systems have been studied extensively for more than a decade to confront the “information overload” problem. Nearest-neighbor CF is based either on similarities between users or between items, to form a neighborhood of users or items, respectively. Recent research has tried to combine the two aforementioned approaches to improve effectiveness. Traditional clustering approaches (k-means or hierarchical clustering) has been also used to speed up the recommendation process. In this paper, we use biclustering to disclose this duality between users and items, by grouping them in both dimensions simultaneously. We propose a novel nearest-biclusters algorithm, which uses a new similarity measure that achieves partial matching of users’ preferences. We apply nearest-biclusters in combination with two different types of biclustering algorithms—Bimax and xMotif—for constant and coherent biclustering, respectively. Extensive performance evaluation results in three real-life data sets are provided, which show that the proposed method improves substantially the performance of the CF process.
Yannis ManolopoulosEmail:
  相似文献   
954.
This article addresses the trajectory of Archival Science in Brazil, its extracurricular characteristics and its particular relationship with Information Science within academics, its institutional associations, and some considerations regarding current training for archivists in Brazil. The methodological procedures used included analyzing documents from the National Archive Fonds of Brazil, reviewing archive literature, and interviewing people involved in consolidating Archival Science. This study concludes that Archival Science research is taking place in graduate programs throughout public Brazilian universities and points out that people working with archives now have more advanced training, such as undergraduate degrees in Archival Science or other. This study also focuses on archives as information units, while presenting and reflecting on the demands of training archivists who are faced with the challenges of the working world and the era of information and knowledge—challenges that go beyond merely technical procedures and encompass dynamic planning and orientation activities.  相似文献   
955.
A compressed full-text self-index for a text T, of size u, is a data structure used to search for patterns P, of size m, in T, that requires reduced space, i.e. space that depends on the empirical entropy (H k or H 0) of T, and is, furthermore, able to reproduce any substring of T. In this paper we present a new compressed self-index able to locate the occurrences of P in O((m + occ)log u) time, where occ is the number of occurrences. The fundamental improvement over previous LZ78 based indexes is the reduction of the search time dependency on m from O(m 2) to O(m). To achieve this result we point out the main obstacle to linear time algorithms based on LZ78 data compression and expose and explore the nature of a recurrent structure in LZ-indexes, the suffix tree. We show that our method is very competitive in practice by comparing it against other state of the art compressed indexes.
Arlindo L. OliveiraEmail:
  相似文献   
956.
Play is an important activity in young children’s lives. It is how children explore their world and build knowledge. Although free play, which is play that is totally child directed, contributes to children’s learning, self-regulation and motivation, adults’ participation in children’s play is critical in their development, especially their language development. Guided by children, adults can help scaffold children’s language, and especially their learning. We suggest that adults scaffold children’s language during play by using research based strategies such as asking questions that invite extended responses and new inquiry, provide meaningful feedback and effectively use wait time, which provides children with the opportunity to respond to adults’ comments and questions. The goal is to provide adults with strategies to scaffold children’s language development during play while allowing children to direct their own play activities.  相似文献   
957.
Despite the importance of early writing development to children’s school success, research documents that early childhood teachers spend little time actively supporting children’s writing development in preschool classrooms. This article provides a framework for integrating writing experiences across the early childhood curriculum. Practical examples are given regarding how writing opportunities can be incorporated into existing activities and play settings. The metaphor of backgrounding and foregrounding writing experiences is used to illustrate ways that teachers can set writing rich environments and activities in a manner that makes it easier for teachers to bring these experiences into everyday learning opportunities. Attention is given to how teachers can bring writing to the foreground of the curriculum by drawing attention to writing materials, making natural connections with children’s interest and play, and scaffolding children’s early writing attempts and experiences.  相似文献   
958.
959.
960.
Gary Ruvkun is a winner of the 2015 Breakthrough Prize in Life Sciences. He is a co-discoverer of microRNAs (with Victor Ambros, University of Massachusetts), regarded as one of the seminal discoveries of 21st century molecular biology. In addition to the Breakthrough Prize, Ruvkun and Ambros have received the Warren Triennial Prize, the Laskar Foundation Award, and numerous other awards and prizes. Professor Ruvkun obtained his PhD from Harvard University, did his postdoctoral research at MIT, and subsequently accepted a faculty position at Harvard, where he is currently Professor of Genetics. His laboratory conducts research on basic cellular processes, using the worm C. elegans as a model system.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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