首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6486篇
  免费   144篇
  国内免费   72篇
化学   2382篇
晶体学   31篇
力学   704篇
数学   1996篇
物理学   1589篇
  2023年   47篇
  2022年   64篇
  2021年   69篇
  2020年   133篇
  2019年   54篇
  2018年   90篇
  2017年   103篇
  2016年   107篇
  2015年   129篇
  2014年   173篇
  2013年   376篇
  2012年   222篇
  2011年   300篇
  2010年   230篇
  2009年   180篇
  2008年   268篇
  2007年   276篇
  2006年   322篇
  2005年   287篇
  2004年   229篇
  2003年   176篇
  2002年   190篇
  2001年   152篇
  2000年   106篇
  1999年   93篇
  1998年   93篇
  1997年   92篇
  1996年   83篇
  1995年   75篇
  1994年   64篇
  1993年   53篇
  1992年   53篇
  1991年   54篇
  1990年   63篇
  1989年   67篇
  1988年   64篇
  1985年   115篇
  1984年   98篇
  1983年   75篇
  1982年   98篇
  1981年   87篇
  1980年   80篇
  1979年   78篇
  1978年   72篇
  1977年   86篇
  1976年   69篇
  1975年   68篇
  1974年   77篇
  1973年   87篇
  1971年   63篇
排序方式: 共有6702条查询结果,搜索用时 15 毫秒
11.
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  相似文献   
12.
Previous studies of the initial stage of oxidation on clean single crystal of Cu(1 0 0) have been extended to the case of the Cu(1 1 0) surface. The dynamic observation of the nucleation and growth of Cu oxide by means of in situ ultra high vacuum transmission electron microscopy (UHV-TEM) shows a highly enhanced oxidation rate on Cu(1 1 0) surface as compared to Cu(1 0 0). The kinetic data on the nucleation and growth of the three-dimensional oxide islands agree well with our heteroepitaxial model of surface diffusion of oxygen.  相似文献   
13.
The radiation-induced decomposition of C4F9I and CF3I overlayers at 119 K on diamond (100) surfaces has been shown to be an efficient route to fluorination of the diamond surface. X-ray photoelectron spectroscopy has been used for photoactivation as well as for studying the photodecomposition of the fluoroalkyl iodide molecules, the attachment of the photofragments to the diamond surface, and the thermal decomposition of the fluoroalkyl ligands. Measured chemical shifts agree well with ab initio calculations of both C 1s and F 1s binding energies. It is found that chemisorbed CF3 groups on diamond (100) decompose by 300 K whereas C4F9 groups decompose over the range 300 to 700 K and this reactivity difference is rationalized on steric grounds. Both of these thermal decomposition processes produce surface C---F bonds on the diamond. The surface C---F species thermally decompose over a wide temperature range extending up to 1500 K. Hydrogen passivation of the diamond surface is ineffective in preventing free radical attack from the photodissociated products of the fluoroalkyl iodides; I atoms produced photolytically abstract H from surface C---H bonds to yield hydrogen iodide at 119 K allowing diamond fluorination. The attachment of chemisorbed F species to the diamond (100) surface causes band bending as the surface states are occupied as a result of chemisorption. This results in a shift to higher binding energy of the diamond-related C 1s levels present in the surface and subsurface regions which are sampled by XPS on the diamond. The use of photoactivation of fluoroalkyl iodides for the fluorination of diamond surfaces provides a convenient route compared to other methods involving the action of atomic F, molecular F2, XeF2 and F-containing plasmas.  相似文献   
14.
The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions.  相似文献   
15.
Flux jumps have been observed in a large (138 mg) single crystal of La1.86Sr0.14CuO4. Both complete and incomplete flux jumps are observed with the energy dissipated by complete flux jumps consistent with temperature rises to nearly Tc. The systematics of these flux jumps with respect to field history, temperature and the time duration of the hysteresis measurements are reported. The field at which flux jumps first occur and their subsequent spacing are not consistent with a simple adiabatic theory of flux jumps for our experimental conditions. Instead, the crystal is observed to be stabilized against flux jumps by flux creep which occurs during the time interval over which field steps are accomplished as well as during imposed time intervals between field steps.  相似文献   
16.
17.
《Physica A》2006,371(2):157-170
We study the effects of an external periodic perturbation on a Poisson rate process, with special attention to the perturbation-induced sojourn-time patterns. We show that these patterns correspond to turning a memory-less sequence into a sequence with memory. The memory effects are stronger the slower the perturbation. The adoption of a de-trending technique, applied with no caution, might generate the impression that no fluctuation–periodicity correlation exists. We find that this is due to the fact that the perturbation-induced memory is a global property and that the result of a local in time analysis would not find any memory effect, insofar as the process under study is locally a Poisson process. We find that an efficient way to detect this memory effect is to analyze the moduli of the de-trended sequence. We turn the sequence to analyze into a diffusion process, and we evaluate the Shannon entropy of the resulting diffusion process. We find that both the original sequence and the suitably processed de-trended sequence yield the same dependence of entropy on time, namely, an initial scaling larger than ordinary scaling, and a sequel of weak oscillations, which are a clear signature of the external perturbation, in both cases. This is a clear indication of the fluctuation–periodicity correlation.  相似文献   
18.
Relative gerbes     
This paper introduces the notion of “relative gerbes” for smooth maps of manifolds, and discusses their differential geometry. The equivalence classes of relative gerbes are further classified by the relative integral cohomology in degree 3.  相似文献   
19.
《Physica A》2006,363(1):32-38
To improve their position at the market, many companies concentrate on their core competences and hence cooperate with suppliers and distributors. Thus, between many independent companies strong linkages develop and production and logistics networks emerge. These networks are characterised by permanently increasing complexity, and are nowadays forced to adapt to dynamically changing markets. This factor complicates an enterprise-spreading production planning and control enormously. Therefore, a continuous flow model for production networks will be derived regarding these special logistic problems. Furthermore, phase-synchronisation effects will be presented and their dependencies to the set of network parameters will be investigated.  相似文献   
20.
Within the large literature on inter-organizational networks, there has been some discussion of linking-pin organizations and the role they play in integrating these networks. Based on this verbal specification of linking-pin organizations, we construct operational criteria and empirical methods for identifying these structurally important organizations in potentially large and complex inter-organizational networks. These methods are based on ideas drawn from blockmodeling, structural holes, centrality and centralization of networks, and identifying cut-points in networks. These methods are applied to a constructed example and then to real empirical inter-organizational networks. Implications and contrasts with other methods are discussed, together with some open problems.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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