全文获取类型
收费全文 | 2954篇 |
免费 | 198篇 |
国内免费 | 15篇 |
专业分类
电工技术 | 51篇 |
综合类 | 23篇 |
化学工业 | 784篇 |
金属工艺 | 83篇 |
机械仪表 | 46篇 |
建筑科学 | 135篇 |
矿业工程 | 7篇 |
能源动力 | 140篇 |
轻工业 | 119篇 |
水利工程 | 14篇 |
石油天然气 | 8篇 |
无线电 | 279篇 |
一般工业技术 | 664篇 |
冶金工业 | 175篇 |
原子能技术 | 7篇 |
自动化技术 | 632篇 |
出版年
2024年 | 6篇 |
2023年 | 65篇 |
2022年 | 132篇 |
2021年 | 168篇 |
2020年 | 115篇 |
2019年 | 117篇 |
2018年 | 116篇 |
2017年 | 124篇 |
2016年 | 138篇 |
2015年 | 105篇 |
2014年 | 166篇 |
2013年 | 207篇 |
2012年 | 224篇 |
2011年 | 251篇 |
2010年 | 146篇 |
2009年 | 155篇 |
2008年 | 137篇 |
2007年 | 107篇 |
2006年 | 97篇 |
2005年 | 51篇 |
2004年 | 54篇 |
2003年 | 50篇 |
2002年 | 40篇 |
2001年 | 44篇 |
2000年 | 34篇 |
1999年 | 34篇 |
1998年 | 52篇 |
1997年 | 23篇 |
1996年 | 15篇 |
1995年 | 19篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 16篇 |
1991年 | 12篇 |
1990年 | 18篇 |
1989年 | 8篇 |
1988年 | 6篇 |
1987年 | 7篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1981年 | 9篇 |
1979年 | 4篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 5篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1965年 | 3篇 |
排序方式: 共有3167条查询结果,搜索用时 0 毫秒
31.
Christian Liebchen Michael Schachtebeck Anita Schöbel Sebastian Stiller André Prigge 《Computers & Operations Research》2010,37(5):857-868
In the past, much research has been dedicated to compute optimum railway timetables. A typical objective has been the minimization of passenger waiting times. But only the planned nominal waiting times have been addressed, whereas delays as they occur in daily operations have been neglected. Delays have been rather treated mainly in an online context and solved as a separate optimization problem, called delay management.We provide the first computational study which aims at computing delay resistant periodic timetables. In particular we assess the delay resistance of a timetable by evaluating it subject to several delay scenarios to which optimum delay management will be applied.We arrive at computing delay resistant timetables by selecting a new objective function which we design to be somehow in the middle of the traditional simple timetabling objective and the sophisticated delay management objective. This is a slight extension of the concept of “light robustness” (LR) as it has been proposed by Fischetti and Monaci [2006. Robust optimization through branch-and-price. In: Proceedings of AIRO]. Moreover, in our application we are able to provide accurate interpretations for the ingredients of LR. We apply this new technique to real-world data of a part of the German railway network of Deutsche Bahn AG. Our computational results suggest that a significant decrease of passenger delays can be obtained at a relatively small price of robustness, i.e. by increasing the nominal travel times of the passengers. 相似文献
32.
Making it easier for older people to talk to smart homes: the effect of early help prompts 总被引:1,自引:0,他引:1
K. Maria Wolters Klaus-Peter Engelbrecht Florian Gödde Sebastian Möller Anja Naumann Robert Schleicher 《Universal Access in the Information Society》2010,9(4):311-325
It is well known that help prompts shape how users talk to spoken dialogue systems. This study investigated the effect of
help prompt placement on older users’ interaction with a smart home interface. In the dynamic help condition, help was only
given in response to system errors; in the inherent help condition, it was also given at the start of each task. Fifteen older
and sixteen younger users interacted with a smart home system using two different scenarios. Each scenario consisted of several
tasks. The linguistic style users employed to communicate with the system (interaction style) was measured using the ratio of commands to the overall utterance length (keyword ratio) and the percentage of content
words in the user’s utterance that could be understood by the system (shared vocabulary). While the timing of help prompts
did not affect the interaction style of younger users, it was early task-specific help supported older users in adapting their
interaction style to the system’s capabilities. Well-placed help prompts can significantly increase the usability of spoken
dialogue systems for older people. 相似文献
33.
IntroductionAn important quality of association rules is novelty. However, evaluating rule novelty is AI-hard and has been a serious challenge for most data mining systems.ObjectiveIn this paper, we introduce functional novelty, a new non-pairwise approach to evaluating rule novelty. A functionally novel rule is interesting as it suggests previously unknown relations between user hypotheses.MethodsWe developed a novel domain-driven KDD framework for discovering functionally novel association rules. Association rules were mined from cardiovascular data sets. At post-processing, domain knowledge-compliant rules were discovered by applying semantic-based filtering based on UMLS ontology. Their knowledge compliance scores were computed against medical knowledge in Pubmed literature. A cardiologist explored possible relationships between several pairs of unknown hypotheses. The functional novelty of each rule was computed based on its likelihood to mediate these relationships.ResultsHighly interesting rules were successfully discovered. For instance, common rules such as diabetes mellitus?coronary arteriosclerosis was functionally novel as it mediated a rare association between von Willebrand factor and intracardiac thrombus.ConclusionThe proposed post-mining domain-driven rule evaluation technique and measures proved to be useful for estimating candidate functionally novel rules with the results validated by a cardiologist. 相似文献
34.
Carlos A. Jara Francisco A. Candelas Fernando Torres Sebastian Dormido Francisco Esquembre Oscar Reinoso 《Computers & Education》2009
Web-based learning environments are becoming increasingly popular in higher education. One of the most important web-learning resources is the virtual laboratory (VL), which gives students an easy way for training and learning through the Internet. Moreover, on-line collaborative communication represents a practical method to transmit the knowledge and experience from the teacher to students overcoming physical distance and isolation. Considering these facts, the authors of this document have developed a new dynamic collaborative e-learning system which combines the main advantages of virtual laboratories and collaborative learning practices. In this system, the virtual laboratories are based on Java applets which have embedded simulations developed in Easy Java Simulations (EJS), an open-source tool for teachers who do not need complex programming skills. The collaborative e-learning is based on a real-time synchronized communication among these Java applets. Therefore, this original approach provides a new tool which integrates virtual laboratories inside a synchronous collaborative e-learning framework. This paper describes the main features of this system and its successful application in a distance education environment among different universities from Spain. 相似文献
35.
Sebastian Dörn 《Information Processing Letters》2009,109(6):325-328
In this paper we give tight quantum query complexity bounds of some important linear algebra problems. We prove Θ(n2) quantum query bounds for verify the determinant, rank, matrix inverse and the matrix power problem. 相似文献
36.
37.
Thomas Neumann Matthias Bender Sebastian Michel Ralf Schenkel Peter Triantafillou Gerhard Weikum 《Distributed and Parallel Databases》2009,26(1):3-27
Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a
central issue, especially for distributed settings, when the data is spread across different nodes in a network. This paper
introduces novel optimization methods for top-k aggregation queries in such distributed environments. The optimizations can be applied to all algorithms that fall into the
frameworks of the prior TPUT and KLEE methods. The optimizations address three degrees of freedom: 1) hierarchically grouping
input lists into top-k operator trees and optimizing the tree structure, 2) computing data-adaptive scan depths for different input sources, and
3) data-adaptive sampling of a small subset of input sources in scenarios with hundreds or thousands of query-relevant network
nodes. All optimizations are based on a statistical cost model that utilizes local synopses, e.g., in the form of histograms,
efficiently computed convolutions, and estimators based on order statistics. The paper presents comprehensive experiments,
with three different real-life datasets and using the ns-2 network simulator for a packet-level simulation of a large Internet-style
network. 相似文献
38.
Ahmed Fadl Zongqin Zhang Sebastian Geller Jonas Tölke Manfred Krafczyk Donna Meyer 《Microsystem Technologies》2009,15(9):1379-1387
The efficiency of the valve-less rectification micropump depends primarily on the microfluidic diodicity (the ratio of the
backward pressure drop to the forward pressure drop). In this study, different rectifying structures, including the conventional
structures (nozzle/diffuser and Tesla structures), were investigated at very low Reynolds numbers (between 0.2 and 60). The
rectifying structures were characterized with respect to their design, and a numerical approach was illustrated to calculate
the diodicity for the rectifying structures. In this study, the microfluidic diodicity was evaluated numerically for different
rectifying structures including half circle, semicircle, heart, triangle, bifurcation, nozzle/diffuser, and Tesla structures.
The Lattice Boltzmann Method (LBM) was utilized as a numerical method to simulate the fluid flow in the microscale. The results
suggest that at very low Reynolds number flow, rectification and multifunction micropumping may be achievable by using a number
of the presented structures. The results for the conventional structures agree with the reported results. 相似文献
39.
In this study, we analyze the criticality of nodes in air transportation using techniques from three different domains, and thus, three essentially different perspectives of criticality. First, we examine the unweighted structure of air transportation networks, using recent methods from control theory (maximum matching and minimum dominating set). Second, complex network metrics (betweenness and closeness) are used with passenger traffic as weights. Third, ticket data-level analysis (origin-destination betweenness and outbound traffic with transit threshold) is performed. Remarkably, all techniques identify a different set of critical nodes; while, in general, giving preference to the selection of high-degree nodes. Our evaluation on the international air transportation country network suggests that some countries, e.g., United States, France, and Germany, are critical from all three perspectives. Other countries, e.g., United Arab Emirates and Panama, have a very specific influence, by controlling the passenger traffic of their neighborhood countries. Furthermore, we assess the criticality of the country network using Multi-Criteria Decision Analysis (MCDA) techniques. United States, Great Britain, Germany, and United Arab Emirates are identified as non-dominated countries; Sensitivity analysis shows that United Arab Emirates is most sensitive to the preference information on the outbound traffic. Our work gears towards a better understanding of node criticality in air transportation networks. This study also stipulates future research possibilities on criticality in general transportation networks. 相似文献
40.
Emanuel Gull Philipp Werner Sebastian Fuchs Brigitte Surer Thomas Pruschke Matthias Troyer 《Computer Physics Communications》2011,182(4):1078-1082
Continuous-time quantum Monte Carlo impurity solvers are algorithms that sample the partition function of an impurity model using diagrammatic Monte Carlo techniques. The present paper describes codes that implement the interaction expansion algorithm originally developed by Rubtsov, Savkin, and Lichtenstein, as well as the hybridization expansion method developed by Werner, Millis, Troyer, et al. These impurity solvers are part of the ALPS-DMFT application package and are accompanied by an implementation of dynamical mean-field self-consistency equations for (single orbital single site) dynamical mean-field problems with arbitrary densities of states.
Program summary
Program title: dmftCatalogue identifier: AEIL_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIL_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: ALPS LIBRARY LICENSE version 1.1No. of lines in distributed program, including test data, etc.: 899 806No. of bytes in distributed program, including test data, etc.: 32 153 916Distribution format: tar.gzProgramming language: C++Operating system: The ALPS libraries have been tested on the following platforms and compilers:•
Linux with GNU Compiler Collection (g++ version 3.1 and higher), and Intel C++ Compiler (icc version 7.0 and higher) •
MacOS X with GNU Compiler (g++ Apple-version 3.1, 3.3 and 4.0) •
IBM AIX with Visual Age C++ (xlC version 6.0) and GNU (g++ version 3.1 and higher) compilers •
Compaq Tru64 UNIX with Compq C++ Compiler (cxx) •
SGI IRIX with MIPSpro C++ Compiler (CC) •
HP-UX with HP C++ Compiler (aCC) •
Windows with Cygwin or coLinux platforms and GNU Compiler Collection (g++ version 3.1 and higher)
[1]
A. Albuquerque, F. Alet, P. Corboz, et al., J. Magn. Magn. Mater. 310 (2007) 1187. [2]
http://arxiv.org/abs/1012.4474, Rev. Mod. Phys., in press.