全文获取类型
收费全文 | 5565篇 |
免费 | 1043篇 |
国内免费 | 587篇 |
专业分类
电工技术 | 1050篇 |
综合类 | 650篇 |
化学工业 | 114篇 |
金属工艺 | 68篇 |
机械仪表 | 454篇 |
建筑科学 | 110篇 |
矿业工程 | 87篇 |
能源动力 | 58篇 |
轻工业 | 33篇 |
水利工程 | 57篇 |
石油天然气 | 56篇 |
武器工业 | 71篇 |
无线电 | 919篇 |
一般工业技术 | 577篇 |
冶金工业 | 39篇 |
原子能技术 | 17篇 |
自动化技术 | 2835篇 |
出版年
2024年 | 22篇 |
2023年 | 91篇 |
2022年 | 133篇 |
2021年 | 156篇 |
2020年 | 172篇 |
2019年 | 202篇 |
2018年 | 204篇 |
2017年 | 236篇 |
2016年 | 261篇 |
2015年 | 276篇 |
2014年 | 369篇 |
2013年 | 399篇 |
2012年 | 466篇 |
2011年 | 504篇 |
2010年 | 419篇 |
2009年 | 461篇 |
2008年 | 437篇 |
2007年 | 433篇 |
2006年 | 358篇 |
2005年 | 300篇 |
2004年 | 258篇 |
2003年 | 213篇 |
2002年 | 162篇 |
2001年 | 127篇 |
2000年 | 96篇 |
1999年 | 72篇 |
1998年 | 52篇 |
1997年 | 56篇 |
1996年 | 37篇 |
1995年 | 41篇 |
1994年 | 32篇 |
1993年 | 23篇 |
1992年 | 18篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 14篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 3篇 |
1985年 | 9篇 |
1984年 | 5篇 |
1983年 | 9篇 |
1982年 | 9篇 |
1981年 | 8篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 3篇 |
排序方式: 共有7195条查询结果,搜索用时 15 毫秒
1.
2.
Professional search in patent repositories poses several unique challenges. One key requirement is to search the entire affected space of concepts, following well-defined procedures to ensure traceability of results obtained. Several techniques have been introduced to enhance query generation, preferably via automated query term expansion, to improve retrieval effectiveness. Currently, these approaches are mostly limited to computing additional query terms from patent documents based on statistical measures. For conceptual search to solve the limitation of traditional keyword search standard dictionaries are used to provide synonyms and keyword phrases for query refinement. Studies show that these are insufficient in such highly specialized domains. In this paper, we present an approach to extract keyword phrases from query logs created during the validation procedure of the patent applications. This creates valuable domain-specific lexical databases for several specific patent classes that can be used to both expand as well as limit the scope of a patent search. This provides a more powerful means to guide a professional searcher through the search process. We evaluate the lexical databases based on real query sessions of patent examiners. 相似文献
3.
介绍了高压变频调速变压器及高压变频器系统的基本原理及结构,详细论述了系统各组成部分的功能,并进行了举例说明。 相似文献
4.
Hai Huang Haichao An Haibo Ma Shenyan Chen 《International journal for numerical methods in engineering》2019,117(3):291-315
This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization. 相似文献
5.
从生产安全运行的管理要求;电压压降和电流的限制及信号的衰减;网络运行时间的要求;系统设计的影响;备用能力的考虑等各个方面,结合上海赛科聚苯乙烯项目的具体设计,分析隔爆条件下FF现场总线的H1网段负载能力的设计,以供大家探讨。 相似文献
6.
基于PC机群的大地电磁Occam反演并行计算研究 总被引:4,自引:0,他引:4
Occam反演以其稳定收敛和不依赖于初始模型的特性被广泛应用于大地电磁数据的处理,但偏导数矩阵的计算和拉格朗日乘子的求取导致大量的模型正演,使得反演速度较低。为此,研究了用基于PC机群的并行计算来解决这一问题的方法。首先对Occam反演方法进行了阐述;然后,分析了反演方法中各计算耗费的时间,提出对约占计算量90%的偏导数和拉格朗日乘子进行并行计算的思想,即偏导数计算采用频点计算一级的大粒度并行,拉格朗日乘子扫描和一维搜索分别采用弘值计算一级的大粒度并行和频点计算一级的小粒度并行;给出了并行计算的实现方法,即在PC机群上,利用主一从编程模式实现Occam反演的整体并行计算。在计算中,采用任务组合方式,减少了通信量,较好地实现了负载均衡。在4节点PC机群上,对应于拉格朗日乘子的扫描和一维搜索方式,整体加速比分别达到3.36和2.83。 相似文献
7.
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. 相似文献
8.
Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology. 相似文献
9.
The multihop optical network is the most appropriate solution to satisfy the increasing applications of Internet services. This paper extends the regular Kautz graph to one with multiple layers in order to produce more architectural variations. The connectivity between adjacent layers utilizes the systematic connection patterns of a regular Kautz graph. A routing algorithm based on its property is presented. Optical passive star (OPS) couplers are adopted to implement our new topologies. Three scheduling criteria that can solve the contention problem in the intermediate nodes are evaluated and compared in terms of their capability to improve the accessibility. 相似文献
10.
A. Kaveh V. Kalatjari 《International journal for numerical methods in engineering》2003,58(5):771-791
In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献