全文获取类型
收费全文 | 7405篇 |
免费 | 995篇 |
国内免费 | 782篇 |
专业分类
电工技术 | 696篇 |
综合类 | 1060篇 |
化学工业 | 339篇 |
金属工艺 | 102篇 |
机械仪表 | 388篇 |
建筑科学 | 216篇 |
矿业工程 | 40篇 |
能源动力 | 143篇 |
轻工业 | 164篇 |
水利工程 | 90篇 |
石油天然气 | 118篇 |
武器工业 | 85篇 |
无线电 | 1077篇 |
一般工业技术 | 1001篇 |
冶金工业 | 55篇 |
原子能技术 | 100篇 |
自动化技术 | 3508篇 |
出版年
2024年 | 31篇 |
2023年 | 99篇 |
2022年 | 120篇 |
2021年 | 176篇 |
2020年 | 252篇 |
2019年 | 233篇 |
2018年 | 235篇 |
2017年 | 274篇 |
2016年 | 299篇 |
2015年 | 300篇 |
2014年 | 376篇 |
2013年 | 646篇 |
2012年 | 542篇 |
2011年 | 569篇 |
2010年 | 407篇 |
2009年 | 426篇 |
2008年 | 494篇 |
2007年 | 525篇 |
2006年 | 446篇 |
2005年 | 395篇 |
2004年 | 331篇 |
2003年 | 294篇 |
2002年 | 261篇 |
2001年 | 179篇 |
2000年 | 196篇 |
1999年 | 146篇 |
1998年 | 130篇 |
1997年 | 121篇 |
1996年 | 103篇 |
1995年 | 71篇 |
1994年 | 102篇 |
1993年 | 76篇 |
1992年 | 65篇 |
1991年 | 36篇 |
1990年 | 36篇 |
1989年 | 29篇 |
1988年 | 24篇 |
1987年 | 18篇 |
1986年 | 18篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 18篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1975年 | 3篇 |
排序方式: 共有9182条查询结果,搜索用时 484 毫秒
1.
针对自动飞行控制系统结构复杂、关联部件众多,发生故障时诊断时间长,从而影响飞机运行效率的问题,提出一种基于飞机通信寻址报告系统(ACARS)的远程实时故障诊断方案。首先,分析自动飞行控制系统的故障特点,设计搭建检测滤波器;然后,利用ACARS数据链实时发送的自动飞行控制系统的关键信息进行相关部件的残差计算,并根据残差决策算法进行故障诊断及定位;最后,针对不同故障部件残差间的差异大、决策门限无法统一的缺点,提出基于二次差值的残差决策改进算法,减缓了检测对象的整体变化趋势,降低了随机噪声和干扰的影响,避免了将瞬态故障诊断为系统故障的情况。实验仿真结果表明,基于二次差值的改进残差决策算法避免了多决策门限的复杂性,在采样时间为0.1 s的情况下,故障检测所需时间大约为2 s,故障检测时间大幅降低,有效故障检测率大于90%。 相似文献
2.
In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models. 相似文献
3.
This paper introduces a simultaneous process optimization and heat integration approach, which can be used directly with the rigorous models in process simulators. In this approach, the overall process is optimized utilizing external derivative-free optimizers, which interact directly with the process simulation. The heat integration subproblem is formulated as an LP model and solved simultaneously during optimization of the flowsheet to update the minimum utility and heat exchanger area targets. A piecewise linear approximation for the composite curve is applied to obtain more accurate heat integration results. This paper describes the application of this simultaneous approach for three cases: a recycle process, a separation process and a power plant with carbon capture. Case study results indicate that this simultaneous approach is relatively easy to implement and achieves higher profit and lower operating cost and, in the case of the power plant example, higher net efficiency than the sequential approach. 相似文献
4.
The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field. 相似文献
5.
ABSTRACTThis paper presents an empirical assessment of four state-of-the-art risk-averse approaches to deal with the capacitated lot-sizing problem under stochastic demand. We analyse two mean-risk models based on the semideviation and on the conditional value-at-risk risk measures, and alternate first and second-order stochastic dominance approaches. The extensive computational experiments based on different instances characteristics and on a case-study suggest that CVaR exhibits a good trade-off between risk and performance, followed by the semideviation and first-order stochastic dominance approach. For all approaches, enforcing risk-aversion helps to reduce the cost-standard deviation substantially, which is usually accomplished via increasing production rates. Overall, we can say that very risk-averse decision-makers would be willing to pay an increased price to have a much less risky solution given by CVaR . In less risk-averse settings, though, semideviation and first-order stochastic dominance can be appealing alternatives to provide significantly more stable production planning costs with a marginal increase of the expected costs. 相似文献
6.
7.
Miroslav Kárný Marko Ruman 《International Journal of Adaptive Control and Signal Processing》2021,35(5):660-675
Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential. 相似文献
8.
G. Inglese 《Inverse Problems in Science & Engineering》2019,27(4):439-459
We deal with the mathematical model of the incremental degradation of the internal coating (e.g. a polymeric material) of a metallic pipe in which a fluid flows relatively fast. The fluid drags solid impurities so that longitudinal scratches, inaccessible to any direct inspection procedure, are produced on the coating. Time evolution of this kind of defects can be reconstructed from the knowledge of a sequence of temperature maps of the external surface. The time-varying orthogonal section of this damaged interface is determined as a function of time and polar angle through the identification of a suitable effective heat transfer coefficient by means of Thin Plate Approximation. 相似文献
9.
针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标,忽略了当前小区用户对邻小区用户同频干扰的问题,为提升边缘用户性能的同时兼顾系统整体性能,提出了一种LTE系统小区间上行联合功率控制(UJPC)算法。该算法采用单基站三扇区为系统模型,以最优化系统吞吐量比例公平函数为目标,首先根据最小信干噪比(SINR)约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型,然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明,与基准的开环功控方案相比,联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率,其最佳性能增益能达到50%。 相似文献
10.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献