全文获取类型
收费全文 | 4486篇 |
免费 | 333篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 31篇 |
综合类 | 2篇 |
化学工业 | 1314篇 |
金属工艺 | 44篇 |
机械仪表 | 79篇 |
建筑科学 | 167篇 |
矿业工程 | 8篇 |
能源动力 | 166篇 |
轻工业 | 1003篇 |
水利工程 | 45篇 |
石油天然气 | 11篇 |
无线电 | 217篇 |
一般工业技术 | 648篇 |
冶金工业 | 97篇 |
原子能技术 | 18篇 |
自动化技术 | 976篇 |
出版年
2024年 | 7篇 |
2023年 | 59篇 |
2022年 | 177篇 |
2021年 | 256篇 |
2020年 | 151篇 |
2019年 | 192篇 |
2018年 | 196篇 |
2017年 | 178篇 |
2016年 | 199篇 |
2015年 | 154篇 |
2014年 | 231篇 |
2013年 | 379篇 |
2012年 | 327篇 |
2011年 | 379篇 |
2010年 | 263篇 |
2009年 | 240篇 |
2008年 | 221篇 |
2007年 | 218篇 |
2006年 | 140篇 |
2005年 | 130篇 |
2004年 | 124篇 |
2003年 | 97篇 |
2002年 | 82篇 |
2001年 | 46篇 |
2000年 | 45篇 |
1999年 | 42篇 |
1998年 | 53篇 |
1997年 | 40篇 |
1996年 | 25篇 |
1995年 | 24篇 |
1994年 | 18篇 |
1993年 | 15篇 |
1992年 | 17篇 |
1991年 | 20篇 |
1990年 | 11篇 |
1989年 | 13篇 |
1988年 | 5篇 |
1987年 | 3篇 |
1985年 | 7篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有4826条查询结果,搜索用时 15 毫秒
81.
Francisco Henrique Ferreira Ana Paula C. da Silva Alex B. Vieira 《Peer-to-Peer Networking and Applications》2016,9(1):1-15
Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships. 相似文献
82.
83.
Ricardo Villar-Ribera Francisco Hernández-AbadJosé Ignacio Rojas-Sola David Hernández-Díaz 《Mechanism and Machine Theory》2011,46(6):820-830
The transmission of information has gone through various stages of evolution throughout its history. A stage before that of the electric telegraph was the so-called aerial/optical telegraph. It was developed towards the end of the 18th century and was in service until the middle of the 19th century. Chappe's system was widely used in France, and was the first to be in consistent use. However, a new and technologically superior system was developed soon afterwards which superseded it. Its inventor was Agustín de Betancourt, considered by some authors one of the founders of the Theory of Machines and Mechanisms, who, together with the distinguished clockmaker Breguet, presented it to the French Authorities in the turbulent decade of the 1790s.This article presents a historical review of this telegraph and analyzes its technical characteristics. It presents analytically, numerically and graphically some of the statements made about the telegraph, and corrects other subsequent observations. Lastly, a detailed reconstruction of the telegraph is made using different advanced CAD techniques, which provide an accurate static and dynamic view of each of its parts. 相似文献
84.
In this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent set-up times. The problem combines two NP-hard problems, so we propose a heuristic method for solving it, which hybridizes multi-start strategies with Tabu Search. We compare our method with the only published metaheuristic algorithm for this problem on a set of 420 instances. The comparison favors the method developed in this work, showing that is able to find high quality solutions in very short computational times. 相似文献
85.
Francisco P. Romero Pascual Julián-Iranzo Andrés Soto Mateus Ferreira-Satler Juan Gallardo-Casero 《Language Resources and Evaluation》2013,47(1):151-178
Web 2.0 provides user-friendly tools that allow persons to create and publish content online. User generated content often takes the form of short texts (e.g., blog posts, news feeds, snippets, etc). This has motivated an increasing interest on the analysis of short texts and, specifically, on their categorisation. Text categorisation is the task of classifying documents into a certain number of predefined categories. Traditional text classification techniques are mainly based on word frequency statistical analysis and have been proved inadequate for the classification of short texts where word occurrence is too small. On the other hand, the classic approach to text categorization is based on a learning process that requires a large number of labeled training texts to achieve an accurate performance. However labeled documents might not be available, when unlabeled documents can be easily collected. This paper presents an approach to text categorisation which does not need a pre-classified set of training documents. The proposed method only requires the category names as user input. Each one of these categories is defined by means of an ontology of terms modelled by a set of what we call proximity equations. Hence, our method is not category occurrence frequency based, but highly depends on the definition of that category and how the text fits that definition. Therefore, the proposed approach is an appropriate method for short text classification where the frequency of occurrence of a category is very small or even zero. Another feature of our method is that the classification process is based on the ability of an extension of the standard Prolog language, named Bousi~Prolog , for flexible matching and knowledge representation. This declarative approach provides a text classifier which is quick and easy to build, and a classification process which is easy for the user to understand. The results of experiments showed that the proposed method achieved a reasonably useful performance. 相似文献
86.
Influence diagnostics in beta regression 总被引:1,自引:0,他引:1
Patrícia L. Espinheira Francisco Cribari-Neto 《Computational statistics & data analysis》2008,52(9):4417-4431
We consider the issue of assessing influence of observations in the class of beta regression models, which is useful for modelling random variables that assume values in the standard unit interval and are affected by independent variables. We propose a Cook-like distance and also measures of local influence under different perturbation schemes. Applications using real data are presented. 相似文献
87.
User simulation in a stochastic dialog system 总被引:1,自引:1,他引:0
We present a new methodology of user simulation applied to the evaluation and refinement of stochastic dialog systems. Common weaknesses of these systems are the scarceness of the training corpus and the cost of an evaluation made by real users. We have considered the user simulation technique as an alternative way of testing and improving our dialog system. We have developed a new dialog manager that plays the role of the user. This user dialog manager incorporates several knowledge sources, combining statistical and heuristic information in order to define its dialog strategy. Once the user simulator is integrated into the dialog system, it is possible to enhance the dialog models by an automatic strategy learning. We have performed an extensive evaluation, achieving a slight but clear improvement of the dialog system. 相似文献
88.
Visual Navigation for Mobile Robots: A Survey 总被引:4,自引:0,他引:4
Francisco Bonin-Font Alberto Ortiz Gabriel Oliver 《Journal of Intelligent and Robotic Systems》2008,53(3):263-296
Mobile robot vision-based navigation has been the source of countless research contributions, from the domains of both vision
and control. Vision is becoming more and more common in applications such as localization, automatic map construction, autonomous
navigation, path following, inspection, monitoring or risky situation detection. This survey presents those pieces of work,
from the nineties until nowadays, which constitute a wide progress in visual navigation techniques for land, aerial and autonomous
underwater vehicles. The paper deals with two major approaches: map-based navigation and mapless navigation. Map-based navigation has been in turn subdivided in metric map-based navigation and topological map-based navigation. Our outline to mapless navigation includes reactive techniques based on qualitative characteristics extraction, appearance-based
localization, optical flow, features tracking, plane ground detection/tracking, etc... The recent concept of visual sonar has also been revised.
This work is partially supported by DPI 2005-09001-C03-02 and FEDER funding. 相似文献
89.
Adaptation and application of multi-objective evolutionary algorithms for rule reduction and parameter tuning of fuzzy rule-based systems 总被引:7,自引:7,他引:0
María José Gacto Rafael Alcalá Francisco Herrera 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(5):419-436
Recently, multi-objective evolutionary algorithms have been applied to improve the difficult tradeoff between interpretability
and accuracy of fuzzy rule-based systems. It is known that both requirements are usually contradictory, however, these kinds
of algorithms can obtain a set of solutions with different trade-offs. This contribution analyzes different application alternatives
in order to attain the desired accuracy/interpr-etability balance by maintaining the improved accuracy that a tuning of membership
functions could give but trying to obtain more compact models. In this way, we propose the use of multi-objective evolutionary
algorithms as a tool to get almost one improved solution with respect to a classic single objective approach (a solution that
could dominate the one obtained by such algorithm in terms of the system error and number of rules). To do that, this work
presents and analyzes the application of six different multi-objective evolutionary algorithms to obtain simpler and still
accurate linguistic fuzzy models by performing rule selection and a tuning of the membership functions. The results on two
different scenarios show that the use of expert knowledge in the algorithm design process significantly improves the search
ability of these algorithms and that they are able to improve both objectives together, obtaining more accurate and at the
same time simpler models with respect to the single objective based approach.
相似文献
María José Gacto (Corresponding author)Email: |
Rafael AlcaláEmail: |
Francisco HerreraEmail: |
90.
Gustavo Olague Cynthia B. Pérez Francisco Fernández Evelyne Lutton 《Artificial Life and Robotics》2009,13(2):585-596
This article presents an adaptive approach to improving the infection algorithm that we have used to solve the dense stereo
matching problem. The algorithm presented here incorporates two different epidemic automata along a single execution of the
infection algorithm. The new algorithm attempts to provide a general behavior of guessing the best correspondence between
a pair of images. Our aim is to provide a new strategy inspired by evolutionary computation, which combines the behaviors
of both automata into a single correspondence problem. The new algorithm will decide which automata will be used based on
the transmission of information and mutation, as well as the attributes, texture, and geometry, of the input images. This
article gives details about how the rules used in the infection algorithm are coded. Finally, we show experiments with a real
stereo pair, as well as with a standard test bed, to show how the infection algorithm works. 相似文献