全文获取类型
收费全文 | 38358篇 |
免费 | 2135篇 |
国内免费 | 28篇 |
专业分类
电工技术 | 242篇 |
综合类 | 17篇 |
化学工业 | 7156篇 |
金属工艺 | 670篇 |
机械仪表 | 731篇 |
建筑科学 | 969篇 |
矿业工程 | 73篇 |
能源动力 | 734篇 |
轻工业 | 5836篇 |
水利工程 | 318篇 |
石油天然气 | 127篇 |
武器工业 | 5篇 |
无线电 | 1286篇 |
一般工业技术 | 5828篇 |
冶金工业 | 11700篇 |
原子能技术 | 139篇 |
自动化技术 | 4690篇 |
出版年
2024年 | 59篇 |
2023年 | 291篇 |
2022年 | 371篇 |
2021年 | 839篇 |
2020年 | 700篇 |
2019年 | 818篇 |
2018年 | 1348篇 |
2017年 | 1316篇 |
2016年 | 1375篇 |
2015年 | 1054篇 |
2014年 | 1276篇 |
2013年 | 2674篇 |
2012年 | 2015篇 |
2011年 | 1922篇 |
2010年 | 1550篇 |
2009年 | 1410篇 |
2008年 | 1363篇 |
2007年 | 1246篇 |
2006年 | 876篇 |
2005年 | 768篇 |
2004年 | 709篇 |
2003年 | 638篇 |
2002年 | 612篇 |
2001年 | 468篇 |
2000年 | 428篇 |
1999年 | 614篇 |
1998年 | 3630篇 |
1997年 | 2383篇 |
1996年 | 1538篇 |
1995年 | 875篇 |
1994年 | 699篇 |
1993年 | 786篇 |
1992年 | 229篇 |
1991年 | 237篇 |
1990年 | 194篇 |
1989年 | 205篇 |
1988年 | 194篇 |
1987年 | 168篇 |
1986年 | 144篇 |
1985年 | 169篇 |
1984年 | 127篇 |
1983年 | 99篇 |
1982年 | 145篇 |
1981年 | 168篇 |
1980年 | 184篇 |
1979年 | 79篇 |
1978年 | 83篇 |
1977年 | 335篇 |
1976年 | 749篇 |
1973年 | 64篇 |
排序方式: 共有10000条查询结果,搜索用时 786 毫秒
961.
Rafael Rieder Alberto Barbosa Raposo Márcio Sarroglia Pinho 《Journal of Visual Languages and Computing》2010,21(3):136-156
This work presents a methodology to formally model and to build three-dimensional interaction tasks in virtual environments using three different tools: Petri Nets, the Interaction Technique Decomposition taxonomy, and Object-Oriented techniques. User operations in the virtual environment are represented as Petri Net nodes; these nodes, when linked, represent the interaction process stages. In our methodology, places represent all the states an application can reach, transitions define the conditions to start an action, and tokens embody the data manipulated by the application. As a result of this modeling process we automatically generate the core of the application's source code. We also use a Petri Net execution library to run the application code. In order to facilitate the application modeling, we have adapted Dia, a well-known graphical diagram editor, to support Petri Nets creation and code generation. The integration of these approaches results in a modular application, based on Petri Nets formalism that allows for the specification of an interaction task and for the reuse of developed blocks in new virtual environment projects. 相似文献
962.
Tristan Behrens Mehdi Dastani Jürgen Dix Michael Köster Peter Novák 《Annals of Mathematics and Artificial Intelligence》2010,59(3-4):277-311
The Multi-Agent Programming Contest is an annual international event on programming multi-agent systems: Teams of agents participate in a simulated cooperative scenario. It started in 2005 and is organised in 2010 for the sixth time. The contest is an attempt to stimulate research in the area of multi-agent system development and programming by (i) identifying key problems in the field and (ii) collecting suitable benchmarks that can serve as milestones for testing multi-agent programming languages, platforms and tools. This article provides a short history of the contest since it started and reports in more detail on the cows and cowboys scenario implemented for the 2008, 2009 and 2010 contest editions. We briefly discuss the underlying technological background and conclude with a critical discussion of the experiences and lessons learned. 相似文献
963.
Tuttle C Nonato LG Silva CT 《IEEE transactions on visualization and computer graphics》2010,16(6):1063-1072
Public genealogical databases are becoming increasingly populated with historical data and records of the current population's ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree's structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user's ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout. 相似文献
964.
965.
Electronic transactions are becoming more important everyday. Several tasks like buying goods, booking flights or hotel rooms, or paying for streaming a movie, for instance, can be carried out through the Internet. Nevertheless, they are still some drawbacks due to security threats while performing such operations. Trust and reputation management rises as a novel way of solving some of those problems. In this paper we present our work TRIMS (a privacy-aware trust and reputation model for identity management systems), which applies a trust and reputation model to guarantee an acceptable level of security when deciding if a different domain might be considered reliable when receiving certain sensitive user’s attributes. Specifically, we will address the problems which surfaces when a domain needs to decide whether to exchange some information with another possibly unknown domain to effectively provide a service to one of its users. This decision will be determined by the trust deposited in the targeting domain. As far as we know, our proposal is one of the first approaches dealing with trust and reputation management in a multi-domain scenario. Finally, the performed experiments have demonstrated the robustness and accuracy of our model in a wide variety of scenarios. 相似文献
966.
967.
Carlos Valle Francisco Saravia Héctor Allende Raúl Monge César Fernández 《Neural Processing Letters》2010,32(3):277-291
Ensemble learning has gained considerable attention in different tasks including regression, classification and clustering. Adaboost and Bagging are two popular approaches used to train these models. The former provides accurate estimations in regression settings but is computationally expensive because of its inherently sequential structure, while the latter is less accurate but highly efficient. One of the drawbacks of the ensemble algorithms is the high computational cost of the training stage. To address this issue, we propose a parallel implementation of the Resampling Local Negative Correlation (RLNC) algorithm for training a neural network ensemble in order to acquire a competitive accuracy like that of Adaboost and an efficiency comparable to that of Bagging. We test our approach on both synthetic and real datasets from the UCI and Statlib repositories for the regression task. In particular, our fine-grained parallel approach allows us to achieve a satisfactory balance between accuracy and parallel efficiency. 相似文献
968.
Simulation of complex mechatronic systems like an automobile, involving mechanical components as well as actuators and active
electronic control devices, can be accomplished by combining tools that deal with the simulation of the different subsystems.
In this sense, it is often desirable to couple a multibody simulation software (for the mechanical simulation) with external
numerical computing environments and block diagram simulators (for the modeling and simulation of nonmechanical components). 相似文献
969.
Luci Pirmez Jaime C. Carvalho Flávia C. Delicato Fábio Protti Luiz F.R.C. Carmo Paulo F. Pires Marcos Pirmez 《Computer Networks》2010,54(13):2117-2136
This work presents SUTIL, a mechanism for network selection in the context of next generation networks (NGN). SUTIL selection mechanism prioritizes networks with higher relevance to the application and lower energy consumption and it enables full and seamless connectivity to mobile user devices and applications. Consequently, SUTIL contributes to realize the vision of ubiquitous computing, in which services, devices, and sensor-enriched environments interact anytime, anywhere to accomplish human designed tasks. The provided solution is based on utility function and integer linear programming and it aims at: (i) maximizing the user satisfaction while meeting application QoS and (ii) minimizing the energy consumption of devices when connecting to a target network. The solution is global since it considers for a given base station all devices that are simultaneously candidate for handoff. Simulation results showed the benefits of SUTIL usage in NGN environments. 相似文献
970.
Katarína Čunderlíková 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2010,14(3):229-234
The ergodic theory and particularly the individual ergodic theorem were studied in many structures. Recently the individual
ergodic theorem has been proved for MV-algebras of fuzzy sets (Riečan in Czech Math J 50(125):673–680, 2000; Riečan and Neubrunn in Integral, measure, and ordering. Kluwer, Dordrecht, 1997) and even in general MV-algebras (Jurečková in Int J Theor Phys 39:757–764, 2000). The notion of almost everywhere equality of observables was introduced by Riečan and Jurečková (Int J Theor Phys 44:1587–1597,
2005). They proved that the limit of Cesaro means is an invariant observable for P-observables. In Lendelová (Int J Theor Phys 45(5):915–923, 2006c) showed that the assumption of P-observable can be omitted. In this paper we prove the individual ergodic theorem on family of IF-events and show that each
P {\mathcal{P}} -preserving transformation in this family can be expressed by two corresponding
P\flat,P\sharp {\mathcal{P}}^\flat,{\mathcal{P}}^\sharp -preserving transformations in tribe T. {\mathcal{T}}. 相似文献