首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   42797篇
  免费   2479篇
  国内免费   38篇
工业技术   45314篇
  2023年   374篇
  2022年   370篇
  2021年   987篇
  2020年   809篇
  2019年   741篇
  2018年   1567篇
  2017年   1568篇
  2016年   1632篇
  2015年   1161篇
  2014年   1518篇
  2013年   2894篇
  2012年   2518篇
  2011年   2347篇
  2010年   1858篇
  2009年   1631篇
  2008年   1920篇
  2007年   1663篇
  2006年   1235篇
  2005年   1037篇
  2004年   963篇
  2003年   844篇
  2002年   763篇
  2001年   497篇
  2000年   497篇
  1999年   643篇
  1998年   3404篇
  1997年   2042篇
  1996年   1340篇
  1995年   795篇
  1994年   675篇
  1993年   672篇
  1992年   225篇
  1991年   248篇
  1990年   233篇
  1989年   224篇
  1988年   203篇
  1987年   181篇
  1986年   191篇
  1985年   227篇
  1984年   196篇
  1983年   143篇
  1982年   181篇
  1981年   185篇
  1980年   163篇
  1979年   137篇
  1978年   124篇
  1977年   212篇
  1976年   424篇
  1975年   97篇
  1973年   87篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Instance selection is becoming increasingly relevant due to the huge amount of data that is constantly being produced in many fields of research. Although current algorithms are useful for fairly large datasets, scaling problems are found when the number of instances is in the hundreds of thousands or millions. When we face huge problems, scalability becomes an issue, and most algorithms are not applicable.Thus, paradoxically, instance selection algorithms are for the most part impracticable for the same problems that would benefit most from their use. This paper presents a way of avoiding this difficulty using several rounds of instance selection on subsets of the original dataset. These rounds are combined using a voting scheme to allow good performance in terms of testing error and storage reduction, while the execution time of the process is significantly reduced. The method is particularly efficient when we use instance selection algorithms that are high in computational cost. The proposed approach shares the philosophy underlying the construction of ensembles of classifiers. In an ensemble, several weak learners are combined to form a strong classifier; in our method several weak (in the sense that they are applied to subsets of the data) instance selection algorithms are combined to produce a strong and fast instance selection method.An extensive comparison of 30 medium and large datasets from the UCI Machine Learning Repository using 3 different classifiers shows the usefulness of our method. Additionally, the method is applied to 5 huge datasets (from three hundred thousand to more than a million instances) with good results and fast execution time.  相似文献   
992.
993.
Recently, a multi-objective Sensitivity–Accuracy based methodology has been proposed for building classifiers for multi-class problems. This technique is especially suitable for imbalanced and multi-class datasets. Moreover, the high computational cost of multi-objective approaches is well known so more efficient alternatives must be explored. This paper presents an efficient alternative to the Pareto based solution when considering both Minimum Sensitivity and Accuracy in multi-class classifiers. Alternatives are implemented by extending the Evolutionary Extreme Learning Machine algorithm for training artificial neural networks. Experiments were performed to select the best option after considering alternative proposals and related methods. Based on the experiments, this methodology is competitive in Accuracy, Minimum Sensitivity and efficiency.  相似文献   
994.
995.
In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process, we identify typical scheduling problems found in semiconductor manufacturing systems. We describe batch scheduling problems, parallel machine scheduling problems, job shop scheduling problems, scheduling problems with auxiliary resources, multiple orders per job scheduling problems, and scheduling problems related to cluster tools. We also present important solution techniques that are used to solve these scheduling problems by means of specific examples, and report on known implementations. Finally, we summarize some of the challenges in scheduling semiconductor manufacturing operations.  相似文献   
996.
The development of NURBS-Enhanced Finite Element Method (NEFEM) is revisited. This technique allows a seamless integration of the CAD boundary representation of the domain and the finite element method (FEM). The importance of the geometrical model in finite element simulations is addressed and the benefits and potential of NEFEM are discussed and compared with respect to other curved finite element techniques.  相似文献   
997.
The move to IP Protocol Television (IPTV) has challenged the traditional television industry by opening the Internet to high quality real time television content delivery. Thus it has provided an enabling set of key technologies to understand and foster further innovations in the multimedia landscape and to create dynamics in the TV value chain. This editorial provides a brief overview of this special issue. It begins with a short introduction to IPTV Technology and then summarizes the main contributions of the selected papers for this special issue, highlighting their salient features and novel results.  相似文献   
998.
In this paper, we propose two original and efficient approaches for enforcing singleton arc consistency. In the first one, the data structures used to enforce arc consistency are shared between all subproblems where a domain is reduced to a singleton. This new algorithm is not optimal but it requires far less space and is often more efficient in practice than the optimal algorithm SAC-Opt. In the second approach, we perform several runs of a greedy search (where at each step, arc consistency is maintained), possibly detecting the singleton arc consistency of several values in one run. It is an original illustration of applying inference (i.e., establishing singleton arc consistency) by search. Using a greedy search allows benefiting from the incrementality of arc consistency, learning relevant information from conflicts and, potentially finding solution(s) during the inference process. We present extensive experiments that show the benefit of our two approaches.  相似文献   
999.
This paper presents two new approaches for constructing an ensemble of neural networks (NN) using coevolution and the artificial immune system (AIS). These approaches are extensions of the CLONal Selection Algorithm for building ENSembles (CLONENS) algorithm. An explicit diversity promotion technique was added to CLONENS and a novel coevolutionary approach to build neural ensembles is introduced, whereby two populations representing the gates and the individual NN are coevolved. The former population is responsible for defining the ensemble size and selecting the members of the ensemble. This population is evolved using the differential evolution algorithm. The latter population supplies the best individuals for building the ensemble, which is evolved by AIS. Results show that it is possible to automatically define the ensemble size being also possible to find smaller ensembles with good generalization performance on the tested benchmark regression problems. More interestingly, the use of the diversity measure during the evolutionary process did not necessarily improve generalization. In this case, diverse ensembles may be found using only implicit diversity promotion techniques.  相似文献   
1000.
Adaptive IPTV services based on a novel IP Multimedia Subsystem   总被引:1,自引:1,他引:0  
Heterogeneous communication devices are emerging and changing the way of communication. Innovative multimedia applications are now accessible through these embedded systems. The 3GPP IP Multimedia Subsystem (IMS) provides a basic architecture framework for the Next Generation Network (NGN) supporting the convergence platform for service provisioning in heterogeneous networks. ETSI TISPAN standardization effort focuses on delivering IPTV services on such platform. Nevertheless, IPTV on IMS standardization suffers from a lack of efficient user-centric network management mechanisms as the end-user may consume IPTV service from different access networks, on different mobile devices, at anytime. User’s Perceived Quality of Service (PQoS) or Quality of Experience (QoE) of IPTV service may also suffer from wireless access network impairments. This paper introduces new functionalities in IPTV over IMS architecture which optimize satisfaction of the end-user and resource utilization of the operator’s networks. A context-sensitive User Profile (UP) model is used to deliver IPTV streams adapted to the user’s environment. In order to optimize the operator network usage, the impact of spatiotemporal dynamics of the video content on the deduced perceptual quality is considered. A Multimedia Content Management System (MCMS) is proposed to perform dynamic cross-layer adaptation of the IPTV stream based on PQoS measurements at the end-user side.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号