全文获取类型
收费全文 | 8692篇 |
免费 | 1486篇 |
国内免费 | 829篇 |
专业分类
电工技术 | 1106篇 |
综合类 | 888篇 |
化学工业 | 314篇 |
金属工艺 | 200篇 |
机械仪表 | 813篇 |
建筑科学 | 417篇 |
矿业工程 | 297篇 |
能源动力 | 177篇 |
轻工业 | 121篇 |
水利工程 | 175篇 |
石油天然气 | 96篇 |
武器工业 | 124篇 |
无线电 | 1178篇 |
一般工业技术 | 1244篇 |
冶金工业 | 76篇 |
原子能技术 | 65篇 |
自动化技术 | 3716篇 |
出版年
2024年 | 45篇 |
2023年 | 131篇 |
2022年 | 204篇 |
2021年 | 244篇 |
2020年 | 273篇 |
2019年 | 303篇 |
2018年 | 314篇 |
2017年 | 353篇 |
2016年 | 381篇 |
2015年 | 457篇 |
2014年 | 556篇 |
2013年 | 597篇 |
2012年 | 744篇 |
2011年 | 781篇 |
2010年 | 618篇 |
2009年 | 695篇 |
2008年 | 646篇 |
2007年 | 684篇 |
2006年 | 543篇 |
2005年 | 463篇 |
2004年 | 396篇 |
2003年 | 331篇 |
2002年 | 255篇 |
2001年 | 201篇 |
2000年 | 160篇 |
1999年 | 114篇 |
1998年 | 98篇 |
1997年 | 89篇 |
1996年 | 75篇 |
1995年 | 69篇 |
1994年 | 35篇 |
1993年 | 34篇 |
1992年 | 28篇 |
1991年 | 23篇 |
1990年 | 16篇 |
1989年 | 11篇 |
1988年 | 13篇 |
1987年 | 8篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
目的 为了解决目前三维数据隐藏算法不能兼顾无失真和盲提取的问题,提出一种新的完全无失真的三维网格模型数据隐藏盲算法。方法 首先使用混沌逻辑映射选择嵌入与提取模式,保证数据的安全性。然后利用面元素重排,完全不会造成三维模型失真的性质,通过不同嵌入模式规则对三角面元素进行重排,以嵌入秘密数据。接收端则可根据相应的提取模式规则提取秘密数据。结果 仿真结果与分析表明,该算法不会对三维模型造成任何失真,嵌入容量为每顶点2比特,且能抵抗仿射变换攻击、噪声攻击和平滑攻击等。结论 这种三维数据隐藏盲算法无失真,容量大、安全性高、鲁棒性强,适用于三维载体不容修改的情形,如军事、医学、秘密通信和版权保护等。 相似文献
2.
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. 相似文献
3.
从生产安全运行的管理要求;电压压降和电流的限制及信号的衰减;网络运行时间的要求;系统设计的影响;备用能力的考虑等各个方面,结合上海赛科聚苯乙烯项目的具体设计,分析隔爆条件下FF现场总线的H1网段负载能力的设计,以供大家探讨。 相似文献
4.
丝网气液分离器分离性能和压力损失分析 总被引:3,自引:0,他引:3
对丝网气液分离器的分离机理进行了详细分析,在此基础上给出了丝网气液分离器的分离效率和压降计算公式。与HG/T 21618-1998《丝网除沫器》中的公式相比,此公式可以用于任意组合的丝网结构,更具普适性,并且能定量分析各种分离机理对分离的贡献。对丝网式空气过滤器计算的结果表明,此公式具有很好的精度,可以用于工程设计。 相似文献
5.
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. 相似文献
6.
A cell vertex finite volume method for the solution of steady compressible turbulent flow problems on unstructured hybrid
meshes of tetrahedra, prisms, pyramids and hexahedra is described. These hybrid meshes are constructed by firstly discretising
the computational domain using tetrahedral elements and then by merging certain tetrahedra. A one equation turbulence model
is employed and the solution of the steady flow equations is obtained by explicit relaxation. The solution process is accelerated
by the addition of a multigrid method, in which the coarse meshes are generated by agglomeration, and by parallelisation.
The approach is shown to be effective for the simulation of a number of 3D flows of current practical interest.
Sponsored by The Research Council of Norway, project number 125676/410
Dedicated to the memory of Prof. Mike Crisfield, a respected colleague 相似文献
7.
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. 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
使用连续小波变换讨论了某些偏微分方程和相应的积分方程之间的关系.使用连续小波变换能够将这些偏微分方程变换成相应的积分方程,这些偏微分方程与相应的积分方程不仅在弱收敛意义下是等价的,而且在范数收敛意义下也是等价的. 相似文献