全文获取类型
收费全文 | 77797篇 |
免费 | 4495篇 |
国内免费 | 68篇 |
专业分类
电工技术 | 538篇 |
综合类 | 48篇 |
化学工业 | 14905篇 |
金属工艺 | 1444篇 |
机械仪表 | 1502篇 |
建筑科学 | 2319篇 |
矿业工程 | 157篇 |
能源动力 | 1570篇 |
轻工业 | 11352篇 |
水利工程 | 769篇 |
石油天然气 | 319篇 |
武器工业 | 7篇 |
无线电 | 3722篇 |
一般工业技术 | 13303篇 |
冶金工业 | 19564篇 |
原子能技术 | 358篇 |
自动化技术 | 10483篇 |
出版年
2023年 | 618篇 |
2022年 | 776篇 |
2021年 | 1731篇 |
2020年 | 1427篇 |
2019年 | 1540篇 |
2018年 | 2856篇 |
2017年 | 2797篇 |
2016年 | 2950篇 |
2015年 | 2189篇 |
2014年 | 2760篇 |
2013年 | 5617篇 |
2012年 | 4477篇 |
2011年 | 4114篇 |
2010年 | 3355篇 |
2009年 | 3096篇 |
2008年 | 3271篇 |
2007年 | 2963篇 |
2006年 | 2133篇 |
2005年 | 1772篇 |
2004年 | 1678篇 |
2003年 | 1504篇 |
2002年 | 1365篇 |
2001年 | 977篇 |
2000年 | 930篇 |
1999年 | 1152篇 |
1998年 | 5996篇 |
1997年 | 3841篇 |
1996年 | 2499篇 |
1995年 | 1483篇 |
1994年 | 1208篇 |
1993年 | 1270篇 |
1992年 | 446篇 |
1991年 | 460篇 |
1990年 | 406篇 |
1989年 | 403篇 |
1988年 | 391篇 |
1987年 | 337篇 |
1986年 | 346篇 |
1985年 | 398篇 |
1984年 | 330篇 |
1983年 | 248篇 |
1982年 | 310篇 |
1981年 | 352篇 |
1980年 | 341篇 |
1979年 | 221篇 |
1978年 | 211篇 |
1977年 | 529篇 |
1976年 | 1118篇 |
1975年 | 150篇 |
1973年 | 152篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
Jose Saldana Julián Fernández-Navajas José Ruiz-Mas Jenifer Murillo Eduardo Viruete Navarro José I. Aznar 《Computer Networks》2012,56(7):1893-1919
This work presents a study of RTP multiplexing schemes, which are compared with the normal use of RTP, in terms of experienced quality. Bandwidth saving, latency and packet loss for different options are studied, and some tests of Voice over IP (VoIP) traffic are carried out in order to compare the quality obtained using different implementations of the router buffer. Voice quality is calculated using ITU R-factor, which is a widely accepted quality estimator. The tests show the bandwidth savings of multiplexing, and also the importance of packet size for certain buffers, as latency and packet loss may be affected. The customer’s experience improvement is measured, showing that the use of multiplexing can be interesting in some scenarios, like an enterprise with different offices connected via the Internet. The system is also tested using different numbers of samples per packet, and the distribution of the flows into different tunnels is found to be an important factor in order to achieve an optimal perceived quality for each kind of buffer. Grouping all the flows into a single tunnel will not always be the best solution, as the increase of the number of flows does not improve bandwidth efficiency indefinitely. If the buffer penalizes big packets, it will be better to group the flows into a number of tunnels. The router processing capacity has to be taken into account too, as the limit of packets per second it can manage must not be exceeded. The obtained results show that multiplexing is a good way to improve customer’s experience of VoIP in scenarios where many RTP flows share the same path. 相似文献
992.
In this paper, a new approximation to off-line signature verification is proposed based on two-class classifiers using an
expert decisions ensemble. Different methods to extract sets of local and a global features from the target sample are detailed.
Also a normalization by confidence voting method is used in order to decrease the final equal error rate (EER). Each set of
features is processed by a single expert, and on the other approach proposed, the decisions of the individual classifiers
are combined using weighted votes. Experimental results are given using a subcorpus of the large MCYT signature database for
random and skilled forgeries. The results show that the weighted combination outperforms the individual classifiers significantly.
The best EER obtained were 6.3 % in the case of skilled forgeries and 2.31 % in the case of random forgeries. 相似文献
993.
A pattern is a model or a template used to summarize and describe the behavior (or the trend) of data having generally some recurrent events. Patterns have received a considerable attention in recent years and were widely studied in the data mining field. Various pattern mining approaches have been proposed and used for different applications such as network monitoring, moving object tracking, financial or medical data analysis, scientific data processing, etc. In these different contexts, discovered patterns were useful to detect anomalies, to predict data behavior (or trend) or, more generally, to simplify data processing or to improve system performance. However, to the best of our knowledge, patterns have never been used in the context of Web archiving. Web archiving is the process of continuously collecting and preserving portions of the World Wide Web for future generations. In this paper, we show how patterns of page changes can be useful tools to efficiently archive Websites. We first define our pattern model that describes the importance of page changes. Then, we present the strategy used to (i) extract the temporal evolution of page changes, (ii) discover patterns, to (iii) exploit them to improve Web archives. The archive of French public TV channels France Télévisions is chosen as a case study to validate our approach. Our experimental evaluation based on real Web pages shows the utility of patterns to improve archive quality and to optimize indexing or storing. 相似文献
994.
Julián Luengo José A. Sáez Francisco Herrera 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(5):863-881
Fuzzy rule-based classification systems (FRBCSs) are known due to their ability to treat with low quality data and obtain
good results in these scenarios. However, their application in problems with missing data are uncommon while in real-life
data, information is frequently incomplete in data mining, caused by the presence of missing values in attributes. Several
schemes have been studied to overcome the drawbacks produced by missing values in data mining tasks; one of the most well
known is based on preprocessing, formerly known as imputation. In this work, we focus on FRBCSs considering 14 different approaches
to missing attribute values treatment that are presented and analyzed. The analysis involves three different methods, in which
we distinguish between Mamdani and TSK models. From the obtained results, the convenience of using imputation methods for
FRBCSs with missing values is stated. The analysis suggests that each type behaves differently while the use of determined
missing values imputation methods could improve the accuracy obtained for these methods. Thus, the use of particular imputation
methods conditioned to the type of FRBCSs is required. 相似文献
995.
A. M. Palacios M. J. Gacto J. Alcalá-Fdez 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(5):883-901
Data mining is most commonly used in attempts to induce association rules from databases which can help decision-makers easily
analyze the data and make good decisions regarding the domains concerned. Different studies have proposed methods for mining
association rules from databases with crisp values. However, the data in many real-world applications have a certain degree
of imprecision. In this paper we address this problem, and propose a new data-mining algorithm for extracting interesting
knowledge from databases with imprecise data. The proposed algorithm integrates imprecise data concepts and the fuzzy apriori
mining algorithm to find interesting fuzzy association rules in given databases. Experiments for diagnosing dyslexia in early
childhood were made to verify the performance of the proposed algorithm. 相似文献
996.
José M. Cecilia José M. García Ginés D. Guerrero Miguel A. Martínez-del-Amor Mario J. Pérez-Jiménez Manuel Ujaldón 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(2):231-246
Membrane Computing is a discipline aiming to abstract formal computing models, called membrane systems or P systems, from the structure and functioning of the living cells as well as from the cooperation of cells in tissues, organs, and
other higher order structures. This framework provides polynomial time solutions to NP-complete problems by trading space
for time, and whose efficient simulation poses challenges in three different aspects: an intrinsic massively parallelism of
P systems, an exponential computational workspace, and a non-intensive floating point nature. In this paper, we analyze the
simulation of a family of recognizer P systems with active membranes that solves the Satisfiability problem in linear time
on different instances of Graphics Processing Units (GPUs). For an efficient handling of the exponential workspace created
by the P systems computation, we enable different data policies to increase memory bandwidth and exploit data locality through
tiling and dynamic queues. Parallelism inherent to the target P system is also managed to demonstrate that GPUs offer a valid
alternative for high-performance computing at a considerably lower cost. Furthermore, scalability is demonstrated on the way
to the largest problem size we were able to run, and considering the new hardware generation from Nvidia, Fermi, for a total
speed-up exceeding four orders of magnitude when running our simulations on the Tesla S2050 server. 相似文献
997.
Tomá? Kroupa 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(11):1851-1861
We generalise belief functions to many-valued events which are represented by elements of Lindenbaum algebra of infinite-valued ?ukasiewicz propositional logic. Our approach is based on mass assignments used in the Dempster–Shafer theory of evidence. A generalised belief function is totally monotone and it has Choquet integral representation with respect to a unique belief measure on Boolean events. 相似文献
998.
Daniel Camps-Mur Manil Dev Gomony Xavier Pérez-Costa Sebastià Sallent-Ribes 《Computer Networks》2012,56(12):2896-2911
The Wi-Fi technology, driven by its tremendous success, is expanding into a wide variety of devices and applications. However, many of these new devices, like handheld devices, pose new challenges in terms of QoS and energy efficiency. In order to address these challenges, in this paper we study how the novel MAC aggregation mechanisms developed in the 802.11n standard can be used to enhance the current 802.11 QoS and power saving protocols. Our contribution is twofold. First, we present a simulation study that illustrates the interactions between 802.11n and the current 802.11 QoS and power saving protocols. This study reveals that the 802.11n MAC aggregation mechanisms perform better when combined with the power save mode included in the original 802.11 standard than with the 802.11e U-APSD protocol. Second, we design CA-DFA, an algorithm that, using only information available at layer two, adapts the amount of 802.11n aggregation used by a Wi-Fi station according to the level of congestion in the network. A detailed performance evaluation demonstrates the benefits of CA-DFA in terms of QoS, energy efficiency and network capacity with respect to state of the art alternatives. 相似文献
999.
Sergio Herrerı´a-Alonso Miguel Rodrı´guez-Pérez Manuel Fernández-Veiga Cándido López-Garcı´a 《Computer Networks》2012,56(10):2456-2467
The IEEE 802.3az standard provides a new low power mode that Ethernet network interfaces can use to save energy when there is no traffic to transmit. Simultaneously with the final standard approval, several algorithms were proposed to govern the physical interface state transition between the normal active mode and the new low power mode. In fact, the standard leaves this sleeping algorithm unspecified to spur competition among different vendors and achieve the greatest energy savings. In this paper, we try to bring some light to the most well known sleeping algorithms, providing mathematical models for the expected energy savings and the average packet delay inflicted on outgoing traffic. We will then use the models to derive optimum configuration parameters for them under given efficiency constraints. 相似文献
1000.
The paper focuses on a control design for a vehicle suspension system in which a balance between different performance demands is achieved. The starting point of the control design is a full–car model which contains nonlinear components, i.e. the dynamics of the dampers and springs and nonlinear actuator dynamics. In order to handle the high complexity of the problem this paper proposes the design of a two‐level controller of an active suspension system. The required control force is computed by applying a high‐level controller, which is designed using a linear parameter varying (LPV) method. For the control design the model is augmented with weighting functions specified by the performance demands and the uncertainty assumptions. The actuator generating the necessary control force is modelled as a nonlinear system for which a low‐level force‐tracking controller is designed. To obtain the low‐level controller a backstepping method is proposed. As an alternative solution a feedback linearization method is also presented. The operation of the controller is illustrated through simulation examples. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society 相似文献