全文获取类型
收费全文 | 636篇 |
免费 | 67篇 |
国内免费 | 52篇 |
专业分类
电工技术 | 32篇 |
综合类 | 56篇 |
化学工业 | 11篇 |
金属工艺 | 28篇 |
机械仪表 | 49篇 |
建筑科学 | 49篇 |
矿业工程 | 8篇 |
能源动力 | 9篇 |
轻工业 | 7篇 |
水利工程 | 8篇 |
石油天然气 | 7篇 |
武器工业 | 1篇 |
无线电 | 79篇 |
一般工业技术 | 65篇 |
冶金工业 | 7篇 |
原子能技术 | 1篇 |
自动化技术 | 338篇 |
出版年
2023年 | 7篇 |
2022年 | 13篇 |
2021年 | 13篇 |
2020年 | 12篇 |
2019年 | 17篇 |
2018年 | 11篇 |
2017年 | 18篇 |
2016年 | 30篇 |
2015年 | 30篇 |
2014年 | 47篇 |
2013年 | 25篇 |
2012年 | 41篇 |
2011年 | 54篇 |
2010年 | 32篇 |
2009年 | 52篇 |
2008年 | 44篇 |
2007年 | 35篇 |
2006年 | 46篇 |
2005年 | 37篇 |
2004年 | 31篇 |
2003年 | 36篇 |
2002年 | 23篇 |
2001年 | 11篇 |
2000年 | 15篇 |
1999年 | 13篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有755条查询结果,搜索用时 15 毫秒
61.
本文介绍了个性化网络教育的特点,对在Web服务器端和客户端进行学生浏览路径模式采集的各种方法进行了分析,探讨了如何将Web使用挖掘技术应用到个性化网络教育,最后介绍了由我们开发的个性化教育网站。 相似文献
62.
A path-planning problem is considered in the presence of moving polygonal obstacles in three dimensions. A particle is to be moved from a given initial position to a destination position amidst polygonal disjoint barriers moving along known linear trajectories. The particle can move in any direction in space with a single constraint that it cannot move faster than a given speed bound. All obstacles are slowly moving, i.e., their speeds are strictly slower than the maximum speed of the particle. The destination point is also permitted to move along a known trajectory and is assumed to be collision-free at all times. Three properties are stated and proved for a time-minimal path amidst moving polygonal barriers. A few extensions are considered, including piecewise linear motions of the obstacles. 相似文献
63.
本文研究了影响网络图线路数量的因素,提出了节点和有向线是组成线路的基本要素,以及用计算机绘制和计算网络的所有路径的计算方法.此方法可解决任意节点和有向线的网络中所有线路值和关键路径的时间计算. 相似文献
64.
翟俊祥 《西安建筑科技大学学报(自然科学版)》1992,(4)
本文指出目前组合逻辑电路分析方法的不足,提出了一种新的方法——条件通路法,使组合电路的逆向分析得以容易实现,从而完善了组合逻辑电路的分析方法。 相似文献
65.
In this paper we study the classical problem of finding disjoint paths in
graphs. This problem has been studied by a number of authors both for specific
graphs and general classes of graphs. Whereas for specific graphs many
(almost) matching upper and lower bounds are known for the competitiveness of
on-line algorithms, not much is known about how well on-line algorithms can
perform in the general setting. The best results obtained so far use the
expansion of a network to measure the algorithms performance. We use a
different parameter called the routing number that, as we will show, allows
more precise results than the expansion. It enables us to prove tight upper and
lower bounds for deterministic on-line algorithms. The upper bound is obtained
by surprisingly simple greedy-like algorithms. Interestingly, our upper bound
on the competitive ratio is even better than the best previous approximation
ratio for off-line algorithms. Furthermore, we introduce a refined variant of
the routing number and show that this variant allows us, for some classes of
graphs, to construct on-line algorithms with a competitive ratio significantly
below the best possible upper bound that could be obtained using the routing
number or the expansion of a network only. We also show that our on-line
algorithms can be transformed into efficient algorithms for the more general
unsplittable flow problem. 相似文献
66.
A VPN is an optical virtual private network (oVPN) built of wavelength paths within a multihop wavelength routing (WR) dense wavelength division multiplexing (DWDM) network. An efficient and general graph-theoretic model (the wavelength-graph (WG)) has been proposed along with an integer linear programming (ILP) formulation of setting up VPNs with given traffic requirements over a given WR-DWDM network with two protection scenarios. Here, we have exploited the advantages of traffic grooming, i.e., numerous traffic streams of a VPN can share a wavelength path. We have also generalized the model for setting up VPNs over a WR-DWDM system where multiple VPNs can share a single wavelength path. The objective of the optimization is in all cases to reduce resource usage at upper (electrical) layers (i.e., to reduce the load of the virtual routers), subject to constrained amount of capacity of each wavelength channel and limited number of wavelengths. Here, we propose and compare three basic methods for configuring oVPNs and investigate various parameter settings. 相似文献
67.
The hierarchical hypercube network is suitable for massively parallel systems. One of its appealing properties is the low number of connections per processor, which can facilitate the VLSI design and fabrication. Other alluring features include symmetry and logarithmic diameter, which can derive easy and fast algorithms for communication. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of the hierarchical hypercube network. Their maximal length is not greater than max{2m+1+2m+1,2m+1+m+4}, where 2m+1 is the diameter. The effectiveness of node-disjoint paths is further verified by experiments. 相似文献
68.
Reliability of a computer network in case capacity weight varying with arcs, nodes and types of commodity 总被引:1,自引:0,他引:1
The computer network can be modeled as a capacitated-flow network. This paper concentrates on a two-commodity capacitated-flow network with three characters: (1) nodes as well as arcs have multiple possible capacities and may fail, (2) each component (arc/node) has both capacity and cost attributes; and (3) the capacity weight varies with arcs, nodes and types of commodity (or named file). We study the possibility that a given quantity of two types of files can be transmitted through this network simultaneously under the budget constraint. Such a possibility is named the system reliability which is a performance index to measure the quality level of supply demand systems such as computer, telecommunication, electric-power transmission and transportation systems. The approach of minimal paths is applied to describe the relationship among flow assignments and capacity vectors. A simple algorithm in terms of minimal paths is proposed to evaluate the system reliability. 相似文献
69.
Abdelhamid Mellouk Saïd Hoceïni Yacine Amirat 《International Journal of Communication Systems》2007,20(10):1113-1130
In this paper, we propose two adaptive routing algorithms based on reinforcement learning. In the first algorithm, we have used a neural network to approximate the reinforcement signal, allowing the learner to take into account various parameters such as local queue size, for distance estimation. Moreover, each router uses an online learning module to optimize the path in terms of average packet delivery time, by taking into account the waiting queue states of neighbouring routers. In the second algorithm, the exploration of paths is limited to N‐best non‐loop paths in terms of hops number (number of routers in a path), leading to a substantial reduction of convergence time. The performances of the proposed algorithms are evaluated experimentally with OPNET simulator for different levels of traffic's load and compared with standard shortest‐path and Q‐routing algorithms. Our approach proves superior to classical algorithms and is able to route efficiently even when the network load varies in an irregular manner. We also tested our approach on a large network topology to proof its scalability and adaptability. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
70.