全文获取类型
收费全文 | 7578篇 |
免费 | 1320篇 |
国内免费 | 439篇 |
专业分类
化学 | 2102篇 |
晶体学 | 39篇 |
力学 | 1102篇 |
综合类 | 241篇 |
数学 | 2247篇 |
物理学 | 3606篇 |
出版年
2024年 | 30篇 |
2023年 | 129篇 |
2022年 | 488篇 |
2021年 | 373篇 |
2020年 | 251篇 |
2019年 | 198篇 |
2018年 | 159篇 |
2017年 | 289篇 |
2016年 | 357篇 |
2015年 | 286篇 |
2014年 | 481篇 |
2013年 | 582篇 |
2012年 | 475篇 |
2011年 | 446篇 |
2010年 | 407篇 |
2009年 | 448篇 |
2008年 | 431篇 |
2007年 | 477篇 |
2006年 | 412篇 |
2005年 | 329篇 |
2004年 | 265篇 |
2003年 | 287篇 |
2002年 | 244篇 |
2001年 | 196篇 |
2000年 | 202篇 |
1999年 | 169篇 |
1998年 | 158篇 |
1997年 | 138篇 |
1996年 | 120篇 |
1995年 | 75篇 |
1994年 | 79篇 |
1993年 | 77篇 |
1992年 | 49篇 |
1991年 | 39篇 |
1990年 | 44篇 |
1989年 | 19篇 |
1988年 | 18篇 |
1987年 | 15篇 |
1986年 | 23篇 |
1985年 | 20篇 |
1984年 | 14篇 |
1982年 | 8篇 |
1981年 | 10篇 |
1979年 | 4篇 |
1977年 | 5篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1967年 | 1篇 |
1959年 | 4篇 |
1957年 | 1篇 |
排序方式: 共有9337条查询结果,搜索用时 15 毫秒
11.
Dalila B. M. M. Fontes Eleni Hadjiconstantinou Nicos Christofides 《Journal of Global Optimization》2006,34(1):97-125
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations
of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on
the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving
transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation
of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial
solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as
a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively
improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications.
Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to
improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can
be obtained for concave cost network flow problems, particularly for fixed-charge problems. 相似文献
12.
Yu-Soo Lee Hyun-Ju Chung Jong-Han Joung Eung-Jo Kim Hee-Je Kim 《Optics & Laser Technology》2004,36(1):461-61
We describe the pulse forming of pulsed CO2 laser using multi-pulse superposition technique. Various pulse shapes, high duty cycle pulse forming network (PFN) are constructed by time sequence. This study shows a technology that makes it possible to make various long pulse shapes by activating SCRs of three PFN modules consecutively at a desirable delay time with the aid of a PIC one-chip microprocessor. The power supply for this experiment consists of three PFN modules. Each PFN module uses a capacitor, a pulse forming inductor, a SCR, a high voltage pulse transformer, and a bridge rectifier on each transformer secondary. The PFN modules operate at low voltage by driving the primary of HV pulse transformer. The secondary of the transformer has a full-wave rectifier, which passes the pulse energy to the load in a continuous sequence.We investigated various long pulse shapes as different trigger time intervals of SCRs among three PFN modules. As a result, we could obtain laser beam with various pulse shapes and durations from about 250 to 1000 μs. 相似文献
13.
Experimental analysis, modeling, and theoretical design of McMaster pore-filled nanofiltration membranes 总被引:1,自引:0,他引:1
A side-by-side comparison of the performance of McMaster pore-filled (MacPF) and commercial nanofiltration (NF) membranes is presented here. The single-salt and multi-component performance of these membranes is studied using experimental data and using a mathematical model. The pseudo two-dimensional model is based on the extended Nernst–Planck equation, a modified Poisson–Boltzmann equation, and hydrodynamic calculations. The model includes four structural properties of the membrane: pore radius, pure water permeability, surface charge density and the ratio of effective membrane thickness to water content. The analysis demonstrates that the rejection and transport mechanisms are the same in the commercial and MacPF membranes with different contributions from each type of mechanism (convection, diffusion and electromigration). Solute rejection in NF membranes is determined primarily by a combination of steric and electrostatic effects. The selectivity of MacPF membranes is primarily determined by electrostatic effects with a significantly smaller contribution of steric effects compared to commercial membranes. Hence, these membranes have the ability to reject ions while remaining highly permeable to low molecular weight organics. Additionally, a new theoretical membrane design approach is presented. This design procedure potentially offers the optimization of NF membrane performance by tailoring the membrane structure and operating variables to the specific process, simultaneously. The procedure is validated at the laboratory scale. 相似文献
14.
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. 相似文献
15.
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 相似文献
16.
The general stability of single-layer cylindrical grids is studied in linear and nonlinear formulations. Dependence of the general buckling load on the geometry and stiffness parameters of a grid is established in an analytical form. Such grids are numerically analyzed for stability. It is established that the general buckling load is much less than the local buckling load. Typical general buckling modes are found. It is shown that such grids are weakly sensitive to imperfections 相似文献
17.
网络股泡沫大小测度研究 总被引:1,自引:0,他引:1
网络股泡沫是最能反映网络泡沫本质的表现形式,本文利用理性预期理论,构建了网络股泡沫大小的测度模型,说明网络股泡沫的存在,在此基础上确定了网络股泡沫大小的测度指标,并以雅虎公司股票为例对泡沫的大小进行了测度,结果符合网络泡沫的实际情况。 相似文献
18.
19.
在二极管泵浦固体激光器耦合光学系统中,柱面透镜起着非常重要的作用。随着系统轻量化、小型化的要求需要用重量轻、尺寸小的光学器件来替代。本文介绍一种用于替代柱面透镜的二元光学元件的设计和制作方法。 相似文献
20.
针对受参数不确定和外扰影响的混沌Lorenz系统,提出一种基于径向基函数(RBF)神经网 络的滑模控制方法.基于被控系统在不稳定平衡点处状态误差的可控规范形,设计滑模切换 面并将其作为神经网络的唯一输入.单入单出形式的RBF控制器隐层只需7个径向基函数,网 络的权值则依滑模趋近条件在线确定.仿真表明该控制器对系统参数突变和外部干扰具有鲁棒性,同时抑制了抖振.
关键词:
混沌控制
滑模
径向基函数神经网络
Lorenz系统 相似文献