首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   29402篇
  免费   2334篇
  国内免费   1833篇
化学   2405篇
晶体学   36篇
力学   596篇
综合类   263篇
数学   2568篇
物理学   3685篇
综合类   24016篇
  2024年   170篇
  2023年   435篇
  2022年   927篇
  2021年   928篇
  2020年   664篇
  2019年   566篇
  2018年   463篇
  2017年   638篇
  2016年   689篇
  2015年   796篇
  2014年   1360篇
  2013年   1390篇
  2012年   1639篇
  2011年   1760篇
  2010年   1454篇
  2009年   1585篇
  2008年   1820篇
  2007年   2433篇
  2006年   2138篇
  2005年   1921篇
  2004年   1580篇
  2003年   1439篇
  2002年   1237篇
  2001年   1028篇
  2000年   814篇
  1999年   704篇
  1998年   580篇
  1997年   542篇
  1996年   428篇
  1995年   319篇
  1994年   250篇
  1993年   212篇
  1992年   145篇
  1991年   106篇
  1990年   103篇
  1989年   77篇
  1988年   74篇
  1987年   49篇
  1986年   33篇
  1985年   17篇
  1984年   14篇
  1982年   6篇
  1981年   8篇
  1979年   4篇
  1977年   5篇
  1972年   1篇
  1971年   1篇
  1967年   1篇
  1959年   4篇
  1955年   9篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series.  相似文献   
42.
On effectiveness of wiretap programs in mapping social networks   总被引:1,自引:0,他引:1  
Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost. Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php  相似文献   
43.
简述了电子商务理论的演变过程及电子商务的应用形式,包括电子数据交换、网上营销、网络银行等。探讨了电子商务的应用使企业面临的历史变革,指出作为21世纪的一种基本商务形式,电子商务已经成为具有敏锐战略眼光企业家的选择。  相似文献   
44.
本文对三层BP神经网络中带有惩罚项的在线梯度学习算法的收敛性问题进行了研究,在网络训练每一轮开始执行之前,对训练样本随机进行重排,以使网络学习更容易跳出局部极小,文中给出了误差函数的单调性定理以及该算法的弱收敛和强收敛性定理。  相似文献   
45.
以一维有缺陷混凝土板为研究对象,分别采用Leverberg-Marcluardt和径向基神经网络算法,对缺陷的深度与厚度进行识别,从而实现对混凝土板内部缺陷的三维重构,称为红外CT模拟.两类神经网络算法的识别结果表明:Leverberg-Marcluardt神经网络较径向基神经网络具有更好的收敛精度与计算效率.  相似文献   
46.
浅谈网络环境下高校图书馆信息资源建设   总被引:1,自引:0,他引:1  
阐述了网络环境下高校图书馆信息资源建设存在的主要问题,探讨了网络环境对信息资源建设的影响,提出了信息资源建设的具体措施。  相似文献   
47.
论述了在教育领域中使用开源软件的必要性,介绍了几种应用于网络教育的开源软件,主要包括服务器软件、工作站软件和课程管理系统。  相似文献   
48.
在组合系统运用Kalman滤波器技术时,准确的系统模型和可靠的观测数据是保证其性能的重要因素,否则将大大降低Kalman滤波器的估计精度,甚至导致滤波器发散.为解决上述Kalman应用中的实际问题,提出了一种新颖的基于进化人工神经网络技术的自适应Kalman滤波器.仿真试验表明该算法可以在系统模型不准确时、甚至外部观测数据短暂中断时,仍能保证Kalman滤波器的性能.  相似文献   
49.
网络股泡沫大小测度研究   总被引:1,自引:0,他引:1  
网络股泡沫是最能反映网络泡沫本质的表现形式,本文利用理性预期理论,构建了网络股泡沫大小的测度模型,说明网络股泡沫的存在,在此基础上确定了网络股泡沫大小的测度指标,并以雅虎公司股票为例对泡沫的大小进行了测度,结果符合网络泡沫的实际情况。  相似文献   
50.
农户信用评估系统的设计与运用研究   总被引:10,自引:0,他引:10  
农户信用评估的研究对推动农村消费信用的发展,促进农村经济良好运行十分重要。本在构造农户信用评估的指标体系的基础上,提出了农户信用评估神经网络模型的算法,利用实际搜集到的农户资料进一步建立了农户信用评估模型,继而构造了农户信用评估系统,并举例说明了该系统的实际运用,以期能为农村经济发展中的农户信用评价及相关研究提供一丝基础性启发。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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