全文获取类型
收费全文 | 3673篇 |
免费 | 183篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 24篇 |
综合类 | 2篇 |
化学工业 | 720篇 |
金属工艺 | 128篇 |
机械仪表 | 79篇 |
建筑科学 | 195篇 |
矿业工程 | 8篇 |
能源动力 | 116篇 |
轻工业 | 184篇 |
水利工程 | 45篇 |
石油天然气 | 29篇 |
无线电 | 274篇 |
一般工业技术 | 773篇 |
冶金工业 | 739篇 |
原子能技术 | 16篇 |
自动化技术 | 528篇 |
出版年
2023年 | 37篇 |
2022年 | 44篇 |
2021年 | 105篇 |
2020年 | 77篇 |
2019年 | 91篇 |
2018年 | 95篇 |
2017年 | 89篇 |
2016年 | 95篇 |
2015年 | 84篇 |
2014年 | 125篇 |
2013年 | 232篇 |
2012年 | 177篇 |
2011年 | 253篇 |
2010年 | 166篇 |
2009年 | 160篇 |
2008年 | 178篇 |
2007年 | 163篇 |
2006年 | 138篇 |
2005年 | 103篇 |
2004年 | 87篇 |
2003年 | 94篇 |
2002年 | 69篇 |
2001年 | 52篇 |
2000年 | 55篇 |
1999年 | 43篇 |
1998年 | 86篇 |
1997年 | 72篇 |
1996年 | 64篇 |
1995年 | 40篇 |
1994年 | 51篇 |
1993年 | 40篇 |
1992年 | 33篇 |
1991年 | 29篇 |
1990年 | 39篇 |
1989年 | 45篇 |
1988年 | 35篇 |
1987年 | 52篇 |
1986年 | 29篇 |
1985年 | 35篇 |
1984年 | 33篇 |
1983年 | 32篇 |
1982年 | 32篇 |
1981年 | 21篇 |
1980年 | 22篇 |
1979年 | 28篇 |
1978年 | 30篇 |
1977年 | 26篇 |
1976年 | 25篇 |
1975年 | 23篇 |
1973年 | 18篇 |
排序方式: 共有3860条查询结果,搜索用时 375 毫秒
71.
72.
Nicholas Mattei Maria Silvia Pini Francesca Rossi K. Brent Venable 《Annals of Mathematics and Artificial Intelligence》2013,68(1-3):135-160
We investigate the computational complexity of finding optimal bribery schemes in voting domains where the candidate set is the Cartesian product of a set of variables and voters use CP-nets, an expressive and compact way to represent preferences. To do this, we generalize the traditional bribery problem to take into account several issues over which agents vote, and their inter-dependencies. We consider five voting rules, three kinds of bribery actions, and five cost schemes. For most of the combinations of these parameters, we find that bribery in this setting is computationally easy. 相似文献
73.
Coralia Cartis Nicholas I.M. Gould Philippe L. Toint 《Optimization methods & software》2013,28(3):451-457
This short note considers and resolves the apparent contradiction between known worst-case complexity results for first- and second-order methods for solving unconstrained smooth nonconvex optimization problems and a recent note by Jarre [On Nesterov's smooth Chebyshev–Rosenbrock function, Optim. Methods Softw. (2011)] implying a very large lower bound on the number of iterations required to reach the solution's neighbourhood for a specific problem with variable dimension. 相似文献
74.
Nicholas A. John 《Journal of Computer-Mediated Communication》2013,18(3):321-338
This paper examines the technologies that enable the representation of Hebrew on websites. Hebrew is written from right to left and in non‐Latin characters, issues shared by a number of languages which seem to be converging on a shared solution—Unicode. Regarding the case of Hebrew, I show how competing solutions have given way to one dominant technology. I link processes in the Israeli context with broader questions about the ‘multilingual Internet,’ asking whether the commonly accepted solution for representing non‐Latin texts on computer screens is an instance of cultural imperialism and convergence around a western artifact. It is argued that while minority languages are given an online voice by Unicode, the context is still one of western power. 相似文献
75.
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the case we treat in this paper. We are concerned with the degree (the number of neighboring cells on which the state transition function depends) needed to achieve fault tolerance when the fault rate is high (nearly 1/2). We consider both the traditional transient fault model (where faults occur independently in time and space) and a recently introduced combined fault model which also includes manufacturing faults (which occur independently in space, but which affect cells for all time). We also consider both a purely probabilistic fault model (in which the states of cells are perturbed at exactly the fault rate) and an adversarial model (in which the occurrence of a fault gives control of the state to an omniscient adversary). We show that there are cellular automata that can tolerate a fault rate 1/2−ξ (with ξ>0) with degree O((1/ξ2)log(1/ξ)), even with adversarial combined faults. The simplest such automata are based on infinite regular trees, but our results also apply to other structures (such as hyperbolic tessellations) that contain infinite regular trees. We also obtain a lower bound of Ω(1/ξ2), even with only purely probabilistic transient faults. 相似文献
76.
Dowson N Bowden R 《IEEE transactions on pattern analysis and machine intelligence》2008,30(1):180-185
Mutual Information (MI) is popular for registration via function optimisation. This work proposes an inverse compositional formulation of MI for Levenberg-Marquardt optimisation. This yields a constant Hessian, which may be pre-computed. Speed improvements of 15% were obtained, with convergence accuracies similar to those of the standard formulation. 相似文献
77.
The V–Si system is reassessed based on a critical literature review involving recently reported data and the present experimental data. These new data include the thermodynamic stability of V 6Si5 and the enthalpies of formation for the compounds calculated by first-principles method. Two alloys were prepared in the region of (Si)+V Si2 and annealed at 1273 K for 14 days. After X-ray diffraction (XRD) and chemical analysis of these alloys were performed, the eutectic reaction (L⇔(Si)+V Si2) temperature was determined by differential thermal analysis (DTA). Self-consistent thermodynamic parameters for the V–Si system were obtained by optimization of the selected experimental values. The calculated phase diagram and thermodynamic properties agree well with the experimental ones. Noticeable improvements have been made, compared with the previous assessments. 相似文献
78.
Marcelo Siqueira Longin Jan Latecki Nicholas Tustison Jean Gallier James Gee 《Journal of Mathematical Imaging and Vision》2008,30(3):249-274
We present here a new randomized algorithm for repairing the topology of objects represented by 3D binary digital images.
By “repairing the topology”, we mean a systematic way of modifying a given binary image in order to produce a similar binary
image which is guaranteed to be well-composed. A 3D binary digital image is said to be well-composed if, and only if, the square faces shared by background and foreground
voxels form a 2D manifold. Well-composed images enjoy some special properties which can make such images very desirable in
practical applications. For instance, well-known algorithms for extracting surfaces from and thinning binary images can be
simplified and optimized for speed if the input image is assumed to be well-composed. Furthermore, some algorithms for computing
surface curvature and extracting adaptive triangulated surfaces, directly from the binary data, can only be applied to well-composed
images. Finally, we introduce an extension of the aforementioned algorithm to repairing 3D digital multivalued images. Such
an algorithm finds application in repairing segmented images resulting from multi-object segmentations of other 3D digital
multivalued images.
相似文献
James GeeEmail: |
79.
Nicholas P. Webb Hamish A. McGowan Stuart R. Phinn John F. Leys Grant H. McTainsh 《Environmental Modelling & Software》2009,24(2):214-227
This paper describes the development and validation of the Australian Land Erodibility Model (AUSLEM), designed to predict land susceptibility to wind erosion in western Queensland, Australia. The model operates at a 5 × 5 km spatial resolution on a daily time-step with inputs of grass and tree cover, soil moisture, soil texture and surficial stone cover. The system was implemented to predict land erodibility, i.e. susceptibility to wind erosion, for the period 1980–1990. Model performance was evaluated using cross-correlation analyses to compare trajectories of mean annual land erodibility at selected locations with trends in wind speed and observational records of dust events and a Dust Storm Index (DSI). The validation was conducted at four spatial length scales from 25 to 150 km using windows to represent potential dust source areas centered on and positioned around eight meteorological stations within the study area. The predicted land erodibility had strong correlations with dust-event frequencies at half of the stations. Poor correlations at the other stations were linked to the inability of the model to account for temporal changes in soil erodibility, and comparing trends in the land erodibility of regions with dust events whose source areas lie outside the regions of interest. The model agreement with dust-event frequency trends was found to vary across spatial scales and was highly dependent on land type characteristics around the stations and on the types of dust events used for validation. 相似文献
80.
Hierarchical classification of protein function with ensembles of rules and particle swarm optimisation 总被引:1,自引:1,他引:0
Nicholas Holden Alex A. Freitas 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(3):259-272
This paper focuses on hierarchical classification problems where the classes to be predicted are organized in the form of
a tree. The standard top-down divide and conquer approach for hierarchical classification consists of building a hierarchy
of classifiers where a classifier is built for each internal (non-leaf) node in the class tree. Each classifier discriminates
only between its child classes. After the tree of classifiers is built, the system uses them to classify test examples one
class level at a time, so that when the example is assigned a class at a given level, only the child classes need to be considered
at the next level. This approach has the drawback that, if a test example is misclassified at a certain class level, it will
be misclassified at deeper levels too. In this paper we propose hierarchical classification methods to mitigate this drawback.
More precisely, we propose a method called hierarchical ensemble of hierarchical rule sets (HEHRS), where different ensembles
are built at different levels in the class tree and each ensemble consists of different rule sets built from training examples
at different levels of the class tree. We also use a particle swarm optimisation (PSO) algorithm to optimise the rule weights
used by HEHRS to combine the predictions of different rules into a class to be assigned to a given test example. In addition,
we propose a variant of a method to mitigate the aforementioned drawback of top-down classification. These three types of
methods are compared against the standard top-down hierarchical classification method in six challenging bioinformatics datasets,
involving the prediction of protein function. Overall HEHRS with the rule weights optimised by the PSO algorithm obtains the
best predictive accuracy out of the four types of hierarchical classification method. 相似文献