全文获取类型
收费全文 | 29999篇 |
免费 | 3265篇 |
国内免费 | 2085篇 |
专业分类
电工技术 | 3597篇 |
技术理论 | 7篇 |
综合类 | 3935篇 |
化学工业 | 1063篇 |
金属工艺 | 417篇 |
机械仪表 | 1925篇 |
建筑科学 | 8621篇 |
矿业工程 | 533篇 |
能源动力 | 594篇 |
轻工业 | 484篇 |
水利工程 | 350篇 |
石油天然气 | 706篇 |
武器工业 | 325篇 |
无线电 | 3106篇 |
一般工业技术 | 1861篇 |
冶金工业 | 445篇 |
原子能技术 | 256篇 |
自动化技术 | 7124篇 |
出版年
2024年 | 79篇 |
2023年 | 360篇 |
2022年 | 672篇 |
2021年 | 773篇 |
2020年 | 846篇 |
2019年 | 680篇 |
2018年 | 659篇 |
2017年 | 798篇 |
2016年 | 969篇 |
2015年 | 1114篇 |
2014年 | 2141篇 |
2013年 | 1731篇 |
2012年 | 2386篇 |
2011年 | 2561篇 |
2010年 | 2129篇 |
2009年 | 2108篇 |
2008年 | 2130篇 |
2007年 | 2382篇 |
2006年 | 2084篇 |
2005年 | 1688篇 |
2004年 | 1276篇 |
2003年 | 1081篇 |
2002年 | 863篇 |
2001年 | 731篇 |
2000年 | 653篇 |
1999年 | 488篇 |
1998年 | 350篇 |
1997年 | 268篇 |
1996年 | 239篇 |
1995年 | 215篇 |
1994年 | 176篇 |
1993年 | 130篇 |
1992年 | 141篇 |
1991年 | 77篇 |
1990年 | 67篇 |
1989年 | 68篇 |
1988年 | 49篇 |
1987年 | 28篇 |
1986年 | 24篇 |
1985年 | 17篇 |
1984年 | 17篇 |
1983年 | 9篇 |
1982年 | 14篇 |
1981年 | 14篇 |
1980年 | 9篇 |
1979年 | 9篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1959年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
详细介绍了SVPWM的原理。采用一种易于数字化实现的SVPWM算法实现三相电压型SVPWM整流器,该整流器采用dq坐标系下的双闭环控制。给出了PI调节器参数,以及主电路电感、电容的计算公式。在Matlab Simulink环境下搭建整流器仿真器模型。仿真结果表明,整流器能实现单位功率因数整流和能量双向流动,验证了SVPWM算法和控制系统设计方法的正确性。 相似文献
992.
993.
Vivaldi天线及其改进方法的仿真研究 总被引:2,自引:1,他引:1
选择强方向性Vivaldi天线作为研究对象,基于等效电路等理论分析确定了天线的结构参数,采用高频仿真软件Ansoft HFSS 11对天线的电性能进行定量分析。提出在天线两侧开栅栏和尾部加抗流栅栏的优化方法,将天线金属贴片上的表面电流汇聚于槽线部分,明显改善了天线的辐射特性,在350 MHz和830 MHz的增益分别达到5.7 dBi和8.7 dBi。 相似文献
994.
The parallelism attained by the use of Field Programmable Gate Arrays (FPGAs) has shown remarkable potential for accelerating control systems applications. This comes at a time when well established methods based on inherited serial Central Processor Units (CPUs) cannot guarantee solutions for the increasing execution speed demands. However, the transition from serial to parallel architectures represents a tremendous challenge due to overwhelming numbers of unexplored options and conflicting factors. The work presented achieves a parallelisation characterisation for generic MIMO systems using stand-alone FPGA implementations. The main contribution is that a very fine subset of possible serial/parallel implementations is obtained. This is used to achieve a flexible trade-off between cost and performance. Automatic optimisation of latency, occupied FPGA area and execution speed is attained and justified in respect to most of the feasible scenarios. 相似文献
995.
Social media services such as YouTube and Flickr have become online necessities for millions of users worldwide. Social media are online services that enable users to share contents, opinions, and perspectives that support communication with other users. Social media places an emphasis on the shared experience between users, which we call co-experience. However, the online characteristics of social media increase psychological distance between users, which, in turn, results in a decrease in the quality of co-experience. Hence, as the goal of this study, we theoretically modeled and empirically verified the antecedents and user experience-based consequences of psychological distance in a social media-enhanced real-time streaming video service. In order to reduce psychological distance, we introduced two system elements: inhabited space (the degree of being situated in context and in a meaningful place) and isomorph effects (the degree of preserving the structure of a user’s actions). We constructed a social media-enhanced real-time streaming video service prototype and conducted a field experiment with actual social media users. The prototype, which streamed a live baseball game, enabled users to simultaneously view the game from remote locations and to interact with each other through cheering tools. The results indicate that inhabited space and isomorph effects reduce psychological distance between users, and this, in turn, enhances co-experience. This paper ends with theoretical as well as practical implications of the study. 相似文献
996.
997.
《国际计算机数学杂志》2012,89(14):3196-3198
In [Y.l. Wang, T. Chaolu, Z. Chen, Using reproducing kernel for solving a class of singular weakly nonlinear boundary value problems, Int. J. Comput. Math. 87(2) (2010), pp. 367–380], we present three algorithms to solve a class of ordinary differential equations boundary value problems in reproducing kernel space. It is worth noting that our methods can get the solution of partial integro-differential equation. In this note, we use method 2 [M. Dehghan, Solution of a partial integro-differential equation arising from viscoelasticity, Int. J. Comput. Math. 83(1) (2006), pp. 123–129] to solve a class of partial integro-differential equation in reproducing kernel space. Numerical example shows our method is effective and has high accuracy. 相似文献
998.
《国际计算机数学杂志》2012,89(8):1366-1374
In this study we are concerned with the local convergence of a Newton-type method introduced by us [I.K. Argyros and D. Chen, On the midpoint iterative method for solving nonlinear equations in Banach spaces, Appl. Math. Lett. 5 (1992), pp. 7–9.] for approximating a solution of a nonlinear equation in a Banach space setting. This method has also been studied by Homeier [H.H.H. Homeier, A modified Newton method for rootfinding with cubic convergence, J. Comput. Appl. Math. 157 (2003), pp. 227–230.] and Özban [A.Y. Özban, Some new variants of Newton's method, Appl. Math. Lett. 17 (2004), pp. 677–682.] in real or complex space. The benefits of using this method over other methods using the same information have been explained in [I.K. Argyros, Computational theory of iterative methods, in Studies in Computational Mathematics, Vol. 15, C.K. Chui and L. Wuytack, eds., Elsevier Science Inc., New York, USA, 2007.; I.K. Argyros and D. Chen, On the midpoint iterative method for solving nonlinear equations in Banach spaces, Appl. Math. Lett. 5 (1992), pp. 7–9.; H.H.H. Homeier, A modified Newton method for rootfinding with cubic convergence, J. Comput. Appl. Math. 157 (2003), pp. 227–230.; A.Y. Özban, Some new variants of Newton's method, Appl. Math. Lett. 17 (2004), pp. 677–682.]. Here, we give the convergence radii for this method under a type of weak Lipschitz conditions proven to be fruitful by Wang in the case of Newton's method [X. Wang, Convergence of Newton's method and inverse function in Banach space, Math. Comput. 68 (1999), pp. 169–186 and X. Wang, Convergence of Newton's method and uniqueness of the solution of equations in Banach space, IMA J. Numer. Anal. 20 (2000), pp. 123–134.]. Numerical examples are also provided. 相似文献
999.
Intelligent service robots provide various services to users by understanding the context and goals of a user task. In order to provide more reliable services, intelligent service robots need to consider various factors, such as their surrounding environments, users' changing needs, and constrained resources. To handle these factors, most of the intelligent service robots are controlled by a task‐based control system, which generates a task plan that represents a sequence of actions, and executes those actions by invoking the corresponding functions. However, the traditional task‐based control systems lack the consideration of resource factors even though intelligent service robots have limited resources (limited computational power, memory space, and network bandwidth). Moreover, system‐specific concerns such as the relationships among functional modules are not considered during the task generation phase. Without considering both the resource conditions and interdependencies among software modules as a whole, it will be difficult to efficiently manage the functionalities that are essential to provide core services to users. In this paper, we propose a mechanism for intelligent service robots to efficiently use their resources on‐demand by separating system‐specific information from task generation. We have defined a sub‐architecture that corresponds to each action of a task plan, and provides a way of using the limited resources by minimizing redundant software components and maintaining essential components for the current action. To support the optimization of resource consumption, we have developed a two‐phase optimization process, which is composed of the topological and temporal optimization steps. We have conducted an experiment with these mechanisms for an infotainment robot, and simulated the optimization process. Results show that our approach contributed to increase the utilization rate by 20% of the robot resources. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
1000.
Vanishing point detection algorithms based on 2D histogramming techniques have been employed in a variety of computer vision systems. Previous algorithms achieved some good results but still failed to maintain a balanced performance in both accuracy and time. Recent research (Li et al., 2010) shows that, vanishing point detection could be converted to a 1D histogram search problem, which largely accelerates the procedure. In this paper, we further improve this idea and propose a complete scheme for vanishing point detection from images of the so called “Manhattan world”. We test our algorithm and some commonly used vanishing point detection methods on public database YorkUrbanDB and our own implemented database PKUCampusDB. Our algorithm shows significant performance improvements. 相似文献