全文获取类型
收费全文 | 960篇 |
免费 | 57篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 14篇 |
综合类 | 1篇 |
化学工业 | 243篇 |
金属工艺 | 19篇 |
机械仪表 | 34篇 |
建筑科学 | 27篇 |
矿业工程 | 3篇 |
能源动力 | 31篇 |
轻工业 | 17篇 |
水利工程 | 5篇 |
石油天然气 | 3篇 |
无线电 | 74篇 |
一般工业技术 | 287篇 |
冶金工业 | 40篇 |
原子能技术 | 19篇 |
自动化技术 | 202篇 |
出版年
2024年 | 1篇 |
2023年 | 12篇 |
2022年 | 32篇 |
2021年 | 45篇 |
2020年 | 29篇 |
2019年 | 29篇 |
2018年 | 25篇 |
2017年 | 33篇 |
2016年 | 37篇 |
2015年 | 32篇 |
2014年 | 42篇 |
2013年 | 57篇 |
2012年 | 63篇 |
2011年 | 79篇 |
2010年 | 39篇 |
2009年 | 50篇 |
2008年 | 59篇 |
2007年 | 52篇 |
2006年 | 47篇 |
2005年 | 39篇 |
2004年 | 40篇 |
2003年 | 33篇 |
2002年 | 24篇 |
2001年 | 14篇 |
2000年 | 10篇 |
1999年 | 14篇 |
1998年 | 19篇 |
1997年 | 9篇 |
1996年 | 11篇 |
1995年 | 12篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有1019条查询结果,搜索用时 93 毫秒
21.
Andrei Shchegrov John Khaydarov Stepan Essaian Greg Nemet Suren Soghomonyan Hakob Danielyan Armen Poghosyan Gevorg Gabrielyan 《Journal of the Society for Information Display》2010,18(8):589-595
Abstract— A novel green laser source, based on a monolithic cavity microchip laser platform, has been developed. The laser is designed to be a part of a miniature and efficient RGB light source for microdisplay‐based mobile projector devices. The use of highly efficient, periodically poled MgO‐doped lithium niobate as the non‐linear frequency doubler allows for a significant increase in the overall efficiency of the green microchip laser. Specifically, a 50–150‐mW green output with a wall‐plug efficiency exceeding 10% in the temperature range of greater than 40°C has been demonstrated. A compact package for this laser source with a volume less than 0.33 cm3 is discussed and results of performance tests are presented. 相似文献
22.
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. 相似文献
23.
24.
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. 相似文献
25.
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. 相似文献
26.
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. 相似文献
27.
Molecular models of all known subtypes (A1, A2A, A2B, and A3) of the human adenosine receptors were built in homology with bovine rhodopsin. These models include the transmembrane domain as well as all extracellular and intracellular hydrophilic loops and terminal domains. The molecular docking of adenosine and 46 selected derivatives was performed for each receptor subtype. A binding mode common for all studied agonists was proposed, and possible explanations for differences in the ligand activities were suggested. 相似文献
28.
Andrei?SharfEmail author Marina?Blumenkrants Ariel?Shamir Daniel?Cohen-Or 《The Visual computer》2006,22(9-11):835-844
Editing and manipulation of existing 3D geometric objects are a means to extend their repertoire and promote their availability. Traditionally, tools to compose or manipulate objects defined by 3D meshes are in the realm of artists and experts. In this paper, we introduce a simple and effective user interface for easy composition of 3D mesh-parts for non-professionals. Our technique borrows from the cut-and-paste paradigm where a user can cut parts out of existing objects and paste them onto others to create new designs. To assist the user attach objects to each other in a quick and simple manner, many applications in computer graphics support the notion of “snapping”. Similarly, our tool allows the user to loosely drag one mesh part onto another with an overlap, and lets the system snap them together in a graceful manner. Snapping is accomplished using our Soft-ICP algorithm which replaces the global transformation in the ICP algorithm with a set of point-wise locally supported transformations. The technique enhances registration with a set of rigid to elastic transformations that account for simultaneous global positioning and local blending of the objects. For completeness of our framework, we present an additional simple mesh-cutting tool, adapting the graph-cut algorithm to meshes. 相似文献
29.
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. |
30.