首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   150248篇
  免费   21626篇
  国内免费   14142篇
电工技术   21849篇
技术理论   11篇
综合类   16878篇
化学工业   8087篇
金属工艺   3849篇
机械仪表   10664篇
建筑科学   6994篇
矿业工程   4360篇
能源动力   4874篇
轻工业   4520篇
水利工程   3459篇
石油天然气   4282篇
武器工业   1746篇
无线电   23787篇
一般工业技术   8878篇
冶金工业   3103篇
原子能技术   538篇
自动化技术   58137篇
  2024年   1154篇
  2023年   3265篇
  2022年   6266篇
  2021年   6794篇
  2020年   6954篇
  2019年   5313篇
  2018年   4567篇
  2017年   5455篇
  2016年   5913篇
  2015年   6789篇
  2014年   10789篇
  2013年   9828篇
  2012年   12087篇
  2011年   12405篇
  2010年   9173篇
  2009年   9702篇
  2008年   9518篇
  2007年   10635篇
  2006年   8850篇
  2005年   7636篇
  2004年   6325篇
  2003年   5415篇
  2002年   4316篇
  2001年   3628篇
  2000年   2942篇
  1999年   2297篇
  1998年   1754篇
  1997年   1449篇
  1996年   1170篇
  1995年   915篇
  1994年   707篇
  1993年   496篇
  1992年   350篇
  1991年   262篇
  1990年   218篇
  1989年   183篇
  1988年   119篇
  1987年   52篇
  1986年   54篇
  1985年   47篇
  1984年   36篇
  1983年   39篇
  1982年   44篇
  1981年   15篇
  1980年   18篇
  1979年   21篇
  1978年   8篇
  1975年   6篇
  1959年   8篇
  1951年   15篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.  相似文献   
