全文获取类型
收费全文 | 158917篇 |
免费 | 25275篇 |
国内免费 | 16764篇 |
专业分类
电工技术 | 17288篇 |
技术理论 | 3篇 |
综合类 | 18478篇 |
化学工业 | 13460篇 |
金属工艺 | 5179篇 |
机械仪表 | 12562篇 |
建筑科学 | 5916篇 |
矿业工程 | 4271篇 |
能源动力 | 5215篇 |
轻工业 | 7305篇 |
水利工程 | 3589篇 |
石油天然气 | 4712篇 |
武器工业 | 2431篇 |
无线电 | 19978篇 |
一般工业技术 | 13633篇 |
冶金工业 | 3680篇 |
原子能技术 | 1202篇 |
自动化技术 | 62054篇 |
出版年
2024年 | 1192篇 |
2023年 | 3043篇 |
2022年 | 5465篇 |
2021年 | 5981篇 |
2020年 | 6765篇 |
2019年 | 5770篇 |
2018年 | 5574篇 |
2017年 | 6733篇 |
2016年 | 7469篇 |
2015年 | 8282篇 |
2014年 | 11330篇 |
2013年 | 11697篇 |
2012年 | 13241篇 |
2011年 | 13625篇 |
2010年 | 10333篇 |
2009年 | 10666篇 |
2008年 | 10283篇 |
2007年 | 11477篇 |
2006年 | 9372篇 |
2005年 | 7862篇 |
2004年 | 6458篇 |
2003年 | 5227篇 |
2002年 | 4164篇 |
2001年 | 3456篇 |
2000年 | 2940篇 |
1999年 | 2345篇 |
1998年 | 1914篇 |
1997年 | 1602篇 |
1996年 | 1271篇 |
1995年 | 1033篇 |
1994年 | 872篇 |
1993年 | 681篇 |
1992年 | 590篇 |
1991年 | 429篇 |
1990年 | 407篇 |
1989年 | 308篇 |
1988年 | 210篇 |
1987年 | 117篇 |
1986年 | 93篇 |
1985年 | 91篇 |
1984年 | 95篇 |
1983年 | 92篇 |
1982年 | 92篇 |
1981年 | 46篇 |
1980年 | 55篇 |
1979年 | 45篇 |
1978年 | 25篇 |
1977年 | 27篇 |
1959年 | 24篇 |
1951年 | 25篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
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. 相似文献
92.
This study assesses the potential of energy flexibility of space heating and cooling for a typical household under different geographical conditions in Portugal. The proposed approach modifies the demand through the optimization of the thermostat settings using a genetic algorithm to reduce either operational costs or interaction with the grid. The results show that the used energy flexibility indicator expresses the available potential and that flexibility depends on several factors, namely: i) thermal inertia of the archetypical household; ii) the time of use electricity tariffs; iii) users’ comfort boundaries; and iv) the geographical location of the houses. 相似文献
93.
We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse. 相似文献
94.
This paper proposes a novel optimization algorithm inspired by the ions motion in nature. In fact, the proposed algorithm mimics the attraction and repulsion of anions and cations to perform optimization. The proposed algorithm is designed in such a way to have the least tuning parameters, low computational complexity, fast convergence, and high local optima avoidance. The performance of this algorithm is benchmarked on 10 standard test functions and compared to four well-known algorithms in the literature. The results demonstrate that the proposed algorithm is able to show very competitive results and has merits in solving challenging optimization problems. 相似文献
95.
The paper focuses on the adaptive relational association rule mining problem. Relational association rules represent a particular type of association rules which describe frequent relations that occur between the features characterizing the instances within a data set. We aim at re-mining an object set, previously mined, when the feature set characterizing the objects increases. An adaptive relational association rule method, based on the discovery of interesting relational association rules, is proposed. This method, called ARARM (Adaptive Relational Association Rule Mining) adapts the set of rules that was established by mining the data before the feature set changed, preserving the completeness. We aim to reach the result more efficiently than running the mining algorithm again from scratch on the feature-extended object set. Experiments testing the method's performance on several case studies are also reported. The obtained results highlight the efficiency of the ARARM method and confirm the potential of our proposal. 相似文献
96.
Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search. 相似文献
97.
The optimization of energy consumption, with consequent cost reduction, is one of the main challenges for the present and future smart grid. Demand response (DR) program is expected to be vital in home energy management system (HEMS) which aims to schedule the operation of appliances to save energy costs by considering customer convenience as well as characteristics of electric appliances. The DR program is a challenging optimization problem especially when the formulations are non-convex or NP-hard problems. In order to solve this challenging optimization problem efficiently, an effective heuristic approach is proposed to achieve a near optimal solution with low computational costs. Different from previously proposed methods in literatures which are not suitable to be run in embedded devices such as a smart meter. The proposed algorithm can be implemented in an embedded device which has severe limitations on memory size and computational power, and can get an optimal value in real-time. Numerical studies were carried out with the data simulating practical scenarios are provided to demonstrate the effectiveness of the proposed method. 相似文献
98.
Artificial bee colony (ABC) algorithm has several characteristics that make it more attractive than other bio-inspired methods. Particularly, it is simple, it uses fewer control parameters and its convergence is independent of the initial conditions. In this paper, a novel artificial bee colony based maximum power point tracking algorithm (MPPT) is proposed. The developed algorithm, does not allow only overcoming the common drawback of the conventional MPPT methods, but it gives a simple and a robust MPPT scheme. A co-simulation methodology, combining Matlab/Simulink™ and Cadence/Pspice™, is used to verify the effectiveness of the proposed method and compare its performance, under dynamic weather conditions, with that of the Particle Swarm Optimization (PSO) based MPPT algorithm. Moreover, a laboratory setup has been realized and used to experimentally validate the proposed ABC-based MPPT algorithm. Simulation and experimental results have shown the satisfactory performance of the proposed approach. 相似文献
99.
The paper proposes a limit analysis approach to define the ultimate load capacity of orthotropic composite laminates under biaxial loading and plane stress conditions. A lower bound to the collapse load multiplier is computed by solving a maximization nonlinear problem, according to the static theorem of limit analysis. To set up the optimization problem a stress field distribution is hypothesized at lamina level, moreover inter-lamina stresses are also considered. The effectiveness and validity of the proposed approach is shown by comparing the obtained numerical predictions both with available experimental data and with other numerical results carried out by means of a different numerical lower bound approach. 相似文献
100.