首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5249篇
  免费   502篇
  国内免费   3篇
电工技术   15篇
综合类   1篇
化学工业   1893篇
金属工艺   37篇
机械仪表   104篇
建筑科学   199篇
矿业工程   10篇
能源动力   137篇
轻工业   1756篇
水利工程   48篇
石油天然气   37篇
无线电   180篇
一般工业技术   644篇
冶金工业   127篇
原子能技术   7篇
自动化技术   559篇
  2024年   17篇
  2023年   90篇
  2022年   346篇
  2021年   391篇
  2020年   207篇
  2019年   231篇
  2018年   228篇
  2017年   233篇
  2016年   265篇
  2015年   195篇
  2014年   284篇
  2013年   424篇
  2012年   398篇
  2011年   426篇
  2010年   314篇
  2009年   312篇
  2008年   265篇
  2007年   237篇
  2006年   169篇
  2005年   130篇
  2004年   111篇
  2003年   84篇
  2002年   76篇
  2001年   39篇
  2000年   45篇
  1999年   48篇
  1998年   28篇
  1997年   22篇
  1996年   19篇
  1995年   11篇
  1994年   13篇
  1993年   12篇
  1992年   9篇
  1991年   5篇
  1990年   3篇
  1989年   17篇
  1988年   7篇
  1987年   11篇
  1986年   4篇
  1985年   6篇
  1984年   6篇
  1983年   2篇
  1982年   4篇
  1981年   1篇
  1980年   3篇
  1978年   4篇
  1977年   1篇
  1976年   1篇
排序方式: 共有5754条查询结果,搜索用时 15 毫秒
91.
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G=(V,E)G=(V,E) with node set V={0,1,…,n}V={0,1,,n} and edge set EE, two integer weights, a cost cece and a delay wewe associated with each edge ee of EE, and a natural (time limit) number HH, we wish to find a spanning tree TT of the graph with minimum total cost and such that the unique path from a specified root node, node 0, to any other node has total delay not greater than HH. This problem generalizes the well known hop-constrained spanning tree problem and arises in the design of centralized networks with quality of service constraints and also in package shipment with service guarantee constraints. We present three theoretically equivalent modeling approaches, a column generation scheme, a Lagrangian relaxation combined with subgradient optimization procedure, both based on a path formulation of the problem, and a shortest path (compact) reformulation of the problem which views the underlying subproblem as defined in a layered extended graph. We present results for complete graph instances with up to 40 nodes. Our results indicate that the layered graph path reformulation model is still quite good when the arc weights are reasonably small. Lagrangian relaxation combined with subgradient optimization procedure appears to work much better than column generation and seems to be a quite reasonable approach to the problem for large weight, and even small weight, instances.  相似文献   
92.
93.
Redox and acid–base properties of thionine immobilized in crosslinked chitosan films are analyzed. The experimental conditions for the preparation of the films are described. Results obtained with cyclic voltammetry, spectroelectrochemistry and spectrophotometry indicate that the immobilized dye retains the redox and acid–base activity of free thionine. An acid dissociation constant (Ka) for the immobilized dye of Ka = 2.7 × 10−11 was obtained.

Due to the stable and reversible pH dependent optical signal of the studied film, this membrane can be used as a building component of an optical pH sensor.  相似文献   

94.
Recommender systems arose with the goal of helping users search in overloaded information domains (like e-commerce, e-learning or Digital TV). These tools automatically select items (commercial products, educational courses, TV programs, etc.) that may be appealing to each user taking into account his/her personal preferences. The personalization strategies used to compare these preferences with the available items suffer from well-known deficiencies that reduce the quality of the recommendations. Most of the limitations arise from using syntactic matching techniques because they miss a lot of useful knowledge during the recommendation process. In this paper, we propose a personalization strategy that overcomes these drawbacks by applying inference techniques borrowed from the Semantic Web. Our approach reasons about the semantics of items and user preferences to discover complex associations between them. These semantic associations provide additional knowledge about the user preferences, and permit the recommender system to compare them with the available items in a more effective way. The proposed strategy is flexible enough to be applied in many recommender systems, regardless of their application domain. Here, we illustrate its use in AVATAR, a tool that selects appealing audiovisual programs from among the myriad available in Digital TV.  相似文献   
95.
In today's highly interconnected, uncertain and dynamic business environment, team boundary spanning has become an important determinant of the performance of new product development (NPD) projects. Despite the positive evidence supporting the use of boundary spanning activities by NPD teams, little is still known about how boundary spanning teams become high-performance teams. The current study advances research on this subject by examining the mediating effect of team potency on the relationship between team boundary spanning and new product performance, as well as the moderating effects of team size and functional diversity on the relationship between team boundary spanning and team potency. Data from a time-lagged survey study of 140 NPD projects found that team boundary spanning can promote team potency that, in turn, results in greater new product quality and new product creativity. The positive effect of team boundary spanning on team potency was found to be more pronounced for NPD teams of medium size and high levels of functional diversity.  相似文献   
96.
Magnetic Resonance Materials in Physics, Biology and Medicine - Histogram-based metrics extracted from diffusion-tensor imaging (DTI) have been suggested as potential biomarkers for cerebral small...  相似文献   
97.
Machine Learning - Machine Learning studies often involve a series of computational experiments in which the predictive performance of multiple models are compared across one or more datasets. The...  相似文献   
98.
In a context of cost reduction, in situ filament winding of thermoplastic matrix composites becomes an appealing process. As residual stresses could considerably affect the produced part, models were proposed to predict process-induced residual stresses. After developing a validated thermal model of the process, mainly three different aspects are here addressed: the continuous bonding occurring during the process, the effect of the processed layer on the structure, and the effect of the curvature of the mandrel. While stresses coming from the continuous bonding appeared to be negligible, consequent levels of stresses can be achieved due to an iterative compression of the structure by the tow (supposed to be under tension). The mandrel properties and the tow tension profile followed during winding are essential parameters that might induce several different stress states. A comparison between measured and computed end-to-end openings of split rings illustrates the accuracy of the proposed models.  相似文献   
99.
100.
At present, many countries allow citizens or entities to interact with the government outside the telematic environment through a legal representative who is granted powers of representation. However, if the interaction takes place through the Internet, only primitive mechanisms of representation are available, and these are mainly based on non-dynamic offline processes that do not enable quick and easy identity delegation. This paper proposes a system of dynamic delegation of identity between two generic entities that can solve the problem of delegated access to the telematic services provided by public authorities. The solution herein is based on the generation of a delegation token created from a proxy certificate that allows the delegating entity to delegate identity to another on the basis of a subset of its attributes as delegator, while also establishing in the delegation token itself restrictions on the services accessible to the delegated entity and the validity period of delegation. Further, the paper presents the mechanisms needed to either revoke a delegation token or to check whether a delegation token has been revoked. Implications for theory and practice and suggestions for future research are discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号