首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   58454篇
  免费   7498篇
  国内免费   5426篇
电工技术   6116篇
技术理论   1篇
综合类   7699篇
化学工业   4089篇
金属工艺   2252篇
机械仪表   5449篇
建筑科学   5726篇
矿业工程   2026篇
能源动力   1724篇
轻工业   1085篇
水利工程   1959篇
石油天然气   1565篇
武器工业   1085篇
无线电   4562篇
一般工业技术   6261篇
冶金工业   1370篇
原子能技术   250篇
自动化技术   18159篇
  2024年   339篇
  2023年   887篇
  2022年   1550篇
  2021年   1704篇
  2020年   1941篇
  2019年   1684篇
  2018年   1643篇
  2017年   2101篇
  2016年   2428篇
  2015年   2554篇
  2014年   3556篇
  2013年   3900篇
  2012年   4431篇
  2011年   4396篇
  2010年   3490篇
  2009年   3600篇
  2008年   3601篇
  2007年   4210篇
  2006年   3663篇
  2005年   3064篇
  2004年   2493篇
  2003年   2122篇
  2002年   1810篇
  2001年   1605篇
  2000年   1440篇
  1999年   1165篇
  1998年   946篇
  1997年   870篇
  1996年   719篇
  1995年   623篇
  1994年   551篇
  1993年   422篇
  1992年   358篇
  1991年   290篇
  1990年   223篇
  1989年   222篇
  1988年   161篇
  1987年   90篇
  1986年   72篇
  1985年   61篇
  1984年   81篇
  1983年   47篇
  1982年   52篇
  1981年   29篇
  1980年   40篇
  1979年   45篇
  1978年   15篇
  1977年   23篇
  1976年   14篇
  1975年   12篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
高素质人才培养是我国可持续发展战略、科教兴国战略以及人才强国战略等多项发展战略的一项基础性工程。本文针对中医药类院校程序设计类课程实践教学模式单一等教学实际,以“学科竞赛”为平台,“赛教结合”为理念,以《C语言程序设计》为例,从现存问题、赛教结合模式的引入、建立实施及其评价机制4个方面展开阐述,旨在提高学生学习积极性和能力。  相似文献   
2.
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.  相似文献   
3.
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.  相似文献   
4.
ABSTRACT

This paper presents an empirical assessment of four state-of-the-art risk-averse approaches to deal with the capacitated lot-sizing problem under stochastic demand. We analyse two mean-risk models based on the semideviation and on the conditional value-at-risk risk measures, and alternate first and second-order stochastic dominance approaches. The extensive computational experiments based on different instances characteristics and on a case-study suggest that CVaR exhibits a good trade-off between risk and performance, followed by the semideviation and first-order stochastic dominance approach. For all approaches, enforcing risk-aversion helps to reduce the cost-standard deviation substantially, which is usually accomplished via increasing production rates. Overall, we can say that very risk-averse decision-makers would be willing to pay an increased price to have a much less risky solution given by CVaR. In less risk-averse settings, though, semideviation and first-order stochastic dominance can be appealing alternatives to provide significantly more stable production planning costs with a marginal increase of the expected costs.  相似文献   
5.
Computer-Supported Collaborative Learning (CSCL) is concerned with how Information and Communication Technology (ICT) might facilitate learning in groups which can be co-located or distributed over a network of computers such as Internet. CSCL supports effective learning by means of communication of ideas and information among learners, collaborative access of essential documents, and feedback from instructors and peers on learning activities. As the cloud technologies are increasingly becoming popular and collaborative learning is evolving, new directions for development of collaborative learning tools deployed on cloud are proposed. Development of such learning tools requires access to substantial data stored in the cloud. Ensuring efficient access to such data is hindered by the high latencies of wide-area networks underlying the cloud infrastructures. To improve learners’ experience by accelerating data access, important files can be replicated so a group of learners can access data from nearby locations. Since a cloud environment is highly dynamic, resource availability, network latency, and learner requests may change. In this paper, we present the advantages of collaborative learning and focus on the importance of data replication in the design of such a dynamic cloud-based system that a collaborative learning portal uses. To this end, we introduce a highly distributed replication technique that determines optimal data locations to improve access performance by minimizing replication overhead (access and update). The problem is formulated using dynamic programming. Experimental results demonstrate the usefulness of the proposed collaborative learning system used by institutions in geographically distributed locations.  相似文献   
6.
Glyco‐mimicking nanoparticles (glyco‐NPs) with Förster resonance energy transfer (FRET) donor and acceptor groups formed via dynamic covalent bond of benzoboroxole and sugar from two complementary polymers are prepared. The glyco‐NPs are proved to be quite stable under physiological conditions but sensitive to pH. So the glyco‐NPs can be internalized by dendritic cells with integrity and nontoxicity and then dissociate within the acidic organelles. This particle dissociation is directly observed and visualized in vitro, for the first time via the FRET measurements and fluorescent microscopy. This feature makes controlled release of drug or protein by glyco‐NPs possible, i.e., when model antigen Ovalbumin is loaded in the glyco‐NPs, the released Ovalbumin in dendritic cells stimulates T cells more efficiently than the free Ovalbumin itself as a result of the enhanced antigen processing and presentation. Thus, the results enlighten a bright future of the glyco‐NPs in immunotherapy.  相似文献   
7.
During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction.  相似文献   
8.
Crashworthiness simulation system is one of the key computer-aided engineering (CAE) tools for the automobile industry and implies two potential conflicting requirements: accuracy and efficiency. A parallel crashworthiness simulation system based on graphics processing unit (GPU) architecture and the explicit finite element (FE) method is developed in this work. Implementation details with compute unified device architecture (CUDA) are considered. The entire parallel simulation system involves a parallel hierarchy-territory contact-searching algorithm (HITA) and a parallel penalty contact force calculation algorithm. Three basic GPU-based parallel strategies are suggested to meet the natural parallelism of the explicit FE algorithm. Two free GPU-based numerical calculation libraries, cuBLAS and Thrust, are introduced to decrease the difficulty of programming. Furthermore, a mixed array and a thread map to element strategy are proposed to improve the performance of the test pairs searching. The outer loop of the nested loop through the mixed array is unrolled to realize parallel searching. An efficient storage strategy based on data sorting is presented to realize data transfer between different hierarchies with coalesced access during the contact pairs searching. A thread map to element pattern is implemented to calculate the penetrations and the penetration forces; a double float atomic operation is used to scatter contact forces. The simulation results of the three different models based on the Intel Core i7-930 and the NVIDIA GeForce GTX 580 demonstrate the precision and efficiency of this developed parallel crashworthiness simulation system.  相似文献   
9.
Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem.  相似文献   
10.
This study addresses the problem of choosing the most suitable probabilistic model selection criterion for unsupervised learning of visual context of a dynamic scene using mixture models. A rectified Bayesian Information Criterion (BICr) and a Completed Likelihood Akaike’s Information Criterion (CL-AIC) are formulated to estimate the optimal model order (complexity) for a given visual scene. Both criteria are designed to overcome poor model selection by existing popular criteria when the data sample size varies from small to large and the true mixture distribution kernel functions differ from the assumed ones. Extensive experiments on learning visual context for dynamic scene modelling are carried out to demonstrate the effectiveness of BICr and CL-AIC, compared to that of existing popular model selection criteria including BIC, AIC and Integrated Completed Likelihood (ICL). Our study suggests that for learning visual context using a mixture model, BICr is the most appropriate criterion given sparse data, while CL-AIC should be chosen given moderate or large data sample sizes.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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