全文获取类型
收费全文 | 1035篇 |
免费 | 55篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 15篇 |
综合类 | 1篇 |
化学工业 | 262篇 |
金属工艺 | 20篇 |
机械仪表 | 36篇 |
建筑科学 | 27篇 |
矿业工程 | 4篇 |
能源动力 | 31篇 |
轻工业 | 17篇 |
水利工程 | 5篇 |
石油天然气 | 7篇 |
无线电 | 74篇 |
一般工业技术 | 302篇 |
冶金工业 | 48篇 |
原子能技术 | 27篇 |
自动化技术 | 216篇 |
出版年
2023年 | 14篇 |
2022年 | 46篇 |
2021年 | 48篇 |
2020年 | 29篇 |
2019年 | 29篇 |
2018年 | 26篇 |
2017年 | 35篇 |
2016年 | 37篇 |
2015年 | 33篇 |
2014年 | 43篇 |
2013年 | 58篇 |
2012年 | 63篇 |
2011年 | 79篇 |
2010年 | 40篇 |
2009年 | 51篇 |
2008年 | 62篇 |
2007年 | 54篇 |
2006年 | 48篇 |
2005年 | 41篇 |
2004年 | 41篇 |
2003年 | 34篇 |
2002年 | 24篇 |
2001年 | 15篇 |
2000年 | 10篇 |
1999年 | 15篇 |
1998年 | 19篇 |
1997年 | 10篇 |
1996年 | 10篇 |
1995年 | 15篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 3篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 2篇 |
1973年 | 2篇 |
1969年 | 2篇 |
1967年 | 2篇 |
1965年 | 2篇 |
1963年 | 1篇 |
排序方式: 共有1092条查询结果,搜索用时 15 毫秒
11.
Andrei Tchernykh Luz Lozano Uwe Schwiegelshohn Pascal Bouvry Johnatan E. Pecero Sergio Nesmachnow Alexander Yu. Drozdov 《Journal of Grid Computing》2016,14(1):5-22
This paper focuses on a bi-objective experimental evaluation of online scheduling in the Infrastructure as a Service model of Cloud computing regarding income and power consumption objectives. In this model, customers have the choice between different service levels. Each service level is associated with a price per unit of job execution time, and a slack factor that determines the maximal time span to deliver the requested amount of computing resources. The system, via the scheduling algorithms, is responsible to guarantee the corresponding quality of service for all accepted jobs. Since we do not consider any optimistic scheduling approach, a job cannot be accepted if its service guarantee will not be observed assuming that all accepted jobs receive the requested resources. In this article, we analyze several scheduling algorithms with different cloud configurations and workloads, considering the maximization of the provider income and minimization of the total power consumption of a schedule. We distinguish algorithms depending on the type and amount of information they require: knowledge free, energy-aware, and speed-aware. First, to provide effective guidance in choosing a good strategy, we present a joint analysis of two conflicting goals based on the degradation in performance. The study addresses the behavior of each strategy under each metric. We assess the performance of different scheduling algorithms by determining a set of non-dominated solutions that approximate the Pareto optimal set. We use a set coverage metric to compare the scheduling algorithms in terms of Pareto dominance. We claim that a rather simple scheduling approach can provide the best energy and income trade-offs. This scheduling algorithm performs well in different scenarios with a variety of workloads and cloud configurations. 相似文献
12.
Andrei Voronkov 《Journal of Automated Reasoning》1995,15(2):237-265
We present an implementation technique for a class of bottom-up logic procedures. The technique is based oncode trees. It is intended to speed up most important and costly operations, such as subsumption and resolution. As an example, we consider the forward subsumption problem which is the bottleneck of many systems implementing first-order logic.To efficiently implement subsumption, we specialize subsumption algorithms at run time, using theabstract subsumption machine. The abstract subsumption machine makes subsumption-check using sequences of instructions that are similar to the WAM instructions. It gives an efficient implementation of the clause at a time subsumption problem. To implement subsumption on the set at a time basis, we combine sequences of instructions incode trees.We show that this technique yields a new way of indexing clauses. Some experimental results are given.The code trees technique may be used in various procedures, including binary resolution, hyper-resolution, UR-resolution, the inverse method, paramodulation and rewriting, OLDT-resolution, SLD-AL-resolution, bottom-up evaluation of logic programs, and disjunctive logic programs.Supported by Swedish TFR grant No. 93–409 相似文献
13.
14.
Aleksandar Matic Andrei Popleteev Venet Osmani Oscar Mayora-Ibarra 《Pervasive and Mobile Computing》2010,6(6):642-656
The position of mobile users has become highly important information in pervasive computing environments. Indoor localization systems based on Wi–Fi signal strength fingerprinting techniques are widely used in office buildings with an existing Wi–Fi infrastructure. Our previous work has proposed a solution based on exploitation of a FM signal to deal with environments not covered with Wi–Fi signal or environments with only a single Wi–Fi access point. However, a general problem of indoor wireless positioning systems pertains to signal degradation due to the environmental factors affecting signal propagation. Therefore, in order to maintain a desirable level of localization accuracy, it becomes necessary to perform periodic calibrations of the system, which is either time consuming or requires dedicated equipment and expert knowledge. In this paper, we present a comparison of FM versus Wi–Fi positioning systems and a combination of both systems, exploiting their strengths for indoors positioning. We also address the problem of recalibration by introducing a novel concept of spontaneous recalibration and demonstrate it using the FM localization system. Finally, the results related to device orientation and localization accuracy are discussed. 相似文献
15.
16.
In this paper, we present new pointcuts and primitives to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. The two proposed pointcuts allow to identify particular join points in a program's control-flow graph (CFG). The first one is the GAFlow, Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcut of interest. The two proposed primitives are called ExportParameter and ImportParameter and are used to pass parameters between two pointcuts. They allow to analyze a program's call graph in order to determine how to change function signatures for passing the parameters associated with a given security hardening. We find these pointcuts and primitives to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing ones can provide their functionalities. Moreover, we show the viability and correctness of the proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the result of explanatory case studies. 相似文献
17.
Ciprian Iliescu Guolin Xu Elena Barbarini Marioara Avram Andrei Avram 《Microsystem Technologies》2009,15(8):1157-1162
This paper presents a microfluidic device for magnetophoretic separation of red blood cells from blood under continuous flow.
The separation method consists of continuous flow of a blood sample (diluted in PBS) through a microfluidic channel which
presents on the bottom “dots” of ferromagnetic layer. By applying a magnetic field perpendicular on the flowing direction,
the ferromagnetic “dots” generate a gradient of magnetic field which amplifies the magnetic force. As a result, the red blood
cells are captured on the bottom of the microfluidic channel while the rest of the blood is collected at the outlet. Experimental
results show that an average of 95% of red blood cells is trapped in the device. 相似文献
18.
On spiking neural P systems and partially blind counter machines 总被引:1,自引:0,他引:1
A k-output spiking neural P system (SNP) with output neurons, , generates a tuple of positive integers if, starting from the initial configuration, there is a sequence of steps such that during the computation,
each O
i
generates exactly two spikes aa (the times the pair aa are generated may be different for different output neurons) and the time interval between the first a and the second a is n
i
. After the output neurons generate their pairs of spikes, the system eventually halts. We give characterizations of sets
definable by partially blind multicounter machines in terms of k-output SNPs operating in a sequential mode. Slight variations of the models make them universal. 相似文献
19.
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead
of the full set of results leads to efficient approximate algorithms for several applications, such as:
We present and analyze efficient algorithms for obtaining uniform random samples applicable to any search engine that is based
on posting lists and document-at-a-time evaluation. (To our knowledge, all popular Web search engines, for example, Google,
Yahoo Search, MSN Search, Ask, belong to this class.) Furthermore, our algorithm can be modified to follow the modern object-oriented
approach whereby posting lists are viewed as streams equipped with a next method, and the next method for Boolean and other complex queries is built from the next method for primitive terms. In our case we show how to construct a basic sample-next(p) method that samples term posting lists with probability p, and show how to construct sample-next(p) methods for Boolean operators (AND, OR, WAND) from primitive methods. Finally, we test the efficiency and quality of our approach on both synthetic and real-world data.
A preliminary version of this work has appeared in [3].
Work performed while A. Anagnostopoulos and A.Z. Broder were at IBM T. J. Watson Research Center. 相似文献
• | Determining the set of categories in a given taxonomy spanned by the search results; |
• | Finding the range of metadata values associated with the result set in order to enable “multi-faceted search”; |
• | Estimating the size of the result set; |
• | Data mining associations to the query terms. |
20.
Harukazu Yoshino Zeynel Bayindir Joydeep Roy Ben Shaw Heon-ick Ha Andrei Lebed Michael J. Naughton 《Journal of Low Temperature Physics》2006,142(3-4):323-326
A new TTP donor, Me-DH-TTP (2-methyl-5-(1,3-dithiolan-2-yliden)-1,3,4,6-tetrathiapentalene), was designed to realize a system
with large on-site Coulomb repulsion as compared with the previously known bis-fused type TTP donors. Probably as a consequence,
(Me-DH-TTP)2AsF6 exhibits semiconducting behavior from room temperature to liquid helium temperature. By increasing pressure, metallic behavior
appears below 300 K, and with distinct metal-insulator (M-I) transition up to 2.2 GPa. This M-I transition suddenly disappears
beyond 2.5 GPa, and metallic state is stabilized down to 2.6 K. We discuss the possibility of quantum critical point around
2.4 GPa. 相似文献