全文获取类型
收费全文 | 447篇 |
免费 | 19篇 |
国内免费 | 17篇 |
专业分类
电工技术 | 8篇 |
综合类 | 18篇 |
化学工业 | 8篇 |
金属工艺 | 9篇 |
机械仪表 | 22篇 |
建筑科学 | 25篇 |
矿业工程 | 16篇 |
能源动力 | 3篇 |
轻工业 | 5篇 |
石油天然气 | 3篇 |
武器工业 | 1篇 |
无线电 | 58篇 |
一般工业技术 | 22篇 |
冶金工业 | 1篇 |
原子能技术 | 4篇 |
自动化技术 | 280篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 5篇 |
2016年 | 7篇 |
2015年 | 18篇 |
2014年 | 31篇 |
2013年 | 24篇 |
2012年 | 26篇 |
2011年 | 30篇 |
2010年 | 25篇 |
2009年 | 25篇 |
2008年 | 39篇 |
2007年 | 30篇 |
2006年 | 30篇 |
2005年 | 22篇 |
2004年 | 16篇 |
2003年 | 25篇 |
2002年 | 16篇 |
2001年 | 7篇 |
2000年 | 8篇 |
1999年 | 9篇 |
1998年 | 11篇 |
1997年 | 5篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有483条查询结果,搜索用时 0 毫秒
1.
Summary A derivation of a parallel algorithm for rank order filtering is presented. Both derivation and result differ from earlier designs: the derivations are less complicated and the result allows a number of different implementations. The same derivation is used to design a collection of priority queues. Both filters and priority queues are highly efficient: they have constant response time and small latency.
Anne Kaldewaij received an M.Sc. degree in Mathematics from the University of Utrecht (The Netherlands) and a Ph.D. degree in Computing Science from the Eindhoven University of Technology. Currently, he is associate professor in Computing Science at Eindhoven University. His research includes parallel programming and the design of algorithms and data structures. He enjoys teaching and he has written a number of textbooks on mathematics and programming.
Jan Tijmen Udding received an M.Sc. degree in Mathematics in 1980 and a Ph.D. degree in Computing Science in 1984 from Eindhoven University of Technology. Currently, he is associate professor at Groningen University. His main research interests are mathematical aspects of VLSI, program derivation and correctness, and functional programming. 相似文献
2.
The main aim of this paper is to investigate the group decision making on incomplete multiplicative and fuzzy preference relations without the requirement of satisfying reciprocity property. This paper introduces a new characterization of the multiplicative consistency condition, based on which a method to estimate unknown preference values in an incomplete multiplicative preference relation is proposed. Apart from the multiplicative consistency property among three known preference values, the method proposed also takes the multiplicative consistency property among more than three values into account. In addition, two models for group decision making with incomplete multiplicative preference relations and incomplete fuzzy preference relations are presented, respectively. Some properties of the collective preference relation are further discussed. Numerical examples are provided to make a discussion and comparison with other similar methods. 相似文献
3.
以四相位单交叉口为研究对象,计算推导交叉口的延误计算模型,包括公交优先相位减少的延误以及非公交优先相位增加的延误。模型以减少人总延误最大为控制目标,采用粒子群算法优化求解,从而得到最优的绿信比,并通过仿真算例验证算法的有效性。 相似文献
4.
Condition evaluation of existing reinforced concrete bridges using fuzzy based analytic hierarchy approach 总被引:2,自引:1,他引:1
There is an urgent need for a systematic methodology for condition assessment of the bridges because the old bridges of most of the countries are inadequate to carry current-day traffic and satisfy the present codal provisions and even in newer bridges, deterioration caused by unforeseen service condition and deferred maintenance is of great concern. In view of this, an attempt has been made in this study to develop a systematic procedure and formulations for condition evaluation of existing bridges using Analytic Hierarchy Process in a fuzzy environment. Analytic Hierarchy Process (AHP) is an efficient decision making tool for complicated problems with multiple evaluation criteria and uncertainty. Fuzzy logic approach has been used to take care of the uncertainties and imprecision in the bridge inspector’s observations. In this paper, first, a methodology has been proposed for condition ranking of number of reinforced concrete (RC) bridges. Then, based on the results obtained from prioritization, rating of the most deserved bridge has been carried out using MADM based fuzzy logic. Computer programs have been developed based on the formulations presented in this paper for evaluating condition of existing bridges and the details are presented in the paper. The methodology and its application are demonstrated through a case study. This methodology would certainly help the engineers and policy makers concerned with bridge management to overcome the problem related to prioritization and decision on funding related to rehabilitation of bridges. 相似文献
5.
Summary Distributed Mutual Exclusion algorithms have been mainly compared using the number of messages exchanged per critical section execution. In such algorithms, no attention has been paid to the serialization order of the requests. Indeed, they adopt FCFS discipline. Conversely, the insertion of priority serialization disciplines, such as Short-Job-First, Head-Of-Line, Shortest-Remaining-Job-First etc., can be useful in many applications to optimize some performance indices. However, such priority disciplines are prone to starvation. The goal of this paper is to investigate and evaluate the impact of the insertion of a priority discipline in Maekawa-type algorithms. Priority serialization disciplines will be inserted by means of agated batch mechanism which avoids starvation. In a distributed algorithm, such a mechanism needs synchronizations among the processes. In order to highlight the usefulness of the priority based serialization discipline, we show how it can be used to improve theaverage response time compared to the FCFS discipline. The gated batch approach exhibits other advantages: algorithms are inherently deadlock-free and messages do not need to piggyback timestamps. We also show that, under heavy demand, algorithms using gated batch exchange less messages than Maekawa-type algorithms per critical section excution.
Roberto Baldoni was born in Rome on February 1, 1965. He received the Laurea degree in electronic engineering in 1990 from the University of Rome La Sapienza and the Ph.D. degree in Computer Science from the University of Rome La Sapienza in 1994. Currently, he is a researcher in computer science at IRISA, Rennes (France). His research interests include operating systems, distributed algorithms, network protocols and real-time multimedia applications.
Bruno Ciciani received the Laurea degree in electronic engineering in 1980 from the University of Rome La Sapienza. From 1983 to 1991 he has been a researcher at the University of Rome Tor Vergata. He is currently full professor in Computer Science at the University of Rome La Sapienza. His research activities include distributed computer systems, fault-tolerant computing, languages for parallel processing, and computer system performance and reliability evaluation. He has published in IEEE Trans. on Computers, IEEE Trans. on Knowledge and Data Engineering, IEEE Trans. on Software Engineering and IEEE Trans. on Reliability. He is the author of a book titled Manufactoring Yield Evaluation of VLSI/WSI Systems to be published by IEEE Computer Society Press.This research was supported in part by the Consiglio Nazionale delle Ricerche under grant 93.02294.CT12This author is also supported by a grant of the Human Capital and Mobility project of the European Community under contract No. 3702 CABERNET 相似文献
6.
7.
In this paper, a new algorithm for solving constrained nonlinear programming problems is presented. The basis of our proposed algorithm is none other than the necessary and sufficient conditions that one deals within a discrete constrained local optimum in the context of the discrete Lagrange multipliers theory. We adopt a revised particle swarm optimization algorithm and extend it toward solving nonlinear programming problems with continuous decision variables. To measure the merits of our algorithm, we provide numerical experiments for several renowned benchmark problems and compare the outcome against the best results reported in the literature. The empirical assessments demonstrate that our algorithm is efficient and robust. 相似文献
8.
While equilibrium analysis has been commonly used for network pricing under the assumption that user utility functions are precisely known, many researchers have criticized the validity of the assumption. In this paper, we propose a solution for bridging the gap between the existing theoretical work on optimal pricing and the unavailability of precise user utility information in real networks. In the proposed method, the service provider obtains increasingly more accurate estimates of user utility functions by iteratively changing the prices of service levels and observing the users’ service-level choices under various prices. Our study’s contribution is twofold. First, we have developed a general principle for estimating user utility functions. Especially, we present the utility estimation for dynamic user population. Second, we have developed a method for setting prices that can optimize the extraction of information about user utility functions. The extensive simulation results demonstrate the effectiveness of our method. 相似文献
9.
Priority-based target coverage in directional sensor networks using a genetic algorithm 总被引:1,自引:0,他引:1
Sensor networks have been applied in a wide variety of situations. Recently directional sensor networks consisting of directional sensors have gained attention. As for the traditional target coverage problem, the limited sensing angle of directional sensors makes it even more challenging. Moreover, individual targets may also be associated with differentiated priorities. Considering the distance between the directional sensors and targets influences sensing quality, this paper proposes the priority-based target coverage problem and strives to choose a minimum subset of directional sensors that can monitor all targets, satisfying their prescribed priorities. Due to the NP-Complete complexity, the minimum subset of directional sensors is approximated by using a genetic algorithm. Simulation results reveal the effects of multiple factors on the size of the resulting subset. 相似文献
10.