全文获取类型
收费全文 | 3977篇 |
免费 | 209篇 |
国内免费 | 14篇 |
专业分类
电工技术 | 42篇 |
综合类 | 1篇 |
化学工业 | 807篇 |
金属工艺 | 75篇 |
机械仪表 | 94篇 |
建筑科学 | 169篇 |
矿业工程 | 2篇 |
能源动力 | 118篇 |
轻工业 | 265篇 |
水利工程 | 36篇 |
石油天然气 | 13篇 |
无线电 | 424篇 |
一般工业技术 | 826篇 |
冶金工业 | 526篇 |
原子能技术 | 38篇 |
自动化技术 | 764篇 |
出版年
2023年 | 27篇 |
2022年 | 72篇 |
2021年 | 97篇 |
2020年 | 82篇 |
2019年 | 70篇 |
2018年 | 122篇 |
2017年 | 105篇 |
2016年 | 121篇 |
2015年 | 106篇 |
2014年 | 143篇 |
2013年 | 242篇 |
2012年 | 224篇 |
2011年 | 290篇 |
2010年 | 201篇 |
2009年 | 240篇 |
2008年 | 223篇 |
2007年 | 202篇 |
2006年 | 141篇 |
2005年 | 110篇 |
2004年 | 103篇 |
2003年 | 103篇 |
2002年 | 88篇 |
2001年 | 52篇 |
2000年 | 67篇 |
1999年 | 70篇 |
1998年 | 158篇 |
1997年 | 109篇 |
1996年 | 75篇 |
1995年 | 46篇 |
1994年 | 36篇 |
1993年 | 36篇 |
1992年 | 37篇 |
1991年 | 24篇 |
1990年 | 19篇 |
1989年 | 20篇 |
1988年 | 24篇 |
1987年 | 18篇 |
1986年 | 27篇 |
1985年 | 23篇 |
1984年 | 21篇 |
1983年 | 15篇 |
1982年 | 15篇 |
1981年 | 14篇 |
1980年 | 17篇 |
1979年 | 22篇 |
1978年 | 12篇 |
1977年 | 14篇 |
1976年 | 27篇 |
1974年 | 17篇 |
1973年 | 10篇 |
排序方式: 共有4200条查询结果,搜索用时 296 毫秒
71.
A large number of methods have been proposed for ranking fuzzy numbers in the last few decades. Nevertheless, none of these methods can always guarantee a consistent result for every situation. Some of them are even non-intuitive and not discriminating. Chen proposed a ranking method in 1985 to overcome these limitations and simplify the computational procedure based on the criteria of total utility through maximizing set and minimizing set. However, there were some shortcomings associated with Chen’s ranking method. Therefore, we propose a revised ranking method that can overcome these shortcomings. Instead of considering just a single left and a single right utility in the total utility, the proposed method considers two left and two right utilities. In addition, the proposed method also takes into account the decision maker’s optimistic attitude of fuzzy numbers. Several comparative examples and an application demonstrating the usage, advantages, and applicability of the revised ranking method are presented. It can be concluded that the revised ranking method can effectively resolve the issues with Chen’s ranking method. Moreover, the revised ranking method can be used to differentiate different types of fuzzy numbers. 相似文献
72.
Comparing e-Learning tools’ success: The case of instructor–student interactive vs. self-paced tools
e-Learning tools have profoundly transformed modern pedagogical approaches. Vendors provide different types of systems, such as self-paced (SP) and instructor–student interactive (ISI) e-Learning tools. Although both types of tools represent promising solutions to facilitate the learning process, it is important to theoretically identify a framework to evaluate the success of these tools and assess whether one type of tool is more effective than another. Toward this end, we (1) propose a model to evaluate e-Learning tools’ success by extending and contextualizing Seddon’s information systems (IS) success model for the e-Learning environment and (2) formulate four hypotheses to predict the differences in the success factors between SP and ISI tools. We test the model and hypotheses using data from 783 students across seven higher education institutions in Hong Kong. The results support the proposed e-Learning tool success model and three of the four hypotheses. ISI tools outperform SP tools in terms of system quality, perceived usefulness, satisfaction, and learning outcome. 相似文献
73.
We study a probabilistic version of coherence spaces and show that these objects provide a model of linear logic. We build a model of the pure lambda-calculus in this setting and show how to interpret a probabilistic version of the functional language PCF. We give a probabilistic interpretation of the semantics of probabilistic PCF closed terms of ground type. Last we suggest a generalization of this approach, using Banach spaces. 相似文献
74.
Gregory Chockler Seth Gilbert Vincent Gramoli Peter M. Musial Alex A. Shvartsman 《Journal of Parallel and Distributed Computing》2009
This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in an asynchronous dynamic network. The algorithm guarantees atomic consistency (linearizability) in all executions in the presence of arbitrary crash failures of the processing nodes, message delays, and message loss. The algorithm incorporates a classic quorum-based algorithm for read/write operations, and an optimized consensus protocol, based on Fast Paxos for reconfiguration, and achieves the design goals of: (i) allowing read and write operations to complete rapidly and (ii) providing long-term fault-tolerance through reconfiguration, a process that evolves the quorum configurations used by the read and write operations. The resulting algorithm tolerates dynamism. We formally prove our algorithm to be correct, we present its performance and compare it to existing reconfigurable memories, and we evaluate experimentally the cost of its reconfiguration mechanism. 相似文献
75.
Sanjiv Singh Marcel Bergerman Jillian Cannons Benjamin Grocholsky Bradley Hamner German Holguin Larry Hull Vincent Jones George Kantor Harvey Koselka Guiqin Li James Owen Johnny Park Wenfan Shi James Teza 《Intelligent Service Robotics》2010,3(4):245-262
Comprehensive Automation for Specialty Crops is a project focused on the needs of the specialty crops sector, with a focus on apples and nursery trees. The project’s main thrusts are the integration of robotics technology and plant science; understanding and overcoming socio-economic barriers to technology adoption; and making the results available to growers and stakeholders through a nationwide outreach program. In this article, we present the results obtained and lessons learned in the first year of the project with a reconfigurable mobility infrastructure for autonomous farm driving. We then present sensor systems developed to enable three real-world agricultural applications—insect monitoring, crop load scouting, and caliper measurement—and discuss how they can be deployed autonomously to yield increased production efficiency and reduced labor costs. 相似文献
76.
Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers 总被引:1,自引:0,他引:1
Joan Daemen Mario Lamberger Norbert Pramstaller Vincent Rijmen Frederik Vercauteren 《Computing》2009,85(1-2):85-104
In this paper we study the security of the Advanced Encryption Standard (AES) and AES-like block ciphers against differential cryptanalysis. Differential cryptanalysis is one of the most powerful methods for analyzing the security of block ciphers. Even though no formal proofs for the security of AES against differential cryptanalysis have been provided to date, some attempts to compute the maximum expected differential probability (MEDP) for two and four rounds of AES have been presented recently. In this paper, we will improve upon existing approaches in order to derive better bounds on the EDP for two and four rounds of AES based on a slightly simplified S-box. More precisely, we are able to provide the complete distribution of the EDP for two rounds of this AES variant with five active S-boxes and methods to improve the estimates for the EDP in the case of six active S-boxes. 相似文献
77.
Information estimates such as the direct method of Strong, Koberle, de Ruyter van Steveninck, and Bialek (1998) sidestep the difficult problem of estimating the joint distribution of response and stimulus by instead estimating the difference between the marginal and conditional entropies of the response. While this is an effective estimation strategy, it tempts the practitioner to ignore the role of the stimulus and the meaning of mutual information. We show here that as the number of trials increases indefinitely, the direct (or plug-in) estimate of marginal entropy converges (with probability 1) to the entropy of the time-averaged conditional distribution of the response, and the direct estimate of the conditional entropy converges to the time-averaged entropy of the conditional distribution of the response. Under joint stationarity and ergodicity of the response and stimulus, the difference of these quantities converges to the mutual information. When the stimulus is deterministic or nonstationary the direct estimate of information no longer estimates mutual information, which is no longer meaningful, but it remains a measure of variability of the response distribution across time. 相似文献
78.
Vincent C. Müller 《Minds and Machines》2009,19(4):529-541
The paper presents a paradoxical feature of computational systems that suggests that computationalism cannot explain symbol
grounding. If the mind is a digital computer, as computationalism claims, then it can be computing either over meaningful
symbols or over meaningless symbols. If it is computing over meaningful symbols its functioning presupposes the existence
of meaningful symbols in the system, i.e. it implies semantic nativism. If the mind is computing over meaningless symbols,
no intentional cognitive processes are available prior to symbol grounding. In this case, no symbol grounding could take place
since any grounding presupposes intentional cognitive processes. So, whether computing in the mind is over meaningless or
over meaningful symbols, computationalism implies semantic nativism. 相似文献
79.
Vincent C. Müller 《AI & Society》2009,23(4):529-544
Data mining is not an invasion of privacy because access to data is only by machines, not by people: this is the argument
that is investigated here. The current importance of this problem is developed in a case study of data mining in the USA for
counterterrorism and other surveillance purposes. After a clarification of the relevant nature of privacy, it is argued that
access by machines cannot warrant the access to further information, since the analysis will have to be made either by humans
or by machines that understand. It concludes that the current data mining violates the right to privacy and should be subject
to the standard legal constraints for access to private information by people.
相似文献
Vincent C. MüllerEmail: |
80.
Data classification is an important topic in the field of data mining due to its wide applications. A number of related methods have been proposed based on the well-known learning models such as decision tree or neural network. Although data classification was widely discussed, relatively few studies explored the topic of temporal data classification. Most of the existing researches focused on improving the accuracy of classification by using statistical models, neural network, or distance-based methods. However, they cannot interpret the results of classification to users. In many research cases, such as gene expression of microarray, users prefer the classification information above a classifier only with a high accuracy. In this paper, we propose a novel pattern-based data mining method, namely classify-by-sequence (CBS), for classifying large temporal datasets. The main methodology behind the CBS is integrating sequential pattern mining with probabilistic induction. The CBS has the merit of simplicity in implementation and its pattern-based architecture can supply clear classification information to users. Through experimental evaluation, the CBS was shown to deliver classification results with high accuracy under two real time series datasets. In addition, we designed a simulator to evaluate the performance of CBS under datasets with different characteristics. The experimental results show that CBS can discover the hidden patterns and classify data effectively by utilizing the mined sequential patterns. 相似文献