全文获取类型
收费全文 | 3526篇 |
免费 | 256篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 38篇 |
综合类 | 5篇 |
化学工业 | 879篇 |
金属工艺 | 66篇 |
机械仪表 | 117篇 |
建筑科学 | 177篇 |
矿业工程 | 15篇 |
能源动力 | 137篇 |
轻工业 | 687篇 |
水利工程 | 31篇 |
石油天然气 | 17篇 |
无线电 | 202篇 |
一般工业技术 | 521篇 |
冶金工业 | 182篇 |
原子能技术 | 27篇 |
自动化技术 | 688篇 |
出版年
2024年 | 5篇 |
2023年 | 35篇 |
2022年 | 76篇 |
2021年 | 145篇 |
2020年 | 116篇 |
2019年 | 130篇 |
2018年 | 158篇 |
2017年 | 135篇 |
2016年 | 167篇 |
2015年 | 137篇 |
2014年 | 177篇 |
2013年 | 287篇 |
2012年 | 241篇 |
2011年 | 285篇 |
2010年 | 197篇 |
2009年 | 205篇 |
2008年 | 168篇 |
2007年 | 153篇 |
2006年 | 133篇 |
2005年 | 119篇 |
2004年 | 105篇 |
2003年 | 82篇 |
2002年 | 73篇 |
2001年 | 44篇 |
2000年 | 42篇 |
1999年 | 31篇 |
1998年 | 51篇 |
1997年 | 32篇 |
1996年 | 35篇 |
1995年 | 36篇 |
1994年 | 17篇 |
1993年 | 18篇 |
1992年 | 16篇 |
1991年 | 14篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 7篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 12篇 |
1984年 | 6篇 |
1983年 | 8篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1974年 | 2篇 |
排序方式: 共有3789条查询结果,搜索用时 359 毫秒
71.
Jorge M Santos Joaquim Marques de Sa Luis A Alexandre 《IEEE transactions on pattern analysis and machine intelligence》2008,30(1):62-75
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones. 相似文献
72.
In this paper, we consider the single machine weighted tardiness scheduling problem with sequence-dependent setups. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Previous beam search implementations use fixed beam and filter widths. We consider the usual fixed width algorithms, and develop new versions that use variable beam and filter widths. 相似文献
73.
Yolanda Blanco-Fernndez Jos J. Pazos-Arias Alberto Gil-Solla Manuel Ramos-Cabrer Martín Lpez-Nores Jorge García-Duque Ana Fernndez-Vilas Rebeca P. Díaz-Redondo Jesús Bermejo-Muoz 《Knowledge》2008,21(4):305-320
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. 相似文献
74.
An extension of the Cauer ladder development for synthesizing singly terminated filters with symmetric and asymmetric responses is presented. Basically, a driving‐point immittance including reactive constant elements is carried out in such a way that provides the transmission zeros. The reactive constant elements are introduced into the synthesis for two reasons. The first is to consider the possibility of the asymmetric position of transmission zeros in the real frequency axis. The second one is to obtain canonical forms, i.e. networks with the minimum number of elements in the case of symmetrical responses. To validate the proposed method, a filter with asymmetrical response has been synthesized, comparing different topologies for its use in multiplexers. This fact is illustrated with a Ku‐band elliptic response diplexer designed in H‐plane rectangular waveguide. © 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009. 相似文献
75.
Ortega-Cabezas Pedro Miguel Colmenar-Santos Antonio Borge-Diez David Blanes-Peiró Jorge Juan Higuera-Pérez Jorge Alcaide Eric 《Software Quality Journal》2022,30(3):687-728
Software Quality Journal - The number of electronic control units (ECU) installed in vehicles is increasingly high. Manufacturers must improve the software quality and reduce cost by proposing... 相似文献
76.
This paper presents a syntactic approach based on Adjacency Grammars (AG) for sketch diagram modeling and understanding. Diagrams are a combination of graphical symbols arranged according to a set of spatial rules defined by a visual language. AG describe visual shapes by productions defined in terms of terminal and non-terminal symbols (graphical primitives and subshapes), and a set functions describing the spatial arrangements between symbols. Our approach to sketch diagram understanding provides three main contributions. First, since AG are linear grammars, there is a need to define shapes and relations inherently bidimensional using a sequential formalism. Second, our parsing approach uses an indexing structure based on a spatial tessellation. This serves to reduce the search space when finding candidates to produce a valid reduction. This allows order-free parsing of 2D visual sentences while keeping combinatorial explosion in check. Third, working with sketches requires a distortion model to cope with the natural variations of hand drawn strokes. To this end we extended the basic grammar with a distortion measure modeled on the allowable variation on spatial constraints associated with grammar productions. Finally, the paper reports on an experimental framework an interactive system for sketch analysis. User tests performed on two real scenarios show that our approach is usable in interactive settings. 相似文献
77.
Mark Anderson Rajiv D. Banker Nirup M. Menon Jorge A. Romero 《Information Technology and Management》2011,12(3):197-212
This paper examines the impact of the duration of ERP implementation on firm performance both during and after implementation.
Organizations choose either an accelerated implementation approach or a traditional (longer) implementation approach. The
former approach gives the organization the advantage of speed, but the disadvantage of fitting its processes to that of a
packaged (thus, undifferentiated from competitors) ERP. The latter approach allows the organization to redesign strategy and
processes, and thus, search for ways to be unique from its competition. The study uses a regression model to capture the changes
in various performance measures during and after implementation between firms that implemented the ERP, using the performance
measure of a matched group of firms that did not implement an ERP as a benchmark/control sample, on the basis of the duration
of the implementation. Financial data from Compustat, and data on start date and end date of ERP implementation between 1990
and 2005 for firms in the Oil and Gas industry was collected from an ERP vendor. Results show that measures such as return
on sales improved after implementation. However, measures such as inventory turnover, which reflect operational benefits,
improve during implementation. We find that accelerated implementation confers both operational and strategic benefits. This
study highlights the strategic consequences of the different choices of implementation. 相似文献
78.
This paper proposes a new approach for the segmentation of both near-end and far-end intima-media regions of the common carotid artery in ultrasound images. The method requires minimal user interaction and is able to segment the near-end wall in arteries with large, hypoechogenic and irregular plaques, issues usually not considered previously due to the increased segmentation difficulty. 相似文献
79.
Jorge E. Mendoza Bruno Castanier Christelle Guéret Andrés L. Medaglia Nubia Velasco 《Computers & Operations Research》2010,37(11):1886-1898
The multi-compartment vehicle routing problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of customers for several products that, because of incompatibility constraints, must be loaded in independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the literature, and the few existing methods assume perfect knowledge of the customer demands, regardless of their stochastic nature. This paper extends the MC-VRP by introducing uncertainty on what it is known as the MC-VRP with stochastic demands (MC-VRPSD). The MC-VRPSD is modeled as a stochastic program with recourse and solved by means of a memetic algorithm. The proposed memetic algorithm couples genetic operators and local search procedures proven to be effective on deterministic routing problems with a novel individual evaluation and reparation strategy that accounts for the stochastic nature of the problem. The algorithm was tested on instances of up to 484 customers, and its results were compared to those obtained by a savings-based heuristic and a memetic algorithm (MA/SCS) for the MC-VRP that uses a spare capacity strategy to handle demand fluctuations. In addition to effectively solve the MC-VRPSD, the proposed MA/SCS also improved 14 best known solutions in a 40-problem testbed for the MC-VRP. 相似文献
80.
Inés González-Rodríguez Camino R. Vela Jorge Puente 《Journal of Intelligent Manufacturing》2010,21(1):65-73
In this work we consider a multiobjective job shop problem with uncertain durations and crisp due dates. Ill-known durations
are modelled as fuzzy numbers. We take a fuzzy goal programming approach to propose a generic multiobjective model based on
lexicographical minimisation of expected values. To solve the resulting problem, we propose a genetic algorithm searching
in the space of possibly active schedules. Experimental results are presented for several problem instances, solved by the
GA according to the proposed model, considering three objectives: makespan, tardiness and idleness. The results illustrate
the potential of the proposed multiobjective model and genetic algorithm. 相似文献