首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6775篇
  免费   864篇
  国内免费   670篇
电工技术   508篇
综合类   853篇
化学工业   531篇
金属工艺   121篇
机械仪表   322篇
建筑科学   121篇
矿业工程   49篇
能源动力   131篇
轻工业   111篇
水利工程   69篇
石油天然气   152篇
武器工业   73篇
无线电   1044篇
一般工业技术   885篇
冶金工业   107篇
原子能技术   112篇
自动化技术   3120篇
  2024年   21篇
  2023年   94篇
  2022年   106篇
  2021年   141篇
  2020年   215篇
  2019年   200篇
  2018年   191篇
  2017年   236篇
  2016年   270篇
  2015年   257篇
  2014年   345篇
  2013年   613篇
  2012年   489篇
  2011年   497篇
  2010年   366篇
  2009年   400篇
  2008年   434篇
  2007年   481篇
  2006年   415篇
  2005年   358篇
  2004年   304篇
  2003年   299篇
  2002年   248篇
  2001年   173篇
  2000年   175篇
  1999年   133篇
  1998年   113篇
  1997年   104篇
  1996年   89篇
  1995年   61篇
  1994年   83篇
  1993年   64篇
  1992年   62篇
  1991年   29篇
  1990年   33篇
  1989年   27篇
  1988年   25篇
  1987年   16篇
  1986年   19篇
  1985年   21篇
  1984年   12篇
  1983年   18篇
  1982年   11篇
  1981年   11篇
  1980年   9篇
  1979年   8篇
  1978年   4篇
  1977年   10篇
  1976年   5篇
  1975年   5篇
排序方式: 共有8309条查询结果,搜索用时 31 毫秒
1.
诱导式卫星欺骗干扰可诱导航空器逐渐偏离预定航迹,难以被发现,因此及时有效地检测干扰是飞行安全的保障。在现有紧组合导航体制基础上,设计了一种基于误差估值累加开环校正的紧组合导航结构,并证明了其性能与传统闭环校正紧组合导航性能等效。在此结构中,将紧组合导航系统与自适应序贯概率比检测方法结合,提出了一种基于误差估值累加开环校正的诱导式欺骗检测方法,融合紧组合导航信息与其他不受欺骗影响的导航信息,构建欺骗检测统计量进行诱导式欺骗检测。仿真结果表明,开环校正结构可避免随时间累加的惯性导航系统误差所导致的组合导航滤波器发散问题,同时欺骗检测方法可进一步提高算法对“最坏”情形下微小诱导式欺骗的检测效果。  相似文献   
2.
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.  相似文献   
3.
4.
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.  相似文献   
5.
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.  相似文献   
6.
针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标,忽略了当前小区用户对邻小区用户同频干扰的问题,为提升边缘用户性能的同时兼顾系统整体性能,提出了一种LTE系统小区间上行联合功率控制(UJPC)算法。该算法采用单基站三扇区为系统模型,以最优化系统吞吐量比例公平函数为目标,首先根据最小信干噪比(SINR)约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型,然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明,与基准的开环功控方案相比,联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率,其最佳性能增益能达到50%。  相似文献   
7.
Crossover designs are an extremely useful tool to investigators, and group sequential methods have proven highly proficient at improving the efficiency of parallel group trials. Yet, group sequential methods and crossover designs have rarely been paired together. One possible explanation for this could be the absence of a formal proof of how to strongly control the familywise error rate in the case when multiple comparisons will be made. Here, we provide this proof, valid for any number of initial experimental treatments and any number of stages, when results are analyzed using a linear mixed model. We then establish formulae for the expected sample size and expected number of observations of such a trial, given any choice of stopping boundaries. Finally, utilizing the four-treatment, four-period TOMADO trial as an example, we demonstrate that group sequential methods in this setting could have reduced the trials expected number of observations under the global null hypothesis by over 33%.  相似文献   
8.
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.  相似文献   
9.
It is shown that, for the spectrum analysis of digital quasi-periodic signals, one must use a procedure based on approximating the sequence of data readouts by a first-order trigonometric polynomial with a varying frequency of its harmonic functions.  相似文献   
10.
用于单芯片系统的改进型WXGA LCoS成像器   总被引:1,自引:1,他引:0  
本文讨论用于单芯片时序混色的菲利浦DD-720硅基液晶(LCoS)片。这种芯片主要用于HDTV背投影机和多媒体系统。与菲利浦以前的单片LCoS设计相比,由于该芯片具有电接口接点较少、封装简单和温度传感器内置等许多特点,使其应用于投影系统时成本降低。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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