82.
社会经济的快速发展促进了科学技术水平的显著提升,社会生产生活各个领域当中对计算机网络的应用程度不断提升,当前,网络已经成为了人们日常生活与工作的重要组成部分。为此,加强对网络安全等因素影响研究就显得格外重要。网络环境关系着用户的使用质量,更加影响人们的工作效率,加强对网络安全技术的研究时解决相关问题的核心内容。本文针对网络安全威胁因素以及常见的网络安全技术进行了简要分析。  相似文献   
83.
During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction.  相似文献   
84.
The paper proposes a limit analysis approach to define the ultimate load capacity of orthotropic composite laminates under biaxial loading and plane stress conditions. A lower bound to the collapse load multiplier is computed by solving a maximization nonlinear problem, according to the static theorem of limit analysis. To set up the optimization problem a stress field distribution is hypothesized at lamina level, moreover inter-lamina stresses are also considered. The effectiveness and validity of the proposed approach is shown by comparing the obtained numerical predictions both with available experimental data and with other numerical results carried out by means of a different numerical lower bound approach.  相似文献   
85.
设计了一种开关磁阻直线电机,使用JMAG软件对其进行了仿真和优化。进行了推力公式的推导,研究了导通顺序和初始位置对电机推力的影响,并分析了三种典型情况的磁力线分布。对电机的定子和动子的齿部和轭部高度、宽度及铁耗进行仿真优化,得出了最优参数。将有取向硅钢应用于该电机,研究了推力与轧制角的关系,并与使用普通硅钢的开关磁阻直线电机进行了对比,推力有一定提升。提出在动子齿部开切向槽的方案,结果表明,开切向槽对推力的影响较小,并能显著减小推力波动。  相似文献   
86.
This paper investigates the N-policy M/M/1 queueing system with working vacation and server breakdowns. As soon as the system becomes empty, the server begins a working vacation. The server works at a lower service rate rather than completely stopping service during a vacation period. The server may break down with different breakdown rates during the idle, working vacation, and normal busy periods. It is assumed that service times, vacation times, and repair times are all exponentially distributed. We analyze this queueing model as a quasi-birth–death process. Furthermore, the equilibrium condition of the system is derived for the steady state. Using the matrix-geometric method, we find the matrix-form expressions for the stationary probability distribution of the number of customers in the system and system performance measures. The expected cost function per unit time is constructed to determine the optimal values of the system decision variables, including the threshold N and mean service rates. We employ the particle swarm optimization algorithm to solve the optimization problem. Finally, numerical results are provided, and an application example is given to demonstrate the applicability of the queueing model.  相似文献   
87.
为解决依赖装维上门鉴别光网络单元故障带来的不便,可以从机器视觉入手实现自动化故障识别。近年,ImageNet挑战赛的成功推动了物体识别技术的跨越式发展,特别是基于卷积的深度学习技术在视觉识别方面已经达到人类水平,为光网络单元故障的自动识别提供了技术基础。文章对识别光网络单元的工作状态进行了研究,将设备工作状态分为7个场景,提出了利用手机APP采集图片识别故障的解决方案并投入了实际生产;重点阐述了深度学习模块的设计与实现,提出一种通过算法整合的方式综合运用物体检测和图像分类算法,分3阶段逐步求精,解决了图片过滤,光网络单元型号和状态识别等问题,实现了基于计算机视觉自动识别光网络单元故障。从数据上看产品的端到端准确率超过84%,识别速度达到10 FPS,月均提供服务超过1万人次,在减少用户等待的同时节约了人力资源。  相似文献   
88.
To minimize the mass and increase the bearing failure load of composite doublelap bolted joints, a three-step optimization strategy including feasible region reduction, optimization model decoupling and optimization was presented. In feasible region reduction, the dimensions of the feasible design region were reduced by selecting dominant design variables from numerous multilevel parameters by sensitivity analyses, and the feasible regions of variables were reduced by influence mechanism analyses. In model decoupling, the optimization model with a large number of variables was divided into various sub-models with fewer variables by variance analysis. In the third step, the optimization sub-models were solved one by one using a genetic algorithm, and the modified characteristic curve method was adopted as the failure prediction method. Based on the proposed optimization method, optimization of a double-lap single-bolt joint was performed using the ANSYS® code. The results show that the bearing failure load increased by 13.5% and that the mass decreased by 8.7% compared with those of the initial design of the joint, which validated the effectiveness of the three-step optimization strategy.  相似文献   
89.
近年来深度学习迅猛发展,颠覆了语音识别、图像分类、文本理解等领域的算法设计思路。深度学习因其具备强大的特征提取能力,在图像识别领域的成绩尤为突出。然而深度学习与视频监控领域的结合并不多,由于深度模型具有多层网络结构,算法复杂度大,训练和更新模型时比较耗时,很难满足实时性要求。回顾了深度学习的发展史,介绍了最近10年来国内外深度学习主要模型,论述了基于深度学习的目标跟踪算法,指出了各算法的优缺点,最后对当前该领域存在的问题和发展前景进行了总结和展望。  相似文献   
90.
The correct separation of chromosomes during mitosis is necessary to prevent genetic instability and aneuploidy, which are responsible for cancer and other diseases, and it depends on proper centrosome duplication. In a recent study, we found that Smy2 can suppress the essential role of Mps2 in the insertion of yeast centrosome into the nuclear membrane by interacting with Eap1, Scp160, and Asc1 and designated this network as SESA (S my2, E ap1, S cp160, A sc1). Detailed analysis showed that the SESA network is part of a mechanism which regulates translation of POM34 mRNA. Thus, SESA is a system that suppresses spindle pole body duplication defects by repressing the translation of POM34 mRNA. In this study, we performed a genome-wide screening in order to identify new members of the SESA network and confirmed Dhh1 as a putative member. Dhh1 is a cytoplasmic DEAD-box helicase known to regulate translation. Therefore, we hypothesized that Dhh1 is responsible for the highly selective inhibition of POM34 mRNA by SESA.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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