全文获取类型
收费全文 | 4851篇 |
免费 | 1039篇 |
国内免费 | 553篇 |
专业分类
电工技术 | 1031篇 |
综合类 | 552篇 |
化学工业 | 96篇 |
金属工艺 | 61篇 |
机械仪表 | 427篇 |
建筑科学 | 122篇 |
矿业工程 | 66篇 |
能源动力 | 61篇 |
轻工业 | 35篇 |
水利工程 | 50篇 |
石油天然气 | 49篇 |
武器工业 | 47篇 |
无线电 | 764篇 |
一般工业技术 | 579篇 |
冶金工业 | 35篇 |
原子能技术 | 10篇 |
自动化技术 | 2458篇 |
出版年
2024年 | 37篇 |
2023年 | 104篇 |
2022年 | 146篇 |
2021年 | 162篇 |
2020年 | 177篇 |
2019年 | 203篇 |
2018年 | 203篇 |
2017年 | 230篇 |
2016年 | 236篇 |
2015年 | 253篇 |
2014年 | 335篇 |
2013年 | 366篇 |
2012年 | 401篇 |
2011年 | 449篇 |
2010年 | 372篇 |
2009年 | 418篇 |
2008年 | 381篇 |
2007年 | 359篇 |
2006年 | 320篇 |
2005年 | 252篇 |
2004年 | 208篇 |
2003年 | 174篇 |
2002年 | 140篇 |
2001年 | 121篇 |
2000年 | 86篇 |
1999年 | 57篇 |
1998年 | 48篇 |
1997年 | 43篇 |
1996年 | 29篇 |
1995年 | 31篇 |
1994年 | 16篇 |
1993年 | 19篇 |
1992年 | 11篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 8篇 |
1988年 | 3篇 |
1987年 | 7篇 |
1985年 | 3篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1981年 | 2篇 |
1979年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有6443条查询结果,搜索用时 31 毫秒
1.
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. 相似文献
2.
从生产安全运行的管理要求;电压压降和电流的限制及信号的衰减;网络运行时间的要求;系统设计的影响;备用能力的考虑等各个方面,结合上海赛科聚苯乙烯项目的具体设计,分析隔爆条件下FF现场总线的H1网段负载能力的设计,以供大家探讨。 相似文献
3.
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. 相似文献
4.
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. 相似文献
5.
This article, the first of three articles on the synthesis of rice processing plants, focuses on the development of simplified mathematical models necessary for use in optimizing rice processing plants. The second concentrates on the optimal synthesis of a rice plant and the third on the sensitivity of the optimization to uncertainty in model parameters. Existing models for rice processing unit operations are not suitable for flowsheet optimization and new models need to be developed to overcome numerical difficulties that occur in optimization applications, specifically in mixed integer nonlinear programming (MINLP) applications. Simplified models of the drying, cooling, and tempering units are developed. In addition head rice yield models, used as a quality indicator, energy consumption, and economic models were also developed. Naturally, the new models exhibit some mismatch with respect to the existing models from which they were developed. However, a sensitivity analysis, presented in Part III, has shown that the optimal flowsheet structure was not sensitive to a lack of fit between the simplified and complex models. The simplified models were found adequate to be appropriate for use at the synthesis stage. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
使用连续小波变换讨论了某些偏微分方程和相应的积分方程之间的关系.使用连续小波变换能够将这些偏微分方程变换成相应的积分方程,这些偏微分方程与相应的积分方程不仅在弱收敛意义下是等价的,而且在范数收敛意义下也是等价的. 相似文献
9.
一种支持QoS的拓扑自适应动态组播路由算法 总被引:3,自引:0,他引:3
YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开,同时为接收方提供多个可选择的组播接入路径,以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长,可扩展性不好等问题。本文在分析这些算法的基础上,提出改进的支持QoS的动态组播路由算法,即拓扑自适应动态组播路由(Topology Adaptive Dynamic Multicast Routing,TADMR)算法。该算法避免了以往算法中大部分盲目的路径搜索,并使结点加入时延不再受限于固定的等待时钟,而与网络拓扑相自适应。性能分析和仿真结果表明,该算法具有较低的控制信令开销和结点加入时延,适用于各种网络规模和群组规模,具有良好的可扩展性。 相似文献
10.
Paul J. Flory 《Polymer International》1985,17(2):96-102
The earliest investigations on rubber elasticity, commencing in the 19th century, were necessarily limited to phenomenological interpretations. The realisation that polymers consist of very long molecular chains. commencing c. 1930, gave impetus to the molecular theory of rubber elasticity (1932-). according to which the high deformability of an elastomer, and the elastic force generated by deformation, stem from the configurations accessible to long molecular chains. Theories of rubber elasticity put forward from 1934-1946 relied on the assumption that the junctions of the rubber network undergo displacements that are affine in macroscopic strain. The theory of James and Guth (1947) dispensed with this premise, and demonstrated instead that the mean positions of the junctions of a ‘phantom’ network consisting of Gaussian chains devoid of material properties are affine in the strain. The vital significance of the distinction between the actual distribution of chain vectors in a network and their distribution if the junctions would be fixed at their mean positions went unnoticed for nearly 30 years. Experimental investigations, commencing with the incisive work of Gee in 1946. revealed large departures from the relationship of stress to strain predicted by the theories cited. This discrepancy prompted extensive studies, theoretical and experimental, during succeeding years. Inquiry into the fundamentals of polymer networks, formed for example by interlinking very long polymer molecules, exposed the need to take account of network imperfections, typically consisting of chains attached at only one end to a network junction. Various means were advocated to make corrections for these imperfections. The cycle rank ζ of the network has been shown (1976) to be the fundamental measure of its connectivity, regardless of the junction functionality and pattern of imperfections. Often overlooked is the copious interpenetration of the chains comprising typical elastomeric networks. Theories that attempt to represent such networks on a lattice are incompatible with this universal feature. Moreover, the dense interpenetration of chains may limit the ability of junctions in real networks to accommodate the fluctuations envisaged in the theory of phantom networks. It was suggested in 1975 that departures from the form predicted for the elastic equation of state are due to constraints on the fluctuations of junctions whose effect diminishes with deformation and with dilation. Formulation of a self-consistent theory based on this suggestion required recognition of the non-affine connection between the chain vector distribution function and the macroscopic strain in a real network, which may partake of characteristics of a phantom network in some degree. Implementation of the idea was achieved through postulation of domains of constraint affecting the equilibrium distribution of fluctuations of network junctions from their mean positions. This led in due course to a theory that accounts for the relationship of stress to strain virtually throughout the ranges of strain accessible to measurement. The theory establishes connections between structure and elastic properties. This is achieved with utmost frugality in arbitrary parameters. 相似文献