全文获取类型
收费全文 | 5759篇 |
免费 | 238篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 47篇 |
综合类 | 7篇 |
化学工业 | 1188篇 |
金属工艺 | 101篇 |
机械仪表 | 119篇 |
建筑科学 | 218篇 |
矿业工程 | 16篇 |
能源动力 | 96篇 |
轻工业 | 600篇 |
水利工程 | 35篇 |
石油天然气 | 4篇 |
无线电 | 354篇 |
一般工业技术 | 963篇 |
冶金工业 | 1517篇 |
原子能技术 | 32篇 |
自动化技术 | 709篇 |
出版年
2023年 | 36篇 |
2022年 | 63篇 |
2021年 | 112篇 |
2020年 | 93篇 |
2019年 | 76篇 |
2018年 | 167篇 |
2017年 | 162篇 |
2016年 | 172篇 |
2015年 | 140篇 |
2014年 | 156篇 |
2013年 | 365篇 |
2012年 | 307篇 |
2011年 | 320篇 |
2010年 | 246篇 |
2009年 | 209篇 |
2008年 | 268篇 |
2007年 | 210篇 |
2006年 | 193篇 |
2005年 | 155篇 |
2004年 | 129篇 |
2003年 | 115篇 |
2002年 | 99篇 |
2001年 | 84篇 |
2000年 | 98篇 |
1999年 | 86篇 |
1998年 | 517篇 |
1997年 | 296篇 |
1996年 | 194篇 |
1995年 | 109篇 |
1994年 | 107篇 |
1993年 | 106篇 |
1992年 | 23篇 |
1991年 | 42篇 |
1990年 | 24篇 |
1989年 | 37篇 |
1988年 | 30篇 |
1987年 | 27篇 |
1986年 | 19篇 |
1985年 | 36篇 |
1984年 | 23篇 |
1983年 | 23篇 |
1982年 | 34篇 |
1981年 | 36篇 |
1980年 | 23篇 |
1979年 | 16篇 |
1978年 | 22篇 |
1977年 | 43篇 |
1976年 | 46篇 |
1975年 | 17篇 |
1973年 | 13篇 |
排序方式: 共有6006条查询结果,搜索用时 15 毫秒
101.
Mylène C. Q. Farias 《Journal of the Society for Information Display》2011,19(11):764-770
Abstract— In the past few years, a big effort in the scientific community has been devoted to the development of better image‐ and video‐quality metrics that correlate well with the human perception of quality. In this paper, an overview of the main ideas used in the design of objective quality metrics is given. More specifically, we briefly describe the different types of objective metrics and present a representative set of the different approaches taken by these algorithms. Finally, the challenges and recent developments in the area of image and video quality are discussed. 相似文献
102.
Lars Mönch John W. Fowler Stéphane Dauzère-Pérès Scott J. Mason Oliver Rose 《Journal of Scheduling》2011,14(6):583-599
In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process,
we identify typical scheduling problems found in semiconductor manufacturing systems. We describe batch scheduling problems,
parallel machine scheduling problems, job shop scheduling problems, scheduling problems with auxiliary resources, multiple
orders per job scheduling problems, and scheduling problems related to cluster tools. We also present important solution techniques
that are used to solve these scheduling problems by means of specific examples, and report on known implementations. Finally,
we summarize some of the challenges in scheduling semiconductor manufacturing operations. 相似文献
103.
Duc-Khanh Tran Christophe Ringeissen Silvio Ranise Hélène Kirchner 《Journal of Symbolic Computation》2010
Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories. 相似文献
104.
Véronique Souchère Laurent Millair Javier Echeverria François Bousquet Christophe Le Page Michel Etienne 《Environmental Modelling & Software》2010,25(11):1359-1370
Erosive runoff is a recurring problem and is a source of sometimes deadly muddy floods in the Pays de Caux (France). The risk results from a conjunction of natural factors and human activity. Efficient actions against runoff in agricultural watersheds are well known. However they are still difficult to implement as they require co-operation between stakeholders. Local actors thus need tools to help them understand the collective consequences of their individual decisions and help to initiate a process of negotiation between them. We decided to use a participatory approach called companion modelling (ComMod), and, in close collaboration with one of the first group of local stakeholders, to create a role-playing game (RPG) to facilitate negotiations on the future management of erosive runoff. This paper describes and discusses the development of the RPG and its use with other groups of local stakeholders within the framework of two game sessions organized by two different watershed management committees. During the joint construction step, stakeholders shared their viewpoints about the environment, agents, rules, and how to model runoff in preparation for the creation of the RPG. During the RPG sessions, two groups of eight players, including farmers, mayors and watershed advisors, were confronted with disastrous runoff in a fictive agricultural watershed. Results showed that they managed to reduce runoff by 20–50% by engaging a dialogue about grass strips, storage ponds and management of the intercrop period. However, further progress is still needed to better control runoff through the implementation of better agricultural practices because, during the RPG sessions, the watershed advisors did not encourage farmers to do so. Because of the complexity of management problems, results of jointly constructing the game and the RPG sessions showed that modelling and simulation can be a very useful way of accompanying the collective learning process. This new way of working was welcomed by the participants who expressed their interest in organizing further RPG sessions. 相似文献
105.
Roberto Sanchez Geneviève Dauphin-Tanguy Xavier Guillaud Frédéric Colas 《Simulation Modelling Practice and Theory》2010,18(9):1185-1198
This paper proposes a model of a three phase electrical inverter with a LC output filter in delta connection used in a renewable energy supply system. The concept of inverse bond graph via bicausality is used for the control law design. The control law robustness is tested by connecting passive and active (induction machine) loads. 相似文献
106.
Mauro Baluda Pietro Braione Giovanni Denaro Mauro Pezzè 《Software Quality Journal》2011,19(4):725-751
Structural code coverage criteria have been studied since the early seventies, and now they are well supported by commercial
and open-source tools and are commonly embedded in several advanced industrial processes. Most industrial applications still
refer to simple criteria, like statement and branch coverage, and consider complex criteria, like modified condition decision
coverage, only rarely and often driven by the requirements of certification agencies. The industrial value of structural criteria
is limited by the difficulty of achieving high coverage, due to both the complexity of deriving test cases that execute specific
uncovered elements and the presence of many infeasible elements in the code. In this paper, we propose a technique that both
generates test cases that execute yet uncovered branches and identifies infeasible branches that can be eliminated from the
computation of the branch coverage. In this way, we can increase branch coverage to closely approximate full coverage, thus
improving its industrial value. The algorithm combines symbolic analysis, abstraction refinement, and a novel technique named
coarsening, to execute unexplored branches, identify infeasible ones, and mitigate the state space explosion problem. In the paper,
we present the technique and illustrate its effectiveness through a set of experimental results obtained with a prototype
implementation. 相似文献
107.
We explore one aspect of the structure of a codified legal system at the national level using a new type of representation
to understand the strong or weak dependencies between the various fields of law. In Part I of this study, we analyze the graph
associated with the network in which each French legal code is a vertex and an edge is produced between two vertices when
a code cites another code at least one time. We show that this network distinguishes from many other real networks from a
high density, giving it a particular structure that we call concentrated world and that differentiates a national legal system (as considered with a resolution at the code level) from small-world graphs identified in many social networks. Our analysis then shows that a few communities (groups of highly wired vertices)
of codes covering large domains of regulation are structuring the whole system. Indeed we mainly find a central group of influent
codes, a group of codes related to social issues and a group of codes dealing with territories and natural resources. The
study of this codified legal system is also of interest in the field of the analysis of real networks. In particular we examine
the impact of the high density on the structural characteristics of the graph and on the ways communities are searched for.
Finally we provide an original visualization of this graph on an hemicyle-like plot, this representation being based on a
statistical reduction of dissimilarity measures between vertices. In Part II (a following paper) we show how the consideration
of the weights attributed to each edge in the network in proportion to the number of citations between two vertices (codes)
allows deepening the analysis of the French legal system. 相似文献
108.
In this paper, we have proposed a new feature selection method called kernel F-score feature selection (KFFS) used as pre-processing step in the classification of medical datasets. KFFS consists of two phases. In the first phase, input spaces (features) of medical datasets have been transformed to kernel space by means of Linear (Lin) or Radial Basis Function (RBF) kernel functions. By this way, the dimensions of medical datasets have increased to high dimension feature space. In the second phase, the F-score values of medical datasets with high dimensional feature space have been calculated using F-score formula. And then the mean value of calculated F-scores has been computed. If the F-score value of any feature in medical datasets is bigger than this mean value, that feature will be selected. Otherwise, that feature is removed from feature space. Thanks to KFFS method, the irrelevant or redundant features are removed from high dimensional input feature space. The cause of using kernel functions transforms from non-linearly separable medical dataset to a linearly separable feature space. In this study, we have used the heart disease dataset, SPECT (Single Photon Emission Computed Tomography) images dataset, and Escherichia coli Promoter Gene Sequence dataset taken from UCI (University California, Irvine) machine learning database to test the performance of KFFS method. As classification algorithms, Least Square Support Vector Machine (LS-SVM) and Levenberg–Marquardt Artificial Neural Network have been used. As shown in the obtained results, the proposed feature selection method called KFFS is produced very promising results compared to F-score feature selection. 相似文献
109.
Halife Kodaz Seral Özşen Ahmet Arslan Salih Güneş 《Expert systems with applications》2009,36(2):3086-3092
In this paper, we have made medical application of a new artificial immune system named the information gain based artificial immune recognition system (IG-AIRS) which minimizes the negative effects of taking into account all attributes in calculating Euclidean distance in shape–space representation which is used in many artificial immune systems. For medical data, thyroid disease data set was applied in the performance analysis of our proposed system. Our proposed system reached 95.90% classification accuracy with 10-fold CV method. This result ensured that IG-AIRS would be helpful in diagnosing thyroid function based on laboratory tests, and would open the way to various ill diagnoses support by using the recent clinical examination data, and we are actually in progress. 相似文献
110.
Tegawendé F. Bissyandé Laurent Réveillère Julia L. Lawall Gilles Muller 《Automated Software Engineering》2016,23(1):3-41
The Linux kernel does not export a stable, well-defined kernel interface, complicating the development of kernel-level services, such as device drivers and file systems. While there does exist a set of functions that are exported to external modules, this set of functions frequently changes, and the functions have implicit, ill-documented preconditions. No specific debugging support is provided. We present Diagnosys, an approach to automatically constructing a debugging interface for the Linux kernel. First, a designated kernel maintainer uses Diagnosys to identify constraints on the use of the exported functions. Based on this information, developers of kernel services can then use Diagnosys to generate a debugging interface specialized to their code. When a service including this interface is tested, it records information about potential problems. This information is preserved following a kernel crash or hang. Our experiments show that the generated debugging interface provides useful log information and incurs a low performance penalty. 相似文献