全文获取类型
收费全文 | 1532篇 |
免费 | 106篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 9篇 |
化学工业 | 489篇 |
金属工艺 | 39篇 |
机械仪表 | 36篇 |
建筑科学 | 59篇 |
矿业工程 | 3篇 |
能源动力 | 32篇 |
轻工业 | 379篇 |
水利工程 | 12篇 |
石油天然气 | 8篇 |
无线电 | 80篇 |
一般工业技术 | 183篇 |
冶金工业 | 63篇 |
原子能技术 | 8篇 |
自动化技术 | 241篇 |
出版年
2024年 | 9篇 |
2023年 | 13篇 |
2022年 | 99篇 |
2021年 | 85篇 |
2020年 | 52篇 |
2019年 | 54篇 |
2018年 | 54篇 |
2017年 | 51篇 |
2016年 | 76篇 |
2015年 | 44篇 |
2014年 | 70篇 |
2013年 | 116篇 |
2012年 | 102篇 |
2011年 | 102篇 |
2010年 | 91篇 |
2009年 | 76篇 |
2008年 | 64篇 |
2007年 | 50篇 |
2006年 | 51篇 |
2005年 | 50篇 |
2004年 | 37篇 |
2003年 | 45篇 |
2002年 | 29篇 |
2001年 | 13篇 |
2000年 | 22篇 |
1999年 | 22篇 |
1998年 | 12篇 |
1997年 | 15篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1982年 | 5篇 |
1980年 | 3篇 |
1979年 | 7篇 |
1978年 | 6篇 |
1977年 | 9篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1970年 | 5篇 |
排序方式: 共有1641条查询结果,搜索用时 31 毫秒
31.
Yun Sheng Alexei Sourin Gabriela Gonzalez Castro Hassan Ugail 《The Visual computer》2010,26(6-8):975-984
Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (CT) data, often result in large polygon meshes which require substantial storage for their handling, and normally have only one fixed level of detail (LOD). This can often be an obstacle for efficient data exchange and interactive work with such objects. We propose to replace such large polygon meshes with a relatively small set of coefficients of the patchwise partial differential equation (PDE) function representation. With this model, the approximations of the original shapes can be rendered with any desired resolution at interactive rates. Our approach can directly work with any common 3D reconstruction pipeline, which we demonstrate by applying it to a large reconstructed medical data set with irregular geometry. 相似文献
32.
Iris segmentation in non-ideal images using graph cuts 总被引:1,自引:0,他引:1
A non-ideal iris image segmentation approach based on graph cuts is presented that uses both the appearance and eye geometry information. A texture measure based on gradients is computed to discriminate between eyelash and non-eyelash regions, combined with image intensity differences between the iris, pupil, and the background (region surrounding the iris) are utilized as cues for segmentation. The texture and intensity distributions for the various regions are learned from histogramming and explicit sampling of the pixels estimated to belong to the corresponding regions. The image is modeled as a Markov Random Field and the energy minimization is achieved via graph cuts to assign each image pixel one of the four possible labels: iris, pupil, background, and eyelash. Furthermore, the iris region is modeled as an ellipse, and the best fitting ellipse to the initial pixel based iris segmentation is computed to further refine the segmented region. As a result, the iris region mask and the parameterized iris shape form the outputs of the proposed approach that allow subsequent iris recognition steps to be performed for the segmented irises. The algorithm is unsupervised and can deal with non-ideality in the iris images due to out-of-plane rotation of the eye, iris occlusion by the eyelids and the eyelashes, multi-modal iris grayscale intensity distribution, and various illumination effects. The proposed segmentation approach is tested on several publicly available non-ideal near infra red (NIR) iris image databases. We compare both the segmentation error and the resulting recognition error with several leading techniques, demonstrating significantly improved results with the proposed technique. 相似文献
33.
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk, assuming that P is positive on the simplex. This bound depends only on the number of variables k, the degree d and the bitsize τ of the coefficients of P and improves all the previous bounds for arbitrary polynomials which are positive over the simplex. 相似文献
34.
In this paper we describe a new model suitable for optimization problems with explicitly unknown optimization functions using user’s preferences. The model addresses an ability to learn not known optimization functions thus perform also a learning of user’s preferences. The model consists of neural networks using fuzzy membership functions and interactive evolutionary algorithms in the process of learning. Fuzzy membership functions of basic human values and their priorities were prepared by utilizing Schwartz’s model of basic human values (achievement, benevolence, conformity, hedonism, power, security, self-direction, stimulation, tradition and universalism). The quality of the model was tested on “the most attractive font face problem” and it was evaluated using the following criteria: a speed of optimal parameters computation, a precision of achieved results, Wilcoxon signed rank test and a similarity of letter images. The results qualify the developed model as very usable in user’s preference modeling. 相似文献
35.
Gabriela García‐Ayala José Luis González‐Velarde Roger Z. Ríos‐Mercado Elena Fernández 《International Transactions in Operational Research》2016,23(3):433-458
The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region. This problem arises in numerous applications such as postal delivery, meter readings, winter gritting, road maintenance, and municipal solid waste collection. An integer linear programming model is proposed where a novel set of node parity constraints to favor Eulerian districts is introduced. Series of instances were solved to assess the impact of these parity constraints on the objective function and deadhead distance. Networks with up to 401 nodes and 764 edges were successfully solved. The model is useful at a tactical level as it can be used to promote workload balance, compactness, deadhead distance reduction and parity in districts. 相似文献
36.
Gabriela?Viale?PereiraEmail author Marie?Anne?Macadar Edimara?M.?Luciano Maurício?Gregianin?Testa 《Information Systems Frontiers》2017,19(2):213-229
By using ICT in an innovative way, governments can improve the delivery of services and interaction with stakeholders. Open data is a way to help public organizations became more open and improve interaction with stakeholders. This paper aims to identify what are the public values enhancements acquired on smart city environment that discloses open data. We propose a conceptual model to analyze the smart city initiative. We contextualized the model taking a smart city domain by analyzing three related-initiatives that comprises open data in a smart city case carried at Rio de Janeiro Operations Center (COR) in Brazil by seven deep-interviewees directly involved - from inside and outside – in this case. The findings reveal evidences that open data initiatives contribute to enhance the delivery of public value in smart city contexts. 相似文献
37.
Elnaz Bigdeli Mahdi Mohammadi Bijan Raahemi Stan Matwin 《Pattern Analysis & Applications》2017,20(1):183-199
Clustering, while systematically applied in anomaly detection, has a direct impact on the accuracy of the detection methods. Existing cluster-based anomaly detection methods are mainly based on spherical shape clustering. In this paper, we focus on arbitrary shape clustering methods to increase the accuracy of the anomaly detection. However, since the main drawback of arbitrary shape clustering is its high memory complexity, we propose to summarize clusters first. For this, we design an algorithm, called Summarization based on Gaussian Mixture Model (SGMM), to summarize clusters and represent them as Gaussian Mixture Models (GMMs). After GMMs are constructed, incoming new samples are presented to the GMMs, and their membership values are calculated, based on which the new samples are labeled as “normal” or “anomaly.” Additionally, to address the issue of noise in the data, instead of labeling samples individually, they are clustered first, and then each cluster is labeled collectively. For this, we present a new approach, called Collective Probabilistic Anomaly Detection (CPAD), in which, the distance of the incoming new samples and the existing SGMMs is calculated, and then the new cluster is labeled the same as of the closest cluster. To measure the distance of two GMM-based clusters, we propose a modified version of the Kullback–Libner measure. We run several experiments to evaluate the performances of the proposed SGMM and CPAD methods and compare them against some of the well-known algorithms including ABACUS, local outlier factor (LOF), and one-class support vector machine (SVM). The performance of SGMM is compared with ABACUS using Dunn and DB metrics, and the results indicate that the SGMM performs superior in terms of summarizing clusters. Moreover, the proposed CPAD method is compared with the LOF and one-class SVM considering the performance criteria of (a) false alarm rate, (b) detection rate, and (c) memory efficiency. The experimental results show that the CPAD method is noise resilient, memory efficient, and its accuracy is higher than the other methods. 相似文献
38.
In training the weights of a feedforward neural network, it is well known that the global extended Kalman filter (GEKF) algorithm has much better performance than the popular gradient descent with error backpropagation in terms of convergence and quality of solution. However, the GEKF is very computationally intensive, which has led to the development of efficient algorithms such as the multiple extended Kalman algorithm (MEKA) and the decoupled extended Kalman filter algorithm (DEKF), that are based on dimensional reduction and/or partitioning of the global problem. In this paper we present a new training algorithm, called local linearized least squares (LLLS), that is based on viewing the local system identification subproblems at the neuron level as recursive linearized least squares problems. The objective function of the least squares problems for each neuron is the sum of the squares of the linearized backpropagated error signals. The new algorithm is shown to give better convergence results for three benchmark problems in comparison to MEKA, and in comparison to DEKF for highly coupled applications. The performance of the LLLS algorithm approaches that of the GEKF algorithm in the experiments. 相似文献
39.
Carbajal-Palacios P Balderas-Hernández P Ibanez JG Roa-Morales G 《Water science and technology》2012,66(5):1069-1073
The widely used standard method for chemical oxygen demand (COD) involves hazardous chromium species, and its two-hour heating protocol entails a substantial amount of energy expenditure. In the present work we report a proof of concept for a major modification of this method in the range 10-800 mgCOD/L, whereby H2O2 is proposed as a replacement oxidizer. This modification not only reduces the use of unsafe chromium species but also allows for the use of milder conditions that decrease the total energy outlay. The results are comparable with those obtained either with the standard method or with a commercial Hach? kit. 相似文献
40.
Johannes Blümlein Sebastian Klein Carsten Schneider Flavia Stan 《Journal of Symbolic Computation》2012
Given a Feynman parameter integral, depending on a single discrete variable N and a real parameter ε, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in ε. In a first step, the integrals are expressed by hypergeometric multi-sums by means of symbolic transformations. Given this sum format, we develop new summation tools to extract the first coefficients of its series expansion whenever they are expressible in terms of indefinite nested product–sum expressions. In particular, we enhance the known multi-sum algorithms to derive recurrences for sums with complicated boundary conditions, and we present new algorithms to find formal Laurent series solutions of a given recurrence relation. 相似文献