全文获取类型
收费全文 | 10547篇 |
免费 | 850篇 |
国内免费 | 95篇 |
专业分类
电工技术 | 204篇 |
综合类 | 43篇 |
化学工业 | 2828篇 |
金属工艺 | 224篇 |
机械仪表 | 427篇 |
建筑科学 | 431篇 |
矿业工程 | 22篇 |
能源动力 | 660篇 |
轻工业 | 1079篇 |
水利工程 | 199篇 |
石油天然气 | 148篇 |
武器工业 | 7篇 |
无线电 | 1104篇 |
一般工业技术 | 1803篇 |
冶金工业 | 291篇 |
原子能技术 | 75篇 |
自动化技术 | 1947篇 |
出版年
2024年 | 44篇 |
2023年 | 204篇 |
2022年 | 387篇 |
2021年 | 664篇 |
2020年 | 598篇 |
2019年 | 723篇 |
2018年 | 821篇 |
2017年 | 779篇 |
2016年 | 775篇 |
2015年 | 461篇 |
2014年 | 766篇 |
2013年 | 1131篇 |
2012年 | 724篇 |
2011年 | 803篇 |
2010年 | 533篇 |
2009年 | 458篇 |
2008年 | 289篇 |
2007年 | 238篇 |
2006年 | 180篇 |
2005年 | 127篇 |
2004年 | 128篇 |
2003年 | 80篇 |
2002年 | 69篇 |
2001年 | 39篇 |
2000年 | 41篇 |
1999年 | 50篇 |
1998年 | 40篇 |
1997年 | 42篇 |
1996年 | 39篇 |
1995年 | 26篇 |
1994年 | 13篇 |
1993年 | 19篇 |
1992年 | 17篇 |
1991年 | 20篇 |
1990年 | 19篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 8篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1984年 | 19篇 |
1983年 | 15篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 11 毫秒
131.
An adaptive refinement technique is presented in this paper and used in conjunction with the Collocated Discrete Least Squares Meshless (CDLSM) method for the effective simulation of two-dimensional shocked hyperbolic problems. The CDLSM method is based on minimizing the least squares functional calculated at collocation points chosen on the problem domain and its boundaries. The functional is defined as the weighted sum of the squared residuals of the differential equation and its boundary conditions. A Moving Least Squares (MLS) method is used here to construct the meshless shape functions. An error estimator based on the value of functional at nodal points used to discretize the problem domain and its boundaries is developed and used to predict the areas of poor solutions. A node moving strategy is then used to refine the predicted zones of poor solutions before the problem is resolved on the refined distribution of nodes. The proposed methodology is applied to some two dimensional hyperbolic benchmark problems and the results are presented and compared to the exact solutions. The results clearly show the capabilities of the proposed method for the effective and efficient solution of hyperbolic problems of shocked and high gradient solutions. 相似文献
132.
Sudip Misra Author Vitae Author Vitae Mohammad S. Obaidat Author Vitae Pushkar Gupta Author Vitae Author Vitae Prayag Narula Author Vitae 《Journal of Systems and Software》2010,83(11):2188-2199
Primitive routing protocols for ad-hoc networks are “power hungry” and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous drainage of energy degrades battery performance as well. If a battery is allowed to intermittently remain in an idle state, it recovers some of its lost charge due to the charge recovery effect, which, in turn, results in prolonged battery life.In this paper, we use the ideas of naturally occurring ants’ foraging behavior (Dorigo and Stuetzle, 2004) [1] and based on those ideas, we design an energy-aware routing protocol, which not only incorporates the effect of power consumption in routing a packet, but also exploits the multi-path transmission properties of ant swarms and, hence, increases the battery life of a node. The efficiency of the protocol with respect to some of the existing ones has been established through simulations. It has been observed that the energy consumed in the network, the energy per packet in the case of EAAR are 60% less compared to MMBCR and the packets lost is only around 12% of what we have in AODV, in mobility scenarios. 相似文献
133.
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by the root of T. Each web page i carries a probability p
i
representative of the frequency with which it is visited. By adding hotlinks—shortcuts from a node to one of its descendents—we
wish to minimize the expected number of steps l needed to visit pages from the home page, expressed as a function of the entropy H(p) of the access probabilities p. This paper introduces several new strategies for effectively assigning hotlinks in a tree. For assigning exactly one hotlink
per node, our method guarantees an upper bound on l of 1.141H(p)+1 if d>2 and 1.08H(p)+2/3 if d=2. We also present the first efficient general methods for assigning at most k hotlinks per node in trees of arbitrary maximum degree, achieving bounds on l of at most
\frac2H(p)log(k+1)+1\frac{2H(p)}{\log(k+1)}+1
and
\fracH(p)log(k+d)-logd+1\frac{H(p)}{\log(k+d)-\log d}+1
, respectively. All our methods are strong, i.e., they provide the same guarantees on all subtrees after the assignment. We also present an algorithm implementing these
methods in O(nlog n) time, an improvement over the previous O(n
2) time algorithms. Finally we prove a Ω(nlog n) lower bound on the running time of any strong method that guarantee an average access time strictly better than 2H(p). 相似文献
134.
Mohammad Shorfuzzaman Peter Graham Rasit Eskicioglu 《The Journal of supercomputing》2010,51(3):374-392
Data grids support access to widely distributed storage for large numbers of users accessing potentially many large files.
Efficient access is hindered by the high latency of the Internet. To improve access time, replication at nearby sites may
be used. Replication also provides high availability, decreased bandwidth use, enhanced fault tolerance, and improved scalability.
Resource availability, network latency, and user requests in a grid environment may vary with time. Any replica placement
strategy must be able to adapt to such dynamic behavior. In this paper, we describe a new dynamic replica placement algorithm,
Popularity Based Replica Placement (PBRP), for hierarchical data grids which is guided by file “popularity”. Our goal is to
place replicas close to clients to reduce data access time while still using network and storage resources efficiently. The
effectiveness of PBRP depends on the selection of a threshold value related to file popularity. We also present Adaptive-PBRP
(APBRP) that determines this threshold dynamically based on data request arrival rates. We evaluate both algorithms using
simulation. Results for a range of data access patterns show that our algorithms can shorten job execution time significantly
and reduce bandwidth consumption compared to other dynamic replication methods. 相似文献
135.
In this paper, we present a thorough mathematical analysis of the use of neural networks to solve a specific classification
problem consisting of a bilinear boundary. The network under consideration is a three-layered perceptron with two hidden neurons
having the sigmoid serving as the activation function. The analysis of the hidden space created by the outputs of the hidden
neurons will provide results on the network’s capacity to isolate two classes of data in a bilinear fashion, and the importance
of the value of the sigmoid parameter is highlighted. We will obtain an explicit analytical function describing the boundary
generated by the network, thus providing information on the effect each parameter has on the network’s behavior. Generalizations
of the results are obtained with additional neurons, and a theorem concerned with analytical reproducibility of the boundary
function is established. 相似文献
136.
Oliver Schreer Ingo Feldmann Isabel Alonso Mediavilla Pedro Concejero Abdul H. Sadka Mohammad Rafiq Swash Sergio Benini Riccardo Leonardi Tijana Janjusevic Ebroul Izquierdo 《Multimedia Tools and Applications》2010,48(1):23-49
Multimedia analysis and reuse of raw un-edited audio visual content known as rushes is gaining acceptance by a large number
of research labs and companies. A set of research projects are considering multimedia indexing, annotation, search and retrieval
in the context of European funded research, but only the FP6 project RUSHES is focusing on automatic semantic annotation,
indexing and retrieval of raw and un-edited audio-visual content. Even professional content creators and providers as well
as home-users are dealing with this type of content and therefore novel technologies for semantic search and retrieval are
required. In this paper, we present a summary of the most relevant achievements of the RUSHES project, focusing on specific
approaches for automatic annotation as well as the main features of the final RUSHES search engine. 相似文献
137.
Fuzzy grey relational analysis for software effort estimation 总被引:1,自引:1,他引:0
Accurate and credible software effort estimation is a challenge for academic research and software industry. From many software
effort estimation models in existence, Estimation by Analogy (EA) is still one of the preferred techniques by software engineering
practitioners because it mimics the human problem solving approach. Accuracy of such a model depends on the characteristics
of the dataset, which is subject to considerable uncertainty. The inherent uncertainty in software attribute measurement has
significant impact on estimation accuracy because these attributes are measured based on human judgment and are often vague
and imprecise. To overcome this challenge we propose a new formal EA model based on the integration of Fuzzy set theory with
Grey Relational Analysis (GRA). Fuzzy set theory is employed to reduce uncertainty in distance measure between two tuples
at the k
th
continuous feature ( | ( xo(k) - xi(k) | ) \left( {\left| {\left( {{x_o}(k) - {x_i}(k)} \right.} \right|} \right) .GRA is a problem solving method that is used to assess the similarity between two tuples with M features. Since some of these features are not necessary to be continuous and may have nominal and ordinal scale type, aggregating
different forms of similarity measures will increase uncertainty in the similarity degree. Thus the GRA is mainly used to
reduce uncertainty in the distance measure between two software projects for both continuous and categorical features. Both
techniques are suitable when relationship between effort and other effort drivers is complex. Experimental results showed
that using integration of GRA with FL produced credible estimates when compared with the results obtained using Case-Based
Reasoning, Multiple Linear Regression and Artificial Neural Networks methods. 相似文献
138.
The probabilistic visual tracking methods using color histograms have been proven to be robust to target model variations and background illumination changes as shown by the recent research. However, the required computational cost is high due to intensive image data processing. The embedded solution of such algorithms become challenging due to high computational power demand and algorithm complexity. This paper presents a hardware/software co-design architecture for implementation of the well-known kernel based mean shift tracking algorithm. The design uses color histogram of the target as tracking feature. The target is searched in the consecutive images by maximizing the statistical match of the color distributions. The target localization is based on gradient based iterative search instead of exhaustive search which makes the system capable of achieving frame rate up to hundreds of frames per second while tracking multiple targets. The design, which is fully standalone, is implemented on a low-cost medium-size field programmable gate array (FPGA) device. The hardware cost of the design is compared with some other tracking systems. The performance of the system in terms of speed is evaluated and compared with the software based implementation. It is expected that the proposed solution will find its utility in applications like embedded automatic video surveillance systems. 相似文献
139.
Arya Aghili Ashtiani Mohammad Bagher Menhaj 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2010,14(6):545-557
In this paper, we study and formulate a BP learning algorithm for fuzzy relational neural networks based on smooth fuzzy norms
for functions approximation. To elaborate the model behavior more, we have used different fuzzy norms led to a new pair of
fuzzy norms. An important practical case in fuzzy relational equations (FREs) is the identification problem which is studied
in this work. In this work we employ a neuro-based approach to numerically solve the set of FREs and focus on generalized
neurons that use smooth s-norms and t-norms as fuzzy compositional operators. 相似文献
140.
Hossam Mohammad Khalil Mohammad El-Bardini 《Expert systems with applications》2011,38(11):14249-14256
The performance of a model-based control system depends strongly on the accuracy of the process model used. LS-SVM is a powerful method for modeling nonlinear systems. The main objective of this paper is to implement a conventional controller based on LS-SVM model for hydraulic motor. An off-line model is first identified based on LS-SVM, then via simulation tests the parameters of the discrete PI-Controller and its velocity-form are obtained then the controller parameters are applied experimentally for the hydraulic motor as a speed controller. The system performance has been evaluated; results show good performance over a wide range of operating conditions and load disturbances. 相似文献