全文获取类型
收费全文 | 162106篇 |
免费 | 9486篇 |
国内免费 | 5784篇 |
专业分类
电工技术 | 8499篇 |
技术理论 | 7篇 |
综合类 | 13843篇 |
化学工业 | 12415篇 |
金属工艺 | 6349篇 |
机械仪表 | 17221篇 |
建筑科学 | 30369篇 |
矿业工程 | 4511篇 |
能源动力 | 4294篇 |
轻工业 | 5537篇 |
水利工程 | 4120篇 |
石油天然气 | 4529篇 |
武器工业 | 1668篇 |
无线电 | 10346篇 |
一般工业技术 | 15933篇 |
冶金工业 | 4529篇 |
原子能技术 | 867篇 |
自动化技术 | 32339篇 |
出版年
2024年 | 521篇 |
2023年 | 1535篇 |
2022年 | 2639篇 |
2021年 | 3324篇 |
2020年 | 3687篇 |
2019年 | 3031篇 |
2018年 | 2851篇 |
2017年 | 3737篇 |
2016年 | 4258篇 |
2015年 | 4677篇 |
2014年 | 12045篇 |
2013年 | 10122篇 |
2012年 | 11186篇 |
2011年 | 12139篇 |
2010年 | 9937篇 |
2009年 | 10725篇 |
2008年 | 9596篇 |
2007年 | 11137篇 |
2006年 | 9448篇 |
2005年 | 8282篇 |
2004年 | 6743篇 |
2003年 | 6279篇 |
2002年 | 5101篇 |
2001年 | 4566篇 |
2000年 | 3604篇 |
1999年 | 2863篇 |
1998年 | 2375篇 |
1997年 | 2005篇 |
1996年 | 1728篇 |
1995年 | 1410篇 |
1994年 | 1190篇 |
1993年 | 862篇 |
1992年 | 703篇 |
1991年 | 590篇 |
1990年 | 412篇 |
1989年 | 396篇 |
1988年 | 334篇 |
1987年 | 212篇 |
1986年 | 169篇 |
1985年 | 145篇 |
1984年 | 184篇 |
1983年 | 126篇 |
1982年 | 140篇 |
1981年 | 69篇 |
1980年 | 57篇 |
1979年 | 58篇 |
1978年 | 27篇 |
1977年 | 34篇 |
1976年 | 19篇 |
1975年 | 21篇 |
排序方式: 共有10000条查询结果,搜索用时 6 毫秒
1.
2.
In architectural design, surface shapes are commonly subject to geometric constraints imposed by material, fabrication or assembly. Rationalization algorithms can convert a freeform design into a form feasible for production, but often require design modifications that might not comply with the design intent. In addition, they only offer limited support for exploring alternative feasible shapes, due to the high complexity of the optimization algorithm.We address these shortcomings and present a computational framework for interactive shape exploration of discrete geometric structures in the context of freeform architectural design. Our method is formulated as a mesh optimization subject to shape constraints. Our formulation can enforce soft constraints and hard constraints at the same time, and handles equality constraints and inequality constraints in a unified way. We propose a novel numerical solver that splits the optimization into a sequence of simple subproblems that can be solved efficiently and accurately.Based on this algorithm, we develop a system that allows the user to explore designs satisfying geometric constraints. Our system offers full control over the exploration process, by providing direct access to the specification of the design space. At the same time, the complexity of the underlying optimization is hidden from the user, who communicates with the system through intuitive interfaces. 相似文献
3.
In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models. 相似文献
4.
Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm. 相似文献
5.
This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation. 相似文献
6.
We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately. 相似文献
7.
《Intermetallics》2015
The site preferences of co-alloying elements (Mo–Ta, Mo–Re, Mo–Cr) in Ni3Al are studied using first-principles calculations, and the effects of these alloying elements on the elastic properties of Ni3Al are evaluated by elastic property calculations. The results show that the Mo–Ta, Mo–Re and Mo–Cr atom pairs all prefer Al–Al sites and the spatial neighbor relation of substitution sites almost has no influence on the site preference results. Furthermore, the Young's modulus of Ni3Al increases much higher by substituting Al–Al sites with co-alloying atoms, among which Mo–Re has the best strengthening effect. The enhanced chemical bondings between alloying atoms and their neighbor host atoms are considered to be the main strengthening mechanism of the alloying elements in Ni3Al. 相似文献
8.
For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence. 相似文献
9.
A conceptualization of intended learning outcomes supporting self‐regulated learners in indicating learning paths 下载免费PDF全文
P. Tangworakitthaworn L. Gilbert G.B. Wills 《Journal of Computer Assisted Learning》2015,31(5):393-404
Intended learning outcomes (ILOs) indicate what learners will be able to achieve after they are taught. Traditionally, ILOs are expressed as plain text or unstructured documents. What if all ILOs of a specific course of study can be conceptualized through a structured diagrammatic technique? It was hypothesized that learners can benefit from this conceptualization in learning, especially in self‐regulated learning. The aim of this study was to investigate whether the ILOs represented in unstructured or structured formats can facilitate learners to identify learning paths. The results revealed that the mean ratings of all learning paths were statistically significantly higher with structured ILOs. 相似文献
10.