首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   376680篇
  免费   48442篇
  国内免费   40441篇
电工技术   43201篇
技术理论   18篇
综合类   38834篇
化学工业   54176篇
金属工艺   13278篇
机械仪表   26834篇
建筑科学   24409篇
矿业工程   8466篇
能源动力   13034篇
轻工业   20426篇
水利工程   11871篇
石油天然气   12689篇
武器工业   4896篇
无线电   43646篇
一般工业技术   35968篇
冶金工业   9690篇
原子能技术   4725篇
自动化技术   99402篇
  2024年   1606篇
  2023年   5452篇
  2022年   10398篇
  2021年   12664篇
  2020年   12738篇
  2019年   11274篇
  2018年   10606篇
  2017年   14126篇
  2016年   15873篇
  2015年   17547篇
  2014年   20878篇
  2013年   24695篇
  2012年   28407篇
  2011年   31329篇
  2010年   23259篇
  2009年   23680篇
  2008年   24789篇
  2007年   28441篇
  2006年   25924篇
  2005年   22455篇
  2004年   18429篇
  2003年   15361篇
  2002年   11996篇
  2001年   9713篇
  2000年   8318篇
  1999年   6612篇
  1998年   5402篇
  1997年   4446篇
  1996年   3732篇
  1995年   3144篇
  1994年   2662篇
  1993年   1907篇
  1992年   1583篇
  1991年   1250篇
  1990年   1011篇
  1989年   794篇
  1988年   560篇
  1987年   328篇
  1986年   291篇
  1985年   347篇
  1984年   328篇
  1983年   204篇
  1982年   283篇
  1981年   145篇
  1980年   167篇
  1979年   85篇
  1978年   43篇
  1977年   43篇
  1976年   20篇
  1959年   40篇
排序方式: 共有10000条查询结果,搜索用时 903 毫秒
141.
为解决共享交通下的共乘用户群体发现效率低、准确率不高问题,依据R-树原理建立GeoOD-Tree索引,并在此基础上提出以最大化共乘率为目标的群体发现策略。首先,对原始时空轨迹数据进行特征提取与标定处理,挖掘有效出行起讫点(OD)轨迹;其次,针对用户起讫点轨迹的特征,建立GeoOD-Tree索引进行有效的存储管理;最后,给出以最大化共乘行程为目标的群体发现模型,并运用K最近邻(KNN)查询对搜索空间剪枝压缩,提高群体发现效率。采用西安市近12000辆出租车营运轨迹数据,选取动态时间规整(DTW)等典型算法与所提算法在查询效率与准确率上进行性能对比分析。与DTW算法相比,所提算法的准确率提高了10.12%,查询效率提高了约15倍。实验结果表明提出的群体发现策略能有效提高共乘用户群体发现的准确率和效率,可有效提升共乘出行方式的出行率。  相似文献   
142.
一种北斗联合低轨星座的导航增强方法研究   总被引:1,自引:0,他引:1  
单纯依靠北斗导航系统提供定位导航授时服务,存在卫星信号落地功率低、易受遮蔽和阻断的不足。针对此问题,研究了一种北斗联合低轨星座实现导航增强的系统架构;提出了一种新的适应严重遮蔽或干扰条件下,基于到达时间(TOA)和到达频率(FOA)联合观测的定位解算算法;对高中低轨混合星座条件下的覆盖特性和精度衰减因子进行了仿真分析。分析结果表明,用户可见星数平均增加了64.2%,位置精度衰减因子(PDOP)平均改善了28.7%。研究结果可为下一代北斗的论证设计与研制建设提供参考借鉴。  相似文献   
143.
Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.  相似文献   
144.
The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one.  相似文献   
145.
To realize joint optimization of spatial diversity and equalization combining in the intersymbol interference (ISI) channel, an iterative equalization combining algorithm is proposed. The proposed algorithm uses the coefficients of Turbo equalization to calculate the combination weights without estimating the signal to noise ratio in each diversity branch. The equalized symbols from different diversity branches are combined, and the extrinsic information output from the decoder is fed back to the equalizers, so as to exchange soft information between the equalizers and the decoder. The performance of the proposed algorithm is analyzed using the extrinsic information transfer (EXIT) chart and verified by simulations. Results show that our approach fully exploits time domain information from the multipath channel and spatial domain information from multi receiving antennas, which efficiently improve the performance of the receiver in the severe ISI channel.  相似文献   
146.
In this paper, an adaptive control approach is designed for compensating the faults in the actuators of chaotic systems and maintaining the acceptable system stability. We propose a state‐feedback model reference adaptive control scheme for unknown chaotic multi‐input systems. Only the dimensions of the chaotic systems are required to be known. Based on Lyapunov stability theory, new adaptive control laws are synthesized to accommodate actuator failures and system nonlinearities. An illustrative example is studied. The simulation results show the effectiveness of the design method. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   
147.
Structural failures (bridge or building collapses) and geohazards (landslides, ground subsidence or earthquakes) are worldwide problems that often lead to significant economic and loss of life. Monitoring the deformation of both natural phenomena and man-made structures is a major key to assessing structural dynamic responses. Actually, this monitoring process is under real-time demand for developing warning and alert systems.One of the most used techniques for real-time deformation monitoring is the Global Navigation Satellite System (GNSS) real-time procedure, where the relative positioning approach, using a well-known reference station, has been applied.This study was conducted to evaluate the actual quality of the real-time kinematic Precise Point Positioning (PPP) GNSS solution for deformation monitoring, where it can be concluded that a promise tool is under development and should be taken into account on actual and near future real-time deformation monitoring studies and applications.  相似文献   
148.
149.
We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.  相似文献   
150.
An intertwined supply network (ISN) is an entirety of interconnected supply chains (SC) which, in their integrity secure the provision of society and markets with goods and services. The ISNs are open systems with structural dynamics since the firms may exhibit multiple behaviours by changing the buyer-supplier roles in interconnected or even competing SCs. From the positions of resilience, the ISNs as a whole provide services to society (e.g. food service, mobility service or communication service) which are required to ensure a long-term survival. The analysis of survivability at the level of ISN requires a consideration at a large scale as resilience of individual SCs. The recent example of coronavirus COVID-19 outbreak clearly shows the necessity of this new perspective. Our study introduces a new angle in SC resilience research when a resistance to extraordinary disruptions needs to be considered at the scale of viability. We elaborate on the integrity of the ISN and viability. The contribution of our position study lies in a conceptualisation of a novel decision-making environment of ISN viability. We illustrate the viability formation through a dynamic game-theoretic modelling of a biological system that resembles the ISN. We discuss some future research areas.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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