全文获取类型
收费全文 | 2431篇 |
免费 | 166篇 |
国内免费 | 13篇 |
专业分类
电工技术 | 38篇 |
综合类 | 6篇 |
化学工业 | 587篇 |
金属工艺 | 36篇 |
机械仪表 | 92篇 |
建筑科学 | 57篇 |
矿业工程 | 3篇 |
能源动力 | 232篇 |
轻工业 | 214篇 |
水利工程 | 18篇 |
石油天然气 | 42篇 |
无线电 | 241篇 |
一般工业技术 | 512篇 |
冶金工业 | 80篇 |
原子能技术 | 19篇 |
自动化技术 | 433篇 |
出版年
2024年 | 6篇 |
2023年 | 74篇 |
2022年 | 142篇 |
2021年 | 175篇 |
2020年 | 122篇 |
2019年 | 120篇 |
2018年 | 160篇 |
2017年 | 123篇 |
2016年 | 167篇 |
2015年 | 97篇 |
2014年 | 160篇 |
2013年 | 239篇 |
2012年 | 149篇 |
2011年 | 147篇 |
2010年 | 115篇 |
2009年 | 110篇 |
2008年 | 72篇 |
2007年 | 58篇 |
2006年 | 52篇 |
2005年 | 31篇 |
2004年 | 32篇 |
2003年 | 24篇 |
2002年 | 25篇 |
2001年 | 19篇 |
2000年 | 8篇 |
1999年 | 19篇 |
1998年 | 30篇 |
1997年 | 13篇 |
1996年 | 17篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 8篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1981年 | 3篇 |
1979年 | 2篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1972年 | 3篇 |
1959年 | 2篇 |
排序方式: 共有2610条查询结果,搜索用时 875 毫秒
41.
42.
A color-based face tracking algorithm is proposed to be used as a human-computer interaction tool on mobile devices. The solution
provides a natural means of interaction enabling a motion parallax effect in applications. The algorithm considers the characteristics
of mobile use-constrained computational resources and varying environmental conditions. The solution is based on color comparisons
and works on images gathered from the front camera of a device. In addition to color comparisons, the coherency of the facial
pixels is considered in the algorithm. Several applications are also demonstrated in this work, which use the face position
to determine the viewpoint in a virtual scene, or for browsing large images. The accuracy of the system is tested under different
environmental conditions such as lighting and background, and the performance of the system is measured in different types
of mobile devices. According to these measurements the system allows for accurate (7% RMS error) face tracking in real time
(20–100 fps). 相似文献
43.
Rupert Wegerif Bruce M. McLaren Marian Chamrada Oliver Scheuer Nasser Mansour Jan Mikšátko Mriga Williams 《Computers & Education》2010
This paper reports on an aspect of the EC funded Argunaut project which researched and developed awareness tools for moderators of online dialogues. In this study we report on an investigation into the nature of creative thinking in online dialogues and whether or not this creative thinking can be coded for and recognized automatically such that moderators can be alerted when creative thinking is occurring or when it has not occurred after a period of time. We outline a dialogic theory of creativity, as the emergence of new perspectives from the interplay of voices, and the testing of this theory using a range of methods including a coding scheme which combined coding for creative thinking with more established codes for critical thinking, artificial intelligence pattern-matching techniques to see if our codes could be read automatically from maps and ‘key event recall’ interviews to explore the experience of participants. Our findings are that: (1) the emergence of new perspectives in a graphical dialogue map can be recognized by our coding scheme supported by a machine pattern-matching algorithm in a way that can be used to provide awareness indicators for moderators; (2) that the trigger events leading to the emergence of new perspectives in the online dialogues studied were most commonly disagreements and (3) the spatial representation of messages in a graphically mediated synchronous dialogue environment such as Digalo may offer more affordance for creativity than the much more common scrolling text chat environments. All these findings support the usefulness of our new account of creativity in online dialogues based on dialogic theory and demonstrate that this account can be operationalised through machine coding in a way that can be turned into alerts for moderators. 相似文献
44.
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges.
A large portion of the computational load in a program rests within iterative computations. In object-oriented languages these
are commonly handled using iterators which are inadequate for parallel programming. This paper presents a powerful Parallel
Iterator concept to be used in object-oriented programs for the parallel traversal of a collection of elements. The Parallel
Iterator may be used with any collection type (even those inherently sequential) and it supports several scheduling schemes
which may even be decided dynamically at run-time. Some additional features are provided to allow early termination of parallel
loops, exception handling and a solution for performing reductions. With a slight contract modification, the Parallel Iterator
interface imitates that of the Java-style sequential iterator. All these features combine together to promote minimal, if
any, code restructuring. Along with the ease of use, the results reveal negligible overhead and the expected inherent speedup. 相似文献
45.
46.
Shahla Nemati Mohammad Ehsan Basiri Nasser Ghasem-Aghaee Mehdi Hosseinzadeh Aghdam 《Expert systems with applications》2009,36(10):12086-12094
Protein function prediction is an important problem in functional genomics. Typically, protein sequences are represented by feature vectors. A major problem of protein datasets that increase the complexity of classification models is their large number of features. Feature selection (FS) techniques are used to deal with this high dimensional space of features. In this paper, we propose a novel feature selection algorithm that combines genetic algorithms (GA) and ant colony optimization (ACO) for faster and better search capability. The hybrid algorithm makes use of advantages of both ACO and GA methods. Proposed algorithm is easily implemented and because of use of a simple classifier in that, its computational complexity is very low. The performance of proposed algorithm is compared to the performance of two prominent population-based algorithms, ACO and genetic algorithms. Experimentation is carried out using two challenging biological datasets, involving the hierarchical functional classification of GPCRs and enzymes. The criteria used for comparison are maximizing predictive accuracy, and finding the smallest subset of features. The results of experiments indicate the superiority of proposed algorithm. 相似文献
47.
Marcelo Godoy Simões Tiago Davi Curi Busarello Abdullah Saad Bubshait Farnaz Harirchi José Antenor Pomilio Frede Blaabjerg 《International journal of control》2016,89(4):850-870
This paper presents interactive smart battery-based storage (BBS) for wind generator (WG) and photovoltaic (PV) systems. The BBS is composed of an asymmetric cascaded H-bridge multilevel inverter (ACMI) with staircase modulation. The structure is parallel to the WG and PV systems, allowing the ACMI to have a reduction in power losses compared to the usual solution for storage connected at the DC-link of the converter for WG or PV systems. Moreover, the BBS is embedded with a decision algorithm running real-time energy costs, plus a battery state-of-charge manager and power quality capabilities, making the described system in this paper very interactive, smart and multifunctional. The paper describes how BBS interacts with the WG and PV and how its performance is improved. Experimental results are presented showing the efficacy of this BBS for renewable energy applications. 相似文献
48.
Christiane Jasmin Reinert‐Weiss Holger Baur Sheikh Abdullah Al Nusayer David Duhme Norbert Frühauf 《Journal of the Society for Information Display》2017,25(2):90-97
Conventional adaptive driving beam headlamps are limited in achieving still higher quantities of switchable pixels by the number of LEDs and movable elements needed. In this paper, it is shown that by integrating an active matrix liquid crystal display module, it is possible to realize fully adaptive high‐resolution headlights without mechanical elements and a finite number of LED with 30 k switchable pixels. 相似文献
49.
Abdullah Azfar Kim-Kwang Raymond Choo Lin Liu 《Multimedia Tools and Applications》2017,76(3):3313-3341
Android productivity apps have provided the facility of having a constantly accessible and productive workforce to the information and work capabilities needed by the users. With hundreds of productivity apps available in the Android app market, it is necessary to develop a taxonomy for the forensic investigators and the end users to allow them to know what personal data remnants are available from the productivity apps. In this paper, 30 popular Android productivity apps were examined. A logical extraction of the Android phone was collected by using a well-known mobile forensic tool- XRY to extract various information of forensic interest such as user email ID and list of tasks. Based on the findings, a two-dimensional taxonomy of the forensic artefacts of the productivity apps is proposed with the app categories in one dimension and the classes of artefacts in the other dimension. The artefacts identified in the study of the apps are summarised using the taxonomy. In addition, a comparison with the existing forensic taxonomies of different categories of Android apps is provided to facilitate timely collection and analysis of evidentiary materials from mobile devices. 相似文献
50.
Interactive data exploration platforms in Web, business and scientific domains are becoming increasingly popular. Typically, users without prior knowledge of data interact with these platforms in an exploratory manner hoping they might retrieve the results they are looking for. One way to explore large-volume data is by posing aggregate queries which group values of multiple rows by an aggregate operator to form a single value: an aggregated value. Though, when a query fails, i.e., returns undesired aggregated value, users will have to undertake a frustrating trial-and-error process to refine their queries, until a desired result is attained. This data exploration process, however, is growing rather difficult as the underlying data is typically of large-volume and high-dimensionality. While heuristic-based techniques are fairly successful in generating refined queries that meet specified requirements on the aggregated values, they are rather oblivious to the (dis)similarity between the input query and its corresponding refined version. Meanwhile, enforcing a similarity-aware query refinement is rather a non-trivial challenge, as it requires a careful examination of the query space while maintaining a low processing cost. To address this challenge, we propose an innovative scheme for efficient Similarity-Aware Refinement of Aggregation Queries called (EAGER) which aims to balance the tradeoff between satisfying the aggregate and similarity constraints imposed on the refined query to maximize its overall benefit to the user. To achieve that goal, EAGER implements efficient strategies to minimize the costs incurred in exploring the available search space by utilizing similarity-based and monotonic-based pruning techniques to bound the search space and quickly find a refined query that meets users’ expectations. Our extensive experiments show the scalability exhibited by EAGER under various workload settings, and the significant benefits it provides. 相似文献