全文获取类型
收费全文 | 2826篇 |
免费 | 232篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 25篇 |
综合类 | 29篇 |
化学工业 | 1046篇 |
金属工艺 | 37篇 |
机械仪表 | 49篇 |
建筑科学 | 122篇 |
矿业工程 | 7篇 |
能源动力 | 65篇 |
轻工业 | 441篇 |
水利工程 | 45篇 |
石油天然气 | 5篇 |
无线电 | 134篇 |
一般工业技术 | 441篇 |
冶金工业 | 224篇 |
原子能技术 | 12篇 |
自动化技术 | 380篇 |
出版年
2024年 | 16篇 |
2023年 | 31篇 |
2022年 | 180篇 |
2021年 | 187篇 |
2020年 | 107篇 |
2019年 | 103篇 |
2018年 | 102篇 |
2017年 | 111篇 |
2016年 | 125篇 |
2015年 | 103篇 |
2014年 | 138篇 |
2013年 | 201篇 |
2012年 | 157篇 |
2011年 | 237篇 |
2010年 | 140篇 |
2009年 | 145篇 |
2008年 | 151篇 |
2007年 | 121篇 |
2006年 | 83篇 |
2005年 | 58篇 |
2004年 | 60篇 |
2003年 | 59篇 |
2002年 | 50篇 |
2001年 | 31篇 |
2000年 | 36篇 |
1999年 | 39篇 |
1998年 | 59篇 |
1997年 | 33篇 |
1996年 | 22篇 |
1995年 | 29篇 |
1994年 | 21篇 |
1993年 | 19篇 |
1992年 | 12篇 |
1991年 | 10篇 |
1990年 | 12篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 6篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1975年 | 4篇 |
1974年 | 2篇 |
1965年 | 4篇 |
排序方式: 共有3062条查询结果,搜索用时 15 毫秒
61.
Claudia Archetti Dominique Feillet Alain Hertz M. Grazia Speranza 《Computers & Operations Research》2010,37(11):1860-1869
A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A travel time is associated with each edge of the graph. A fleet of capacitated vehicles is given to serve the profitable edges. A maximum duration of the route of each vehicle is also given. The profit of an edge can be collected by one vehicle only that also serves the demand of the edge. The objective of this problem, which is called the undirected capacitated arc routing problem with profits (UCARPP), is to find a set of routes that satisfy the constraints on the duration of the route and on the capacity of the vehicle and maximize the total collected profit. We propose a branch-and-price algorithm and several heuristics. We can solve exactly instances with up to 97 profitable edges. The best heuristics find the optimal solution on most of instances where it is available. 相似文献
62.
Øyvind Hauge Claudia Ayala Reidar Conradi 《Information and Software Technology》2010,52(11):1133-1154
ContextOpen source software (OSS) is changing the way organizations develop, acquire, use, and commercialize software.ObjectiveThis paper seeks to identify how organizations adopt OSS, classify the literature according to these ways of adopting OSS, and with a focus on software development evaluate the research on adoption of OSS in organizations.MethodBased on the systematic literature review method we reviewed publications from 24 journals and seven conference and workshop proceedings, published between 1998 and 2008. From a population of 24,289 papers, we identified 112 papers that provide empirical evidence on how organizations actually adopt OSS.ResultsWe show that adopting OSS involves more than simply using OSS products. We moreover provide a classification framework consisting of six distinctly different ways in which organizations adopt OSS. This framework is used to illustrate some of the opportunities and challenges organizations meet when approaching OSS, to show that OSS can be adopted successfully in different ways, and to organize and review existing research. We find that existing research on OSS adoption does not sufficiently describe the context of the organizations studied, and it fails to benefit fully from related research fields. While existing research covers a large number of topics, it contains very few closely related studies. To aid this situation, we offer directions for future research.ConclusionThe implications of our findings are twofold. On the one hand, practitioners should embrace the many opportunities OSS offers, but consciously evaluate the consequences of adopting it in their own context. They may use our framework and the success stories provided by the literature in their own evaluations. On the other hand, researchers should align their work, and perform more empirical research on topics that are important to organizations. Our framework may be used to position this research and to describe the context of the organization they are studying. 相似文献
63.
Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, we propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. We study some of the fundamental properties of nSPARQL and nested regular expressions concerning expressiveness and complexity of evaluation. Regarding expressiveness, we show that nSPARQL is expressive enough to answer queries considering the semantics of the RDFS vocabulary by directly traversing the input graph. We also show that nesting is necessary in nSPARQL to obtain this last result, and we study the expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation, we prove that given an RDF graph G and a nested regular expression E, this problem can be solved in time O(|G||E|). 相似文献
64.
Claudia Archetti Luca Bertazzi Giuseppe Paletta M. Grazia Speranza 《Computers & Operations Research》2011
We consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the inventory. The production policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The overall cost is composed by fixed and variable production costs at the facility, inventory costs at both facility and retailers and routing costs. We study two different types of replenishment policies. The well-known order-up to level (OU) policy, where the quantity shipped to each retailer is such that the level of its inventory reaches the maximum level, and the maximum level (ML) policy, where the quantity shipped to each retailer is such that the inventory is not greater than the maximum level. We first show that when the transportation is outsourced, the problem with OU policy is NP-hard, whereas there exists a class of instances where the problem with ML policy can be solved in polynomial time. We also show the worst-case performance of the OU policy with respect to the more flexible ML policy. Then, we focus on the ML policy and the design of a hybrid heuristic. We also present an exact algorithm for the solution of the problem with one vehicle. Results of computational experiments carried out on small size instances show that the heuristic can produce high quality solutions in a very short amount of time. Results obtained on a large set of randomly generated problem instances are also shown, aimed at comparing the two policies. 相似文献
65.
Beatriz C. BarjaAuthor Vitae Sara E. BariAuthor VitaeM. Claudia MarchiAuthor Vitae Fabricio L. IglesiasAuthor VitaeMilagros BernardiAuthor Vitae 《Sensors and actuators. B, Chemical》2011,158(1):214-222
In this work we used the sol-gel technique to develop luminescent Eu(III) transparent films deposited on glass slides to build for sensor devices capable of monitoring transition metal ions in aqueous solutions. The films were obtained from a bis(trialkoxysilyl) organic precursor synthesized from the amide of the 2,6-pyridinedicarboxylic acid (DPA) with aminopropyltriethoxysilane (APTES) in the presence or absence of cetyl trimethyl ammonium bromide (CTAB) surfactant as templating agent and triethylethoxysilane (TEOS) as crosslinker. These sensor devices were used to perform in situ quenching experiments by Cu(II), Fe(III), Co(II) and Ni(II) ions. The results indicate that the templated films allow the detection and quantification of these metals down to ppb levels by means of the values of the Stern-Volmer constants. In particular, it was shown that Cu(II) acts as an extremely efficient quencher (KSV = 3.5 × 105 M−1) when compared with the results obtained for the other metals, opening the possibility to use these devices as potential Cu(II) sensors for actual applications in aqueous media. 相似文献
66.
67.
Ana Serrano Felix Heide Diego Gutierrez Gordon Wetzstein Belen Masia 《Computer Graphics Forum》2016,35(2):153-163
Current HDR acquisition techniques are based on either (i) fusing multibracketed, low dynamic range (LDR) images, (ii) modifying existing hardware and capturing different exposures simultaneously with multiple sensors, or (iii) reconstructing a single image with spatially‐varying pixel exposures. In this paper, we propose a novel algorithm to recover high‐quality HDRI images from a single, coded exposure. The proposed reconstruction method builds on recently‐introduced ideas of convolutional sparse coding (CSC); this paper demonstrates how to make CSC practical for HDR imaging. We demonstrate that the proposed algorithm achieves higher‐quality reconstructions than alternative methods, we evaluate optical coding schemes, analyze algorithmic parameters, and build a prototype coded HDR camera that demonstrates the utility of convolutional sparse HDRI coding with a custom hardware platform. 相似文献
68.
Alejandro Rago Claudia Marcos J. Andres Diaz-Pace 《Automated Software Engineering》2016,23(2):219-252
Textual requirements are very common in software projects. However, this format of requirements often keeps relevant concerns (e.g., performance, synchronization, data access, etc.) from the analyst’s view because their semantics are implicit in the text. Thus, analysts must carefully review requirements documents in order to identify key concerns and their effects. Concern mining tools based on NLP techniques can help in this activity. Nonetheless, existing tools cannot always detect all the crosscutting effects of a given concern on different requirements sections, as this detection requires a semantic analysis of the text. In this work, we describe an automated tool called REAssistant that supports the extraction of semantic information from textual use cases in order to reveal latent crosscutting concerns. To enable the analysis of use cases, we apply a tandem of advanced NLP techniques (e.g, dependency parsing, semantic role labeling, and domain actions) built on the UIMA framework, which generates different annotations for the use cases. Then, REAssistant allows analysts to query these annotations via concern-specific rules in order to identify all the effects of a given concern. The REAssistant tool has been evaluated with several case-studies, showing good results when compared to a manual identification of concerns and a third-party tool. In particular, the tool achieved a remarkable recall regarding the detection of crosscutting concern effects. 相似文献
69.
70.
Jorge Lopez-Moreno Jorge JimenezSunil Hadap Ken AnjyoErik Reinhard Diego Gutierrez 《Computers & Graphics》2011,35(1):99-111
Recent works in image editing are opening up new possibilities to manipulate and enhance input images. Within this context, we leverage well-known characteristics of human perception along with a simple depth approximation algorithm to generate non-photorealistic renditions that would be difficult to achieve with existing methods. Once a perceptually plausible depth map is obtained from the input image, we show how simple algorithms yield powerful new depictions of such an image. Additionally, we show how artistic manipulation of depth maps can be used to create novel non-photorealistic versions, for which we provide the user with an intuitive interface. Our real-time implementation on graphics hardware allows the user to efficiently explore artistic possibilities for each image. We show results produced with six different styles proving the versatility of our approach, and validate our assumptions and simplifications by means of a user study. 相似文献