首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6088篇
  免费   561篇
  国内免费   3篇
电工技术   24篇
综合类   1篇
化学工业   2101篇
金属工艺   52篇
机械仪表   119篇
建筑科学   215篇
矿业工程   10篇
能源动力   171篇
轻工业   1914篇
水利工程   51篇
石油天然气   40篇
无线电   259篇
一般工业技术   783篇
冶金工业   198篇
原子能技术   10篇
自动化技术   704篇
  2024年   16篇
  2023年   76篇
  2022年   371篇
  2021年   413篇
  2020年   224篇
  2019年   266篇
  2018年   260篇
  2017年   259篇
  2016年   300篇
  2015年   224篇
  2014年   313篇
  2013年   486篇
  2012年   448篇
  2011年   496篇
  2010年   359篇
  2009年   366篇
  2008年   323篇
  2007年   264篇
  2006年   214篇
  2005年   165篇
  2004年   145篇
  2003年   110篇
  2002年   95篇
  2001年   55篇
  2000年   54篇
  1999年   56篇
  1998年   49篇
  1997年   35篇
  1996年   31篇
  1995年   22篇
  1994年   18篇
  1993年   17篇
  1992年   12篇
  1991年   8篇
  1990年   5篇
  1989年   26篇
  1988年   8篇
  1987年   12篇
  1986年   6篇
  1985年   8篇
  1984年   8篇
  1983年   3篇
  1982年   4篇
  1981年   2篇
  1980年   5篇
  1978年   5篇
  1977年   2篇
  1976年   5篇
  1973年   1篇
  1968年   1篇
排序方式: 共有6652条查询结果,搜索用时 15 毫秒
101.
102.
Machine Learning - Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence...  相似文献   
103.
There has been a growing interest in applying human computation – particularly crowdsourcing techniques – to assist in the solution of multimedia, image processing, and computer vision problems which are still too difficult to solve using fully automatic algorithms, and yet relatively easy for humans. In this paper we focus on a specific problem – object segmentation within color images – and compare different solutions which combine color image segmentation algorithms with human efforts, either in the form of an explicit interactive segmentation task or through an implicit collection of valuable human traces with a game. We use Click’n’Cut, a friendly, web-based, interactive segmentation tool that allows segmentation tasks to be assigned to many users, and Ask’nSeek, a game with a purpose designed for object detection and segmentation. The two main contributions of this paper are: (i) We use the results of Click’n’Cut campaigns with different groups of users to examine and quantify the crowdsourcing loss incurred when an interactive segmentation task is assigned to paid crowd-workers, comparing their results to the ones obtained when computer vision experts are asked to perform the same tasks. (ii) Since interactive segmentation tasks are inherently tedious and prone to fatigue, we compare the quality of the results obtained with Click’n’Cut with the ones obtained using a (fun, interactive, and potentially less tedious) game designed for the same purpose. We call this contribution the assessment of the gamification loss, since it refers to how much quality of segmentation results may be lost when we switch to a game-based approach to the same task. We demonstrate that the crowdsourcing loss is significant when using all the data points from workers, but decreases substantially (and becomes comparable to the quality of expert users performing similar tasks) after performing a modest amount of data analysis and filtering out of users whose data are clearly not useful. We also show that – on the other hand – the gamification loss is significantly more severe: the quality of the results drops roughly by half when switching from a focused (yet tedious) task to a more fun and relaxed game environment.  相似文献   
104.
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.  相似文献   
105.
This work addresses the challenge of creating virtual agents that are able to portray culturally appropriate behavior when interacting with other agents or humans. Because culture influences how people perceive their social reality it is important to have agent models that explicitly consider social elements, such as existing relational factors. We addressed this necessity by integrating culture into a novel model for simulating human social behavior. With this model, we operationalized a particular dimension of culture—individualism versus collectivism—within the context of an interactive narrative scenario that is part of an agent-based tool for intercultural training. Using this scenario we conducted a cross-cultural study in which participants from a collectivistic country (Portugal) were compared with participants from an individualistic country (the Netherlands) in the way they perceived and interacted with agents whose behavior was either individualistic or collectivistic, according to the configuration of the proposed model. In the obtained results, Portuguese subjects rated the collectivistic agents more positively than the Dutch but both countries had a similarly positive opinion about the individualistic agents. This experiment sheds new light on how people from different countries differ when assessing the social appropriateness of virtual agents, while also raising new research questions on this matter.  相似文献   
106.
Clustering algorithms, a fundamental base for data mining procedures and learning techniques, suffer from the lack of efficient methods for determining the optimal number of clusters to be found in an arbitrary dataset. The few methods existing in the literature always use some sort of evolutionary algorithm having a cluster validation index as its objective function. In this article, a new evolutionary algorithm, based on a hybrid model of global and local heuristic search, is proposed for the same task, and some experimentation is done with different datasets and indexes. Due to its design, independent of any clustering procedure, it is applicable to virtually any clustering method like the widely used \(k\)-means algorithm. Moreover, the use of non-parametric statistical tests over the experimental results, clearly show the proposed algorithm to be more efficient than other evolutionary algorithms currently used for the same task.  相似文献   
107.
108.
Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships.  相似文献   
109.
Hydraulic conductivity of granular filter media and its evolution over time is a key design parameter for stormwater filtration and infiltration systems that are now widely used in management of polluted urban runoff. In fact, clogging of filter media is recognised as the main limiting factor of these stormwater treatment systems. This paper focuses on the effect of stormwater characteristics on the clogging of stormwater filters. Effect of five different operational regimes has been tested in this study of sediment concentration; pollutant concentrations; stormwater sediment size; loading rate and stormwater loading/dosing regime and compared with the Base case. For each operational condition, five column replicates were tested. Results suggest that sediment concentration in stormwater is a significant parameter affecting hydraulic and treatment performance, eventually affecting longevity of these stormwater treatment systems. Further, the size of sediments (and their relation to the size of filter media grains) in stormwater was found to be an important parameter to be considered in design of coarse filters with high infiltration rates that are used for stormwater treatment. As expected, the addition of metals and nutrients had limited or no contribution to changes in hydraulic or sediment removal performance of the studied stormwater filters. Whilst loading rate was found to be an important parameter affecting the hydraulic and treatment performance of these systems, any variation in the stormwater loading regime had a limited effect on their performance. This study therefore develops an understanding of the effect of catchment characteristics on design of filters and hence their longevity and maintenance needs.  相似文献   
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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