全文获取类型
收费全文 | 35171篇 |
免费 | 3712篇 |
国内免费 | 3134篇 |
专业分类
电工技术 | 3648篇 |
综合类 | 4966篇 |
化学工业 | 1765篇 |
金属工艺 | 944篇 |
机械仪表 | 2395篇 |
建筑科学 | 1239篇 |
矿业工程 | 584篇 |
能源动力 | 713篇 |
轻工业 | 790篇 |
水利工程 | 731篇 |
石油天然气 | 656篇 |
武器工业 | 384篇 |
无线电 | 3912篇 |
一般工业技术 | 3146篇 |
冶金工业 | 487篇 |
原子能技术 | 248篇 |
自动化技术 | 15409篇 |
出版年
2024年 | 90篇 |
2023年 | 353篇 |
2022年 | 569篇 |
2021年 | 702篇 |
2020年 | 892篇 |
2019年 | 948篇 |
2018年 | 822篇 |
2017年 | 1199篇 |
2016年 | 1310篇 |
2015年 | 1372篇 |
2014年 | 2014篇 |
2013年 | 2738篇 |
2012年 | 2393篇 |
2011年 | 2557篇 |
2010年 | 2004篇 |
2009年 | 2181篇 |
2008年 | 2193篇 |
2007年 | 2407篇 |
2006年 | 2031篇 |
2005年 | 1845篇 |
2004年 | 1552篇 |
2003年 | 1349篇 |
2002年 | 1216篇 |
2001年 | 1017篇 |
2000年 | 907篇 |
1999年 | 794篇 |
1998年 | 597篇 |
1997年 | 629篇 |
1996年 | 511篇 |
1995年 | 426篇 |
1994年 | 411篇 |
1993年 | 316篇 |
1992年 | 279篇 |
1991年 | 254篇 |
1990年 | 190篇 |
1989年 | 160篇 |
1988年 | 133篇 |
1987年 | 88篇 |
1986年 | 66篇 |
1985年 | 54篇 |
1984年 | 78篇 |
1983年 | 66篇 |
1982年 | 59篇 |
1981年 | 45篇 |
1980年 | 37篇 |
1979年 | 38篇 |
1978年 | 20篇 |
1977年 | 31篇 |
1976年 | 18篇 |
1975年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
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. 相似文献
32.
This paper is concerned with the problem of joint input and state estimation for linear stochastic systems with direct feedthrough. Based on the fact that each unknown input between any two time steps is always bounded, a novel improved algorithm is proposed. Compared with existing results, this algorithm can effectively enhance estimation accuracy. Moreover, the stability of the algorithm is also discussed. Finally, an illustrative example is given to demonstrate the effectiveness of the proposed approach. 相似文献
33.
Thermal comfort is an important factor for the design of buildings. Although it has been well recognized that many physiological parameters are linked to the state of thermal comfort or discomfort of humans, how to use physiological signal to judge the state of thermal comfort has not been well studied. In this paper, the feasibility of continuously determining feelings of personal thermal comfort was discussed by using electroencephalogram (EEG) signals in private space. In the study, 22 subjects were exposed to thermally comfortable and uncomfortably hot environments, and their EEG signals were recorded. Spectral power features of the EEG signals were extracted, and an ensemble learning method using linear discriminant analysis or support vector machine as a sub-classifier was used to build the discriminant model. The results show that an average discriminate accuracy of 87.9% can be obtained within a detection window of 60 seconds. This study indicates that it is feasible to distinguish whether a person feels comfortable or too hot in their private space by multi-channel EEG signals without interruption and suggests possibility for further applications in neuroergonomics. 相似文献
34.
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. 相似文献
35.
36.
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. 相似文献
37.
38.
Application of high‐temperature Fenton oxidation for the treatment of sulfonation plant wastewater 下载免费PDF全文
39.
This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method. 相似文献
40.
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. 相似文献