全文获取类型
收费全文 | 344篇 |
免费 | 15篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 59篇 |
综合类 | 48篇 |
化学工业 | 2篇 |
金属工艺 | 2篇 |
机械仪表 | 3篇 |
建筑科学 | 7篇 |
矿业工程 | 2篇 |
能源动力 | 1篇 |
无线电 | 141篇 |
一般工业技术 | 10篇 |
冶金工业 | 8篇 |
自动化技术 | 82篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 3篇 |
2016年 | 2篇 |
2015年 | 3篇 |
2014年 | 13篇 |
2013年 | 26篇 |
2012年 | 18篇 |
2011年 | 17篇 |
2010年 | 20篇 |
2009年 | 21篇 |
2008年 | 15篇 |
2007年 | 12篇 |
2006年 | 14篇 |
2005年 | 16篇 |
2004年 | 14篇 |
2003年 | 28篇 |
2002年 | 27篇 |
2001年 | 23篇 |
2000年 | 13篇 |
1999年 | 20篇 |
1998年 | 10篇 |
1997年 | 8篇 |
1996年 | 10篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有365条查询结果,搜索用时 62 毫秒
101.
102.
103.
104.
105.
106.
In recent years reliability growth models have gained a dominant role in the evaluation of the reliability of software products. However, their application to the quality assurance process of the software of a highly complex system such as a telecommunications switching system often shows that it is then possible to get accurate results only when some months of operation have elapsed. It is then impossible to give an answer to the typical questions which arise during the quality assurance phase: ‘Is the software ready for release? How long will it take before it is ready?’. This paper describes a multi-variable (MV) model which was developed to overcome the above limitation by providing a better model of the quality assurance process. A case study is presented, and a comparison is made between the results obtained by applying existing reliability growth models and the MV-model to it. Besides attaining surprising accuracy in its predictions and in measuring the reliability of the product, the MV-model also tries to tackle a different kind of question: ‘How is it possible to improve the effectiveness of testing?’. 相似文献
107.
石福斌 《哈尔滨理工大学学报》2006,11(6):63-66
针对3GPP提出的3G安全结构中重点描述的网络接入安全技术规范,深入研究了UMTS安全结构.分析了UMTS网络接入安全特性和安全机制,并对未来发展趋势进行展望. 相似文献
108.
Routing optimisation in some types of networks requires the calculation of the minimal cost pair of disjoint paths such that the cost functions associated with the arcs in the two paths are different. An exact algorithm for solving this NP-complete problem is proposed, based on a condition which guarantees that the optimal path pair cost has been obtained. This optimality condition is based on the calculation of upper and lower bounds on the optimal cost. A formal proof of the correctness of the algorithm is described. Extensive experimentation is presented to show the effectiveness of the algorithm, including a comparison with an integer linear programming formulation. 相似文献
109.
Exact algorithms for the joint object placement and request routing problem in content distribution networks 总被引:1,自引:0,他引:1
Tolga Bekta Jean-Franois Cordeau Erhan Erkut Gilbert Laporte 《Computers & Operations Research》2008,35(12):3860
This paper describes two exact algorithms for the joint problem of object placement and request routing in a content distribution network (CDN). A CDN is a technology used to efficiently distribute electronic content throughout an existing Internet Protocol network. The problem consists of replicating content on the proxy servers and routing the requests for the content to a suitable proxy server in a CDN such that the total cost of distribution is minimized. An upper bound on end-to-end object transfer time is also taken into account. The problem is formulated as a nonlinear integer programming formulation which is linearized in three different ways. Two algorithms, one based on Benders decomposition and the other based on Lagrangean relaxation and decomposition, are described for the solution of the problem. Computational experiments are conducted by comparing the proposed linearizations and the two algorithms on randomly generated Internet topologies. 相似文献
110.
Marc St-Hilaire Author Vitae Samuel Pierre Author Vitae 《Computers & Electrical Engineering》2008,34(6):470-487
In this paper, we propose a tabu search (TS) algorithm for the global planning problem of third generation (3G) universal mobile telecommunications system (UMTS) networks. This problem is composed of three NP-hard subproblems: the cell, the access network and the core network planning subproblems. Therefore, the global planning problem consists in selecting the number, the location and the type of network nodes (including the base stations, the radio network controllers, the mobile switching centers and the serving GPRS (General Packet Radio Service) support nodes) as well as the interconnections between them. After describing our metaheuristic, a systematic set of experiments is designed to assess its performance. The results show that quasi-optimal solutions can be obtained with the proposed approach. 相似文献