全文获取类型
收费全文 | 5735篇 |
免费 | 466篇 |
国内免费 | 408篇 |
专业分类
电工技术 | 59篇 |
技术理论 | 1篇 |
综合类 | 358篇 |
化学工业 | 551篇 |
金属工艺 | 82篇 |
机械仪表 | 412篇 |
建筑科学 | 207篇 |
矿业工程 | 61篇 |
能源动力 | 34篇 |
轻工业 | 41篇 |
水利工程 | 15篇 |
石油天然气 | 103篇 |
武器工业 | 25篇 |
无线电 | 418篇 |
一般工业技术 | 246篇 |
冶金工业 | 70篇 |
原子能技术 | 8篇 |
自动化技术 | 3918篇 |
出版年
2024年 | 14篇 |
2023年 | 76篇 |
2022年 | 167篇 |
2021年 | 206篇 |
2020年 | 151篇 |
2019年 | 121篇 |
2018年 | 112篇 |
2017年 | 96篇 |
2016年 | 186篇 |
2015年 | 171篇 |
2014年 | 281篇 |
2013年 | 270篇 |
2012年 | 294篇 |
2011年 | 361篇 |
2010年 | 287篇 |
2009年 | 343篇 |
2008年 | 418篇 |
2007年 | 449篇 |
2006年 | 385篇 |
2005年 | 315篇 |
2004年 | 313篇 |
2003年 | 294篇 |
2002年 | 251篇 |
2001年 | 193篇 |
2000年 | 178篇 |
1999年 | 175篇 |
1998年 | 101篇 |
1997年 | 68篇 |
1996年 | 51篇 |
1995年 | 55篇 |
1994年 | 43篇 |
1993年 | 57篇 |
1992年 | 38篇 |
1991年 | 19篇 |
1990年 | 10篇 |
1989年 | 16篇 |
1988年 | 6篇 |
1987年 | 7篇 |
1986年 | 5篇 |
1985年 | 12篇 |
1984年 | 2篇 |
1983年 | 4篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1975年 | 3篇 |
1960年 | 1篇 |
1956年 | 1篇 |
排序方式: 共有6609条查询结果,搜索用时 15 毫秒
1.
In this paper, we present LinkingPark, an automatic semantic annotation system for tabular data to knowledge graph matching. LinkingPark is designed as a modular framework which can handle Cell-Entity Annotation (CEA), Column-Type Annotation (CTA), and Columns-Property Annotation (CPA) altogether. It is built upon our previous SemTab 2020 system, which won the 2nd prize among 28 different teams after four rounds of evaluations. Moreover, the system is unsupervised, stand-alone, and flexible for multilingual support. Its backend offers an efficient RESTful API for programmatic access, as well as an Excel Add-in for ease of use. Users can interact with LinkingPark in near real-time, further demonstrating its efficiency. 相似文献
2.
3.
Viktoria M. S. Kjær Loukas Ieremias Dr. Viktorija Daugvilaite Dr. Michael Lückmann Prof. Thomas M. Frimurer Prof. Trond Ulven Prof. Mette M. Rosenkilde Dr. Jon Våbenø 《ChemMedChem》2021,16(17):2623-2627
The G protein-coupled receptor GPR183/EBI2, which is activated by oxysterols, is a therapeutic target for inflammatory and metabolic diseases where both antagonists and agonists are of potential interest. Using the piperazine diamide core of the known GPR183 antagonist (E)-3-(4-bromophenyl)-1-(4-(4-methoxybenzoyl)piperazin-1-yl)prop-2-en-1-one (NIBR189) as starting point, we identified and sourced 79 structurally related compounds that were commercially available. In vitro screening of this compound collection using a Ca2+ mobilization assay resulted in the identification of 10 compounds with agonist properties. To enable establishment of initial structure-activity relationship trends, these were supplemented with five in-house compounds, two of which were also shown to be GPR183 agonists. Taken together, our findings suggest that the agonist activity of this compound series is dictated by the substitution pattern of one of the two distal phenyl rings, which functions as a molecular efficacy-switch. 相似文献
4.
The Canadian landscape has typically captured a global imaginary of a pristine wild, but how might its urban designed landscapes be distinctly understood? Foregrounded by the landscape transformations accelerated by climate change, the book Innate Terrain: Canadian Landscape Architecture, edited by Professor Alissa North from the University of Toronto, highlights landscape architecture projects situated on the unique Canadian terrain. Providing further provocation on Canadian landscape architecture, Innate Terrain seeks to fill the literary gap on contemporary landscape perspectives, distinguishing Canadian landscape architecture from global practice, and particularly, its well-documented American counterpart. Landscape architecture in the Canadian context has evolved and established its own distinct identity, one imbued with national and local sensitivities. Informed by diverse environmental and cultural contexts, Canadian-designed landscapes reflect and refer to the prevailing ecosystems of Canada’s innate terrain. Contrary to the preceding International Style, landscape architecture projects in Canada have adopted the ethos of Critical Regionalism in the second half of the 20th century. Contemporary Canadian practitioners are designing landscapes that are deeply informed by their surrounding geographical context while emphasizing cultural specificity. Central to this cultural specificity, addressed by a new generation of landscape architects, is the increasing recognition of Indigenous Traditional Knowledge within the discipline. Canadian landscape architects have collaborated with First Nations, Inuit, and Métis communities, including the keepers of this knowledge, to develop land management strategies and design landscape interventions. 相似文献
5.
In the first critical assessment of knowledge economy dynamic paths in Africa and the Middle East, but for a few exceptions, we find overwhelming support for diminishing cross-country disparities in knowledge-based economy dimensions. The paper employs all the four components of the World Bank's Knowledge Economy Index (KEI): economic incentives, innovation, education, and information infrastructure. The main finding suggests that sub-Saharan African (SSA) and the Middle East and North African (MENA) countries with low levels of KE dynamics and catching-up their counterparts of higher KE levels. We provide the speeds of integration and time necessary to achieve full (100%) integration. Policy implications are also discussed. 相似文献
6.
为解决共享交通下的共乘用户群体发现效率低、准确率不高问题,依据R-树原理建立GeoOD-Tree索引,并在此基础上提出以最大化共乘率为目标的群体发现策略。首先,对原始时空轨迹数据进行特征提取与标定处理,挖掘有效出行起讫点(OD)轨迹;其次,针对用户起讫点轨迹的特征,建立GeoOD-Tree索引进行有效的存储管理;最后,给出以最大化共乘行程为目标的群体发现模型,并运用K最近邻(KNN)查询对搜索空间剪枝压缩,提高群体发现效率。采用西安市近12000辆出租车营运轨迹数据,选取动态时间规整(DTW)等典型算法与所提算法在查询效率与准确率上进行性能对比分析。与DTW算法相比,所提算法的准确率提高了10.12%,查询效率提高了约15倍。实验结果表明提出的群体发现策略能有效提高共乘用户群体发现的准确率和效率,可有效提升共乘出行方式的出行率。 相似文献
7.
Though modeling and verifying Multi-Agent Systems (MASs) have long been under study, there are still challenges when many different aspects need to be considered simultaneously. In fact, various frameworks have been carried out for modeling and verifying MASs with respect to knowledge and social commitments independently. However, considering them under the same framework still needs further investigation, particularly from the verification perspective. In this article, we present a new technique for model checking the logic of knowledge and commitments (CTLKC+). The proposed technique is fully-automatic and reduction-based in which we transform the problem of model checking CTLKC+ into the problem of model checking an existing logic of action called ARCTL. Concretely, we construct a set of transformation rules to formally reduce the CTLKC+ model into an ARCTL model and CTLKC+ formulae into ARCTL formulae to get benefit from the extended version of NuSMV symbolic model checker of ARCTL. Compared to a recent approach that reduces the problem of model checking CTLKC+ to another logic of action called GCTL1, our technique has better scalability and efficiency. We also analyze the complexity of the proposed model checking technique. The results of this analysis reveal that the complexity of our reduction-based procedure is PSPACE-complete for local concurrent programs with respect to the size of these programs and the length of the formula being checked. From the time perspective, we prove that the complexity of the proposed approach is P-complete with regard to the size of the model and length of the formula, which makes it efficient. Finally, we implement our model checking approach on top of extended NuSMV and report verification results for the verification of the NetBill protocol, taken from business domain, against some desirable properties. The obtained results show the effectiveness of our model checking approach when the system scales up. 相似文献
9.
10.
Sme concepts used in knowledge base maintenace,such as sequence,new law,user‘s rejection and reconstructions of a knowledge base,are first introduced,and then a framework for extended logic programming(ELP)is given,where an extended logic program is equivalent to a knowledge base.A transition system called R-calculus for ELP is provided.For a given knowledge base and a user‘s rejection,the R-calculus for ELP will deduce best revisions of the base.The soundness and the completeness of the R-calculus for ELP are proved,and the R-calculus for ELP is implemented in Prolog.In addition,the research is compared with other relevant work. 相似文献