全文获取类型
收费全文 | 12276篇 |
免费 | 1319篇 |
国内免费 | 310篇 |
专业分类
化学 | 1671篇 |
晶体学 | 13篇 |
力学 | 259篇 |
综合类 | 62篇 |
数学 | 3038篇 |
物理学 | 2257篇 |
无线电 | 6605篇 |
出版年
2024年 | 32篇 |
2023年 | 198篇 |
2022年 | 281篇 |
2021年 | 346篇 |
2020年 | 336篇 |
2019年 | 259篇 |
2018年 | 281篇 |
2017年 | 337篇 |
2016年 | 414篇 |
2015年 | 409篇 |
2014年 | 691篇 |
2013年 | 1033篇 |
2012年 | 747篇 |
2011年 | 678篇 |
2010年 | 679篇 |
2009年 | 814篇 |
2008年 | 816篇 |
2007年 | 856篇 |
2006年 | 634篇 |
2005年 | 603篇 |
2004年 | 478篇 |
2003年 | 458篇 |
2002年 | 368篇 |
2001年 | 325篇 |
2000年 | 287篇 |
1999年 | 261篇 |
1998年 | 189篇 |
1997年 | 191篇 |
1996年 | 183篇 |
1995年 | 158篇 |
1994年 | 132篇 |
1993年 | 90篇 |
1992年 | 77篇 |
1991年 | 48篇 |
1990年 | 37篇 |
1989年 | 35篇 |
1988年 | 28篇 |
1987年 | 22篇 |
1986年 | 18篇 |
1985年 | 23篇 |
1984年 | 14篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 3篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 2篇 |
1969年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
A mixed mode digital/analog special purpose VLSI hardware implementation of an associative memory with neural architecture is presented. The memory concept is based on a matrix architecture with binary storage elements holding the connection weights. To enhance the processing speed analog circuit techniques are applied to implement the algorithm for the association. To keep the memory density as high as possible two design strategies are considered. First, the number of transistors per storage element is kept to a minimum. In this paper a circuit technique that uses a single 6-transistor cell for weight storage and analog signal processing is proposed. Second, the device precision has been chosen to a moderate level to save area as much as possible. Since device mismatch limits the performance of analog circuits, the impact of device precision on the circuit performance is explicitly discussed. It is shown that the device precision limits the number of rows activated in parallel. Since the input vector as well as the output vector are considered to be sparsely coded it is concluded, that even for large matrices the proposed circuit technique is appropriate and ultra large scale integration with a large number of connection weights is feasible. 相似文献
12.
We employ a first-principles plane wave method with the
relativistic analytic pseudopotential of Hartwigsen, Goedecker and Hutter
(HGH) scheme in the frame of DFT to calculate
the equilibrium lattice parameters and the thermodynamic properties of
AlB2 compound with hcp structure. The obtained lattice parameters are in
good agreement with the available experimental data and those calculated by
others. Through the quasi-harmonic Debye model, obtained successfully are
the dependences of the
normalized lattice parameters a/a0 and c/c0 on pressure P, the normalized
primitive cell volume V/V0 on pressure P, the variation of the thermal
expansion α with pressure P and temperature T, as well as the Debye
temperature \ThetaD and the heat capacity CV on pressure P and
temperature T. 相似文献
13.
Nuclear Magnetic Resonance (NMR) was used to investigate the extrusion behaviour of PTFE pastes in a ram extruder. By means
of 1H-NMR imaging (MRI) it is possible to determine the local proton density and therefore, the local fluid concentration. The
19F-MRI provides the local solid concentration. Thus the local saturation and the local porosity can be calculated with the
information of the local fluid and solid concentration. Furthermore displacement profiles can be derived from NMR images by
means of correlation techniques without any preparation or marking of the pastes.
Received: 8 May 2000 Accepted: 1 May 2001 相似文献
14.
Multi-valued and universal binary neurons (MVN and UBN) are the neural processing elements with the complex-valued weights and high functionality. It is possible to implement an arbitrary mapping described by partially defined multiple-valued function on the single MVN. An arbitrary mapping described by partially defined or fully defined Boolean function, which can be non-threshold, may be implemented on the single UBN. The quickly converging learning algorithms exist for both types of neurons. Such features of the MVN and UBN may be used for solving the different problems. One of the most successful applications of the MVN and UBN is their usage as basic neurons in the Cellular Neural Networks (CNN). It opens the new effective opportunities in nonlinear image filtering and its applications to noise reduction, edge detection and solving of the super resolution problem. A number of experimental results are presented to illustrate the performance of the proposed algorithms.An erratum to this article can be found at 相似文献
15.
WU Jian-Jun GAO Zi-You SUN Hui-Jun 《理论物理通讯》2006,46(7)
In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics ofthis new network are given. 相似文献
16.
G. Tiana M.H. Jensen K. Sneppen 《The European Physical Journal B - Condensed Matter and Complex Systems》2002,29(1):135-140
A feedback mechanism that involves the proteins p53 and mdm2, induces cell death as a controlled response to severe DNA damage.
A minimal model for this mechanism demonstrates that the response may be dynamic and connected with the time needed to translate
the mdm2 protein. The response takes place if the dissociation constant k between p53 and mdm2 varies from its normal value. Although it is widely believed that it is an increase in k that triggers the response, we show that the experimental behaviour is better described by a decrease in the dissociation
constant. The response is quite robust upon changes in the parameters of the system, as required by any control mechanism,
except for few weak points, which could be connected with the onset of cancer.
Received 8 May 2002 / Received in final form 9 July 2002 Published online 17 September 2002 相似文献
17.
This paper undertakes a systematic treatment of the low regularity local wellposedness and ill-posedness theory in Hs andHs for semilinear wave equations with polynomial nonlinearity in u and (e)u. This ill-posed result concerns the focusing type equations with nonlinearity on u and (e)tu. 相似文献
18.
Arnon Arazi Eshel Ben-Jacob Uri Yechiali 《Mathematical Methods of Operations Research》2005,62(3):453-466
We consider a Jackson-type network comprised of two queues having state-dependent service rates, in which the queue lengths
evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space
in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease
the probability of a customers overflow in one of the queues in the network, the server in that same queue – contrary to intuition
– should be shut down for a short period of time. Further noise reduction is obtained if the server in the second queue is
briefly shut down as well, when certain conditions hold. 相似文献
19.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
20.
On effectiveness of wiretap programs in mapping social networks 总被引:1,自引:0,他引:1
Maksim Tsvetovat Kathleen M. Carley 《Computational & Mathematical Organization Theory》2007,13(1):63-87
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 相似文献