全文获取类型
收费全文 | 7133篇 |
免费 | 324篇 |
国内免费 | 53篇 |
专业分类
电工技术 | 133篇 |
综合类 | 26篇 |
化学工业 | 1796篇 |
金属工艺 | 120篇 |
机械仪表 | 211篇 |
建筑科学 | 277篇 |
矿业工程 | 6篇 |
能源动力 | 469篇 |
轻工业 | 725篇 |
水利工程 | 76篇 |
石油天然气 | 115篇 |
无线电 | 656篇 |
一般工业技术 | 1159篇 |
冶金工业 | 337篇 |
原子能技术 | 83篇 |
自动化技术 | 1321篇 |
出版年
2024年 | 24篇 |
2023年 | 151篇 |
2022年 | 317篇 |
2021年 | 408篇 |
2020年 | 296篇 |
2019年 | 335篇 |
2018年 | 420篇 |
2017年 | 359篇 |
2016年 | 358篇 |
2015年 | 240篇 |
2014年 | 324篇 |
2013年 | 651篇 |
2012年 | 357篇 |
2011年 | 506篇 |
2010年 | 350篇 |
2009年 | 326篇 |
2008年 | 292篇 |
2007年 | 217篇 |
2006年 | 202篇 |
2005年 | 141篇 |
2004年 | 111篇 |
2003年 | 117篇 |
2002年 | 91篇 |
2001年 | 64篇 |
2000年 | 73篇 |
1999年 | 50篇 |
1998年 | 77篇 |
1997年 | 41篇 |
1996年 | 49篇 |
1995年 | 40篇 |
1994年 | 36篇 |
1993年 | 44篇 |
1992年 | 36篇 |
1991年 | 32篇 |
1990年 | 30篇 |
1989年 | 20篇 |
1988年 | 35篇 |
1987年 | 30篇 |
1986年 | 20篇 |
1985年 | 15篇 |
1984年 | 27篇 |
1983年 | 22篇 |
1982年 | 22篇 |
1981年 | 16篇 |
1980年 | 20篇 |
1979年 | 16篇 |
1978年 | 17篇 |
1976年 | 18篇 |
1975年 | 19篇 |
1974年 | 12篇 |
排序方式: 共有7510条查询结果,搜索用时 11 毫秒
71.
In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical examples are given to illustrate the applicability of the results using standard numerical software. 相似文献
72.
We address the verification problem of networks of communicating pushdown systems modeling communicating parallel programs with procedure calls. Processes in such networks can read the control state of the other processes according to a given communication structure (specifying the observability rights between processes). The reachability problem of such models is undecidable in general. First, we define a class of networks that effectively preserves recognizability (hence, its reachability problem is decidable). Then, we consider networks where the communication structure can change dynamically during the execution according to a phase graph. The reachability problem for these dynamic networks being undecidable in general, we define a subclass for which it becomes decidable. Then, we consider reachability when the switches in the communication structures are bounded. We show that this problem is undecidable even for one switch. We define a natural class of models for which this problem is decidable. This class can be used in the definition of an efficient semi-decision procedure for the analysis of the general model of dynamic networks. Our techniques allowed to find bugs in two versions of a Windows NT Bluetooth driver. 相似文献
73.
Yulei Wu Geyong Min Mohamed Ould-Khaoua Hao Yin Lan Wang 《The Journal of supercomputing》2010,51(2):115-130
The hypercube and torus are two important message-passing network architectures of high-performance multicomputers. Analytical
models of multicomputer networks under the non-bursty Poisson traffic have been widely reported. Motivated by the convincing
evidence of bursty and batch arrival nature of traffic generated by many real-world parallel applications in high-performance
computing environments, we develop a new and concise analytical model in this paper for hypercube and torus networks in the
presence of batch message arrivals modelled by the compound Poisson process with geometrically distributed batch sizes. The
average degree of virtual channel multiplexing is derived by employing a Markov chain which can capture the batch arrival
nature. An attractive advantage of the model is its constant computation complexity independent of the network size. The accuracy
of the analytical performance results is validated against those obtained from simulation experiments of an actual system. 相似文献
74.
This paper investigates how dynamics in recurrent neural networks can be used to solve some specific mobile robot problems
such as motion control and behavior generation. We have designed an adaptive motion control approach based on a novel recurrent neural network, called Echo state networks.
The advantage is that no knowledge about the dynamic model is required, and no synaptic weight changing is needed in presence
of time varying parameters in the robot. To generate the robot behavior over time, we adopted a biologically inspired approach
called neural fields. Due to its dynamical properties, a neural field produces only one localized peak that indicates the
optimum movement direction, which navigates a mobile robot to its goal in an unknown environment without any collisions with
static or moving obstacles. 相似文献
75.
Mohamed Sadok Cherif Habib Chabchoub Belaïd Aouni 《International Transactions in Operational Research》2010,17(1):85-102
Quality function deployment (QFD) is a customer-oriented design tool for developing new or improved products to achieve higher customer satisfaction by integrating various functions of an organization. The engineering characteristics (ECs) affecting the product performances are designed to match the customer attributes (CAs). However, from the viewpoint of the QFD team, product design processes are performed in imprecise environments, and more than one factor must be taken into account in determining the target levels of ECs, especially the limited resources and increased market competition. This paper presents an imprecise goal programming (GP) approach to determine the optimum target levels of ECs in QFD for maximizing customer satisfaction under resource limitation and considerations of market competition. Based on benchmarking data of CAs, the concept of satisfaction functions is utilized to formulate explicitly the customer's preferences and to integrate the competitive analysis of target market into the modelling and solution process. In addition, the relationships linking CAs and ECs and the ECs to each other are integrated by functional relationships. The proposed approach will be illustrated through a car door design example. 相似文献
76.
Privacy policies for shared content in social network sites 总被引:1,自引:0,他引:1
Anna C. Squicciarini Mohamed Shehab Joshua Wede 《The VLDB Journal The International Journal on Very Large Data Bases》2010,19(6):777-796
Social networking is one of the major technological phenomena of the Web 2.0, with hundreds of millions of subscribed users.
Social networks enable a form of self-expression for users and help them to socialize and share content with other users.
In spite of the fact that content sharing represents one of the prominent features of existing Social network sites, they
do not provide any mechanisms for collective management of privacy settings for shared content. In this paper, using game
theory, we model the problem of collective enforcement of privacy policies on shared data. In particular, we propose a solution
that offers automated ways to share images based on an extended notion of content ownership. Building upon the Clarke-Tax
mechanism, we describe a simple mechanism that promotes truthfulness and that rewards users who promote co-ownership. Our
approach enables social network users to compose friendship based policies based on distances from an agreed upon central
user selected using several social networks metrics. We integrate our design with inference techniques that free the users
from the burden of manually selecting privacy preferences for each picture. To the best of our knowledge, this is the first
time such a privacy protection mechanism for social networking has been proposed. We also extend our mechanism so as to support
collective enforcement across multiple social network sites. In the paper, we also show a proof-of-concept application, which
we implemented in the context of Facebook, one of today’s most popular social networks. Through our implementation, we show
the feasibility of such approach and show that it can be implemented with a minimal increase in overhead to end-users. We
complete our analysis by conducting a user study to investigate users’ understanding of co-ownership, usefulness and understanding
of our approach. Users responded favorably to the approach, indicating a general understanding of co-ownership and the auction,
and found the approach to be both useful and fair. 相似文献
77.
78.
M. Faisal A. Mohamed H. Shareef A. Hussain 《Expert systems with applications》2011,38(10):12592-12598
Diagnosing a power quality disturbance means identifying the type and cause of the disturbance. Fast diagnosis of power quality disturbances is important so as to assist network operators in performing counter measures and implementing suitable power quality mitigation actions. In this study a novel method for performing power quality diagnosis is presented by using the S-transform and rule based classification techniques. The proposed power quality diagnosis method was evaluated for its functionality in detecting the type of short duration voltage disturbances and identifying the cause of the disturbances which may be due to permanent or non permanent faults. Based on the results, this new method has the potential to be used in the existing real time power quality monitoring system in Malaysia to expedite the diagnosis on the recorded voltage disturbances. 相似文献
79.
We investigate the one-dimensional variable-sized bin-packing problem. This problem requires packing a set of items into a minimum-cost set of bins of unequal sizes and costs. Six optimization-based heuristics for this problem are presented and compared. We analyze their empirical performance on a large set of randomly generated test instances with up to 2000 items and seven bin types. The first contribution of this paper is to provide evidence that a set covering heuristic proves to be highly effective and capable of delivering very-high quality solutions within short CPU times. In addition, we found that a simple subset-sum problem-based heuristic consistently outperforms heuristics from the literature while requiring extremely short CPU times. 相似文献
80.
Partial 3D Shape Retrieval by Reeb Pattern Unfolding 总被引:2,自引:0,他引:2
This paper presents a novel approach for fast and efficient partial shape retrieval on a collection of 3D shapes. Each shape is represented by a Reeb graph associated with geometrical signatures. Partial similarity between two shapes is evaluated by computing a variant of their maximum common sub-graph.
By investigating Reeb graph theory, we take advantage of its intrinsic properties at two levels. First, we show that the segmentation of a shape by a Reeb graph provides charts with disk or annulus topology only. This topology control enables the computation of concise and efficient sub-part geometrical signatures based on parameterisation techniques. Secondly, we introduce the notion of Reeb pattern on a Reeb graph along with its structural signature. We show this information discards Reeb graph structural distortion and still depicts the topology of the related sub-parts. The number of combinations to evaluate in the matching process is then dramatically reduced by only considering the combinations of topology equivalent Reeb patterns.
The proposed framework is invariant against rigid transformations and robust against non-rigid transformations and surface noise. It queries the collection in interactive time (from 4 to 30 seconds for the largest queries). It outperforms the competing methods of the SHREC 2007 contest in term of NDCG vector and provides, respectively, a gain of 14.1% and 40.9% on the approaches by Biasotti et al. [ BMSF06 ] and Cornea et al. [ CDS*05 ].
As an application, we present an intelligent modelling-by-example system which enables a novice user to rapidly create new 3D shapes by composing shapes of a collection having similar sub-parts. 相似文献
By investigating Reeb graph theory, we take advantage of its intrinsic properties at two levels. First, we show that the segmentation of a shape by a Reeb graph provides charts with disk or annulus topology only. This topology control enables the computation of concise and efficient sub-part geometrical signatures based on parameterisation techniques. Secondly, we introduce the notion of Reeb pattern on a Reeb graph along with its structural signature. We show this information discards Reeb graph structural distortion and still depicts the topology of the related sub-parts. The number of combinations to evaluate in the matching process is then dramatically reduced by only considering the combinations of topology equivalent Reeb patterns.
The proposed framework is invariant against rigid transformations and robust against non-rigid transformations and surface noise. It queries the collection in interactive time (from 4 to 30 seconds for the largest queries). It outperforms the competing methods of the SHREC 2007 contest in term of NDCG vector and provides, respectively, a gain of 14.1% and 40.9% on the approaches by Biasotti et al. [ BMSF06 ] and Cornea et al. [ CDS*05 ].
As an application, we present an intelligent modelling-by-example system which enables a novice user to rapidly create new 3D shapes by composing shapes of a collection having similar sub-parts. 相似文献