首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   363篇
  免费   14篇
  国内免费   1篇
电工技术   7篇
化学工业   59篇
金属工艺   8篇
机械仪表   8篇
建筑科学   18篇
矿业工程   2篇
能源动力   16篇
轻工业   44篇
石油天然气   1篇
无线电   40篇
一般工业技术   58篇
冶金工业   36篇
原子能技术   1篇
自动化技术   80篇
  2024年   1篇
  2023年   3篇
  2022年   9篇
  2021年   10篇
  2020年   4篇
  2019年   5篇
  2018年   10篇
  2017年   5篇
  2016年   10篇
  2015年   5篇
  2014年   15篇
  2013年   27篇
  2012年   20篇
  2011年   20篇
  2010年   26篇
  2009年   16篇
  2008年   21篇
  2007年   17篇
  2006年   18篇
  2005年   12篇
  2004年   4篇
  2003年   11篇
  2002年   10篇
  2001年   8篇
  2000年   11篇
  1999年   10篇
  1998年   20篇
  1997年   7篇
  1996年   11篇
  1995年   7篇
  1994年   6篇
  1993年   6篇
  1991年   2篇
  1990年   1篇
  1988年   1篇
  1987年   1篇
  1985年   2篇
  1980年   2篇
  1977年   1篇
  1976年   2篇
  1971年   1篇
排序方式: 共有378条查询结果,搜索用时 46 毫秒
1.
The paper reports the results of on-site regeneration catalytic bed of the natural gas reformer in a 5 kW PEM fuel cell system. The Ni catalyst previously poisoned by sulphur from the available natural gas, could be re-activated by injection of pure water steam, following the method developed for industrial reformers using the same metal catalyst: this method was shown to be perfectly efficient, provided no natural gas was fed during the operation. Results of the tests conducted are presented and discussed in relation to published data on S-sorption on Ni surfaces.  相似文献   
2.
The Resource Constrained Project Scheduling Problem is one of the most intensively investigated scheduling problems. It requires scheduling a set of interrelated activities, while considering precedence relationships, and limited renewable resources allocation. The objective is to minimize the project duration. We propose a new destructive lower bound for this challenging ${\mathcal {NP}}$ -hard problem. Starting from a previously suggested LP model, we propose several original valid inequalities that aim at tightening the model representation. These new inequalities are based on precedence constraints, incompatible activity subsets, and nonpreemption constraints. We present the results of an extensive computational study that was carried out on 2,040 benchmark instances of PSPLIB, with up to 120 activities, and that provide strong evidence that the new proposed lower bound exhibits an excellent performance. In particular, we report the improvement of the best known lower bounds of 5 instances.  相似文献   
3.
A new cryogenic instrument was designed for the trapping of aerosols such as cigarette mainstream smoke at low temperature. The technique enabled the trapping of the mainstream smoke of a single cigarette and the particulate and vapor phases were trapped simultaneously. 2R4F reference cigarettes were smoked under International Standard Organization (ISO) regime and trapped at low temperature using the cryogenic instrument. After trapping, the mainstream smoke of the 2R4F reference cigarette was diluted with a solvent and selected smoke components could be quantified using gas-mass spectrometry (GCMS) and high-performance liquid chromatography (HPLC). The capability of the instrument for trapping the mainstream smoke was demonstrated. The feasibility of the procedure for the detection and the quantification of a large range of smoke components including carbonyls, alkaloids and organic volatile compounds (VOC) in the mainstream of a single cigarette was also shown.  相似文献   
4.
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.  相似文献   
5.
We perform continuous collision detection (CCD) for articulated bodies where motion is governed by an adaptive dynamics simulation. Our algorithm is based on a novel hierarchical set of transforms that represent the kinematics of an articulated body recursively, as described by an assembly tree. The performance of our CCD algorithm significantly improves as the number of active degrees of freedom in the simulation decreases.  相似文献   
6.
This paper deals with multimedia information access. We propose two new approaches for hybrid text-image information processing that can be straightforwardly generalized to the more general multimodal scenario. Both approaches fall in the trans-media pseudo-relevance feedback category. Our first method proposes using a mixture model of the aggregate components, considering them as a single relevance concept. In our second approach, we define trans-media similarities as an aggregation of monomodal similarities between the elements of the aggregate and the new multimodal object. We also introduce the monomodal similarity measures for text and images that serve as basic components for both proposed trans-media similarities. We show how one can frame a large variety of problem in order to address them with the proposed techniques: image annotation or captioning, text illustration and multimedia retrieval and clustering. Finally, we present how these methods can be integrated in two applications: a travel blog assistant system and a tool for browsing the Wikipedia taking into account the multimedia nature of its content.
Gabriela CsurkaEmail:

