全文获取类型
收费全文 | 52971篇 |
免费 | 3006篇 |
国内免费 | 58篇 |
专业分类
电工技术 | 447篇 |
综合类 | 40篇 |
化学工业 | 10927篇 |
金属工艺 | 989篇 |
机械仪表 | 1035篇 |
建筑科学 | 1706篇 |
矿业工程 | 89篇 |
能源动力 | 1307篇 |
轻工业 | 7309篇 |
水利工程 | 505篇 |
石油天然气 | 208篇 |
武器工业 | 4篇 |
无线电 | 3073篇 |
一般工业技术 | 9050篇 |
冶金工业 | 11631篇 |
原子能技术 | 317篇 |
自动化技术 | 7398篇 |
出版年
2023年 | 446篇 |
2022年 | 811篇 |
2021年 | 1397篇 |
2020年 | 987篇 |
2019年 | 1007篇 |
2018年 | 1923篇 |
2017年 | 1890篇 |
2016年 | 2013篇 |
2015年 | 1442篇 |
2014年 | 1914篇 |
2013年 | 3477篇 |
2012年 | 3064篇 |
2011年 | 3150篇 |
2010年 | 2375篇 |
2009年 | 2230篇 |
2008年 | 2393篇 |
2007年 | 2073篇 |
2006年 | 1652篇 |
2005年 | 1372篇 |
2004年 | 1252篇 |
2003年 | 1128篇 |
2002年 | 1011篇 |
2001年 | 664篇 |
2000年 | 649篇 |
1999年 | 808篇 |
1998年 | 3816篇 |
1997年 | 2321篇 |
1996年 | 1542篇 |
1995年 | 910篇 |
1994年 | 770篇 |
1993年 | 752篇 |
1992年 | 271篇 |
1991年 | 285篇 |
1990年 | 280篇 |
1989年 | 258篇 |
1988年 | 228篇 |
1987年 | 205篇 |
1986年 | 225篇 |
1985年 | 254篇 |
1984年 | 220篇 |
1983年 | 167篇 |
1982年 | 198篇 |
1981年 | 211篇 |
1980年 | 183篇 |
1979年 | 141篇 |
1978年 | 132篇 |
1977年 | 236篇 |
1976年 | 471篇 |
1975年 | 97篇 |
1973年 | 98篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
Abdoul Bitar Stéphane Dauzère-Pérès Claude Yugma Renaud Roussel 《Journal of Scheduling》2016,19(4):367-376
In this paper, we propose a metaheuristic for solving an original scheduling problem with auxiliary resources in a photolithography workshop of a semiconductor plant. The photolithography workshop is often a bottleneck, and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). After stating the problem and giving some properties on the solution space, we show how these properties help us to efficiently solve the problem with the proposed memetic algorithm, which has been implemented and tested on large generated instances. Numerical experiments show that good solutions are obtained within a reasonable computational time. 相似文献
942.
Kaouthar?DeghdakEmail authorView authors OrcID profile Vincent?T’kindt Jean-Louis?Bouquard 《Journal of Scheduling》2016,19(4):467-478
In this paper, we consider a large-scale evacuation problem after a major disaster. The evacuation is assumed to occur by means of a fleet of buses, thus leading to scheduling the evacuation operations by buses [(bus evacuation problem (BEP)]. We propose time-indexed formulations as well as heuristic algorithms such as greedy algorithms and a matheuristic. This matheuristic uses the former formulation to improve the best solution obtained by the greedy heuristics. In computational experiments, we analyze and evaluate the efficiency of the proposed solution algorithms. 相似文献
943.
Audio fingerprinting allows us to label an unidentified music fragment within a previously generated database. The use of spectral landmarks aims to obtain a robustness that lets a certain level of noise be present in the audio query. This group of audio identification algorithms holds several configuration parameters whose values are usually chosen based upon the researcher’s knowledge, previous published experimentation or just trial and error methods. In this paper we describe the whole optimisation process of a Landmark-based Music Recognition System using genetic algorithms. We define the actual structure of the algorithm as a chromosome by transforming its high relevant parameters into various genes and building up an appropriate fitness evaluation method. The optimised output parameters are used to set up a complete system that is compared with a non-optimised one by designing an unbiased evaluation model. 相似文献
944.
Wei Wu Foutse Khomh Bram Adams Yann-Gaël Guéhéneuc Giuliano Antoniol 《Empirical Software Engineering》2016,21(6):2366-2412
Frameworks are widely used in modern software development to reduce development costs. They are accessed through their Application Programming Interfaces (APIs), which specify the contracts with client programs. When frameworks evolve, API backward-compatibility cannot always be guaranteed and client programs must upgrade to use the new releases. Because framework upgrades are not cost-free, observing API changes and usages together at fine-grained levels is necessary to help developers understand, assess, and forecast the cost of each framework upgrade. Whereas previous work studied API changes in frameworks and API usages in client programs separately, we analyse and classify API changes and usages together in 22 framework releases from the Apache and Eclipse ecosystems and their client programs. We find that (1) missing classes and methods happen more often in frameworks and affect client programs more often than the other API change types do, (2) missing interfaces occur rarely in frameworks but affect client programs often, (3) framework APIs are used on average in 35 % of client classes and interfaces, (4) most of such usages could be encapsulated locally and reduced in number, and (5) about 11 % of APIs usages could cause ripple effects in client programs when these APIs change. Based on these findings, we provide suggestions for developers and researchers to reduce the impact of API evolution through language mechanisms and design strategies. 相似文献
945.
José Hernández-Orallo Cèsar Ferri Nicolas Lachiche Adolfo Martínez-Usó M. José Ramírez-Quintana 《Data mining and knowledge discovery》2016,30(4):848-890
Some supervised tasks are presented with a numerical output but decisions have to be made in a discrete, binarised, way, according to a particular cutoff. This binarised regression task is a very common situation that requires its own analysis, different from regression and classification—and ordinal regression. We first investigate the application cases in terms of the information about the distribution and range of the cutoffs and distinguish six possible scenarios, some of which are more common than others. Next, we study two basic approaches: the retraining approach, which discretises the training set whenever the cutoff is available and learns a new classifier from it, and the reframing approach, which learns a regression model and sets the cutoff when this is available during deployment. In order to assess the binarised regression task, we introduce context plots featuring error against cutoff. Two special cases are of interest, the \( UCE \) and \( OCE \) curves, showing that the area under the former is the mean absolute error and the latter is a new metric that is in between a ranking measure and a residual-based measure. A comprehensive evaluation of the retraining and reframing approaches is performed using a repository of binarised regression problems created on purpose, concluding that no method is clearly better than the other, except when the size of the training data is small. 相似文献
946.
Hesam Sagha Feipeng Li Ehsan Variani José del R. Millán Ricardo Chavarriaga Björn Schuller 《International Journal of Speech Technology》2016,19(4):669-675
Multi-stream automatic speech recognition (MS-ASR) has been confirmed to boost the recognition performance in noisy conditions. In this system, the generation and the fusion of the streams are the essential parts and need to be designed in such a way to reduce the effect of noise on the final decision. This paper shows how to improve the performance of the MS-ASR by targeting two questions; (1) How many streams are to be combined, and (2) how to combine them. First, we propose a novel approach based on stream reliability to select the number of streams to be fused. Second, a fusion method based on Parallel Hidden Markov Models is introduced. Applying the method on two datasets (TIMIT and RATS) with different noises, we show an improvement of MS-ASR. 相似文献
947.
Luis G. Nardin Giulia Andrighetto Rosaria Conte Áron Székely David Anzola Corinna Elsenbroich Ulf Lotzmann Martin Neumann Valentina Punzo Klaus G. Troitzsch 《Autonomous Agents and Multi-Agent Systems》2016,30(6):1117-1147
Protection racketeering groups are powerful, deeply entrenched in multiple societies across the globe, and they harm the societies and economies in which they operate in multiple ways. These reasons make their dynamics important to understand and an objective of both scientific and application-oriented interest. Legal and social norm-based approaches arguably play significant roles in influencing protection racket dynamics. We propose an agent-based simulation model, the Palermo Scenario, to enrich our understanding of these influences and to test the effect of different policies on protection racket dynamics. Our model integrates the legal and the social norm-based approaches and uses a complex normative agent architecture that enables the analysis of both agents’ behaviours and mental normative representations driving behaviour. We demonstrate the usefulness of the model and the benefits of using this complex normative architecture through a case study of the Sicilian Mafia. 相似文献
948.
Multi-agent technologies have been widely employed for the development of web-based systems, including web-based e-markets, web-based grid computing, e-governments and service-oriented software systems. In these service-oriented systems, service provider agents and service consumer agents are autonomous and rational entities, which can enter and leave the environments freely. For simplicity, we use terms ‘provider’ and ‘consumer’ to represent this two types of agents. How to select the most suitable service providers according to a service request from a consumer in such an open environment is a very challenging issue. In this paper, we propose an innovative trust model, called the GTrust model, for service group selection in general service-oriented environments. In the GTrust model, the trust evaluation for a service group is based on the functionality coverage of the group, the dependency relationships among individual services in the group, the ratings of individual services on the attributes of the service request and a similarity measurement of the extent to which reference reports can reflect the service request in terms of the priority distribution of attributes. The experimental results and analysis demonstrate the good performance of the GTrust model on the service group selection in service-oriented environments. 相似文献
949.
Mar Arenas-Parra Amelia Bilbao-Terol Mariano Jiménez 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2016,20(6):2341-2352
This paper proposes a pragmatic model for multi-objective decision-making processes involving clusters of objectives which have a decisional meaning for the decision maker (DM). We provide the DMs with a comfortable tool that allows them to express their preferences both by comparing criteria of the same cluster and via the comparison between the different clusters. In standard goal programming the importance of the goals is modeled by the introduction of preferential weights or/and the incorporation of pre-emptive priorities. However, in many cases the DM is not able to establish a precise preference structure. Even in the case of precise weights the solution does not match necessarily the relative weights or, in the case of precise pre-emptive priority, the result could be very restrictive. In order to overcome these drawbacks, in this paper the normalized unwanted deviations are interpreted in terms of achievement degrees of the goals and fuzzy relations are used to model the relative importance of the goals. Thus, we show how several methodologies from the fuzzy goal programming literature can be tailored for solving standard GP problems. We apply this new modeling to problems where there is a “natural” clustering between goals of the same class. We address this situation by solving two phases; in the first one each class is handled separately taking into account the hierarchy of their goals and, in the second phase, we integrate the results of the first phase and the imprecise hierarchy of the different classes. We formulate a new goal programming model called as sequential goal programming with fuzzy hierarchy model. Because many real situations involve decision making in this environment, our proposal can be a useful tool of broad application. A numerical example illustrates the methodology. 相似文献
950.
Competence management in knowledge intensive organizations using consensual knowledge and ontologies
Chris Kimble José Braga de Vasconcelos Álvaro Rocha 《Information Systems Frontiers》2016,18(6):1119-1130
This article describes an architecture suitable for use in a competence management system for knowledge intensive organizations (KIOs). The underlying motivation for this work is to explore the practical problems of the use of codified knowledge in knowledge management systems (KMS) in KIOs. We explore some of the key issues associated with the use of tacit and codified knowledge in KMS, and describe an architecture based on an ontology-driven framework derived from collective and consensual knowledge that acts as a structure for a formal knowledge base. We describe, in outline, a prototype competence management system based on this architecture designed to support the management of competencies in a structured way. We conclude with some observations about our approach to the representation of knowledge in a KMS and its potential value to KIOs. 相似文献