Dr. Julien Ah-Pine   joined the XRCE Grenoble as Research Engineer in 2007. He is part of the Textual and Visual Pattern Analysis group and his current research activities are related to multi-modal information retrieval and machine learning. He received his PhD degree in mathematics from Pierre and Marie Curie University (University of Paris 6). From 2003 to 2007, he was with Thales Communications, working on relational analysis, data and text mining methods and social choice theory. Dr. Marco Bressan   is Area Manager of the Textual and Visual Pattern Analysis area at Xerox Research Centre Europe. His main research interests are statistical learning and classification; image and video semantic scene understanding; image enhancement and aesthetics; object detection and recognition, particularly when dealing with uncontrolled environments. Prior to Xerox, several of his contributions in these fields were applied to a variety of scenarios including biometric solutions, data mining, CBIR and industrial vision. Dr. Bressan holds a BA in Applied Mathematics from the University of Buenos Aires, a M.Sc. in Computer Vision from the Computer Vision Centre in Spain and a Ph.D. in Computer Science and Artificial Intelligence from the Autonomous University of Barcelona. He is an active member of the network of Argentinean researchers abroad and one of the founders of the network of computer vision and cognitive science researchers. Stephane Clinchant   is Ph.D. Student at University Joseph Fourier (Grenoble, France) and at the Xerox Research Centre Europe, that he joined in 2005. Before joining XRCE, Stephane obtained a Master Degree in Computer Sciences in 2005 from the Ecole Nationale Superieure d’Electrotechnique, d’Informatique, d’Hydraulique et des Telecommunications (France). His current research interests mainly focus on Machine Learning for Natural Language Processing and Multimedia Information Access. Dr. Gabriela Csurka   is a research scientist in the Textual and Visual Pattern Analysis team at Xerox Research Centre Europe (XRCE). She obtained her Ph.D. degree (1996) in Computer Science from University of Nice Sophia - Antipolis. Before joining XRCE in 2002, she worked in fields such as stereo vision and projective reconstruction at INRIA (Sophia Antipolis, Rhone Alpes and IRISA) and image and video watermarking at University of Geneva and Institute Eurécom, Sophia Antipolis. Author of several publications in main journals and international conferences, she is also an active reviewer both for journals and conferences. Her current research interest concerns the exploration of new technologies for image content and aesthetic analysis, cross-modal image categorization and semantic based image segmentation. Yves Hoppenot   is in charge of the development and integration of new technologies in our European research Technology Showroom. He is a software expert for the production, office and services sectors. Yves joined the Xerox Research Centre Europe in 2001. He graduated from the Ecole National Superieure des Telecommunications, Brest in France, and received a Master of Science degree from the Tampere University of Technology in Finland. Dr. Jean-Michel Renders   joined the XRCE Grenoble as Research Engineer in 2001. His current research interests mainly focus on Machine Learning techniques applied to Statistical Natural Language Processing and Text Mining. Before joining XRCE, Jean-Michel obtained a PhD in Applied Sciences from the University of Brussels in 1993. He started his research activities in 1988, in the field of Robotics Dynamics and Control. Then, he joined the Joint Research Center of the European Communities to work on biologial metaphors (Genetic Algorithms, Neural Networks and Immune Networks) applied to process control. After spending one year as Visiting Scientist at York University (England), he spent 4 years applying Artificial Intelligence and Machine Learning Techniques in Industry (Tractebel - Suez). Then, he worked as Data Mining Senior Consultant and led projects in most major Belgian banks and utilities.   相似文献   
7.
Microsystem Technologies - This study presents the results on the feasibility of a resonant planar chemical capacitive sensor in the microwave frequency range suitable for gas detection and...  相似文献   
8.
A six-months continuous experiment was carried out on 48 viripotent white female rats, line "Vistar", divided into one control and three experimental groups of 12 rats each. The experimental groups received drinking water containing nitrates 50, 100 and 500 mg/dm3, respectively and the control group-7.0 +/- 0.03 mg/dm3. All animals were fed with a standard vivarium food containing 22.0 +/- 0.1 mg/kg nitrates. Upon expiry of the test period the animals were killed. Blood parameters and some internal organs were studied by macro- and microscopy. Microscopic changes in the thyroid gland, liver, kidneys, small and intestines, stomach of the test animals were established. The results of the blood analysis showed statistically significant deviations in haemoglobin values and the differential blood count as well as in some serum parameters.  相似文献   
9.
We propose a self-stabilizing algorithm for constructing a Minimum Degree Spanning Tree (MDST) in undirected networks. Starting from an arbitrary state, our algorithm is guaranteed to converge to a legitimate state describing a spanning tree whose maximum node degree is at most Δ+1, where Δ is the minimum possible maximum degree of a spanning tree of the network.To the best of our knowledge, our algorithm is the first self-stabilizing solution for the construction of a minimum degree spanning tree in undirected graphs. The algorithm uses only local communications (nodes interact only with the neighbors at one hop distance). Moreover, the algorithm is designed to work in any asynchronous message passing network with reliable FIFO channels. Additionally, we use a fine grained atomicity model (i.e., the send/receive atomicity). The time complexity of our solution is O(mn2logn) where m is the number of edges and n is the number of nodes. The memory complexity is O(δlogn) in the send-receive atomicity model (δ is the maximal degree of the network).  相似文献   
10.
To maintain and understand large applications, it is important to know their architecture. The first problem is that unlike classes and packages, architecture is not explicitly represented in the code. The second problem is that successful applications evolve over time, so their architecture inevitably drifts. Reconstructing the architecture and checking whether it is still valid is therefore an important aid. While there is a plethora of approaches and techniques supporting architecture reconstruction, there is no comprehensive software architecture reconstruction state of the art and it is often difficult to compare the approaches. This paper presents a state of the art in software architecture reconstruction approaches.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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