全文获取类型
收费全文 | 418篇 |
免费 | 13篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 6篇 |
综合类 | 2篇 |
化学工业 | 36篇 |
金属工艺 | 12篇 |
机械仪表 | 17篇 |
建筑科学 | 23篇 |
矿业工程 | 2篇 |
能源动力 | 15篇 |
轻工业 | 20篇 |
水利工程 | 9篇 |
石油天然气 | 3篇 |
无线电 | 54篇 |
一般工业技术 | 90篇 |
冶金工业 | 34篇 |
原子能技术 | 5篇 |
自动化技术 | 104篇 |
出版年
2023年 | 6篇 |
2022年 | 7篇 |
2021年 | 17篇 |
2020年 | 18篇 |
2019年 | 18篇 |
2018年 | 13篇 |
2017年 | 22篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 17篇 |
2013年 | 46篇 |
2012年 | 26篇 |
2011年 | 23篇 |
2010年 | 23篇 |
2009年 | 24篇 |
2008年 | 17篇 |
2007年 | 15篇 |
2006年 | 13篇 |
2005年 | 7篇 |
2004年 | 12篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 1篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1976年 | 2篇 |
1974年 | 1篇 |
排序方式: 共有432条查询结果,搜索用时 0 毫秒
1.
Service-oriented computing is the latest software paradigm brought about by the computing revolution. The different viewpoint and granularity of software components used in technologies based on the service-oriented architecture paradigm, compared to traditional object-oriented methodologies makes them better suited to many of the efforts that are being made in the pervasive and ubiquitous computing world. In the NEXUS project we are seeking ways of fusing the SOA and pervasive computing paradigms in order to build intelligent, robust and resilient networks connecting dynamic islands of service resources. 相似文献
2.
A. Kaveh M. A. Sayarinejad 《International journal for numerical methods in engineering》2006,67(7):1012-1043
Recently, four canonical forms have been developed and applied to the dynamics and stability analysis of symmetric frames. In this paper, hyper‐symmetric matrices and specially structured matrices are defined and efficient methods are proposed for the eigensolution of such matrices. Applications are extended to hyper‐graphs and specially structured graphs. Simple methods are developed for calculating the eigenvalues of the Laplacian matrices of such graphs. The developments presented in this paper can also be considered as generalization of Form II and Form III symmetry, previously defined by the authors. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
3.
Prof. Dr. A. Kaveh 《Acta Mechanica》1986,62(1-4):189-196
Summary A combinatorial method is presented for examining the rigidity of planar structures. In this approach, an expansion process is used for the formation of a statically determinate substructure, known as a -tree of a structure. The algorithm of Lováz and Yemini, and the method of Sugihara are employed for the recognition of the elementary subgraphs, during this process.With 4 Figures 相似文献
4.
5.
Parisa Ghaemi Kaveh Shahabi John P. Wilson Farnoush Banaei-Kashani 《GeoInformatica》2014,18(2):229-251
Given a set S of sites and a set O of weighted objects, an optimal location query finds the location(s) where introducing a new site maximizes the total weight of the objects that are closer to the new site than to any other site. With such a query, for instance, a franchise corporation (e.g., McDonald’s) can find a location to open a new store such that the number of potential store customers (i.e., people living close to the store) is maximized. Optimal location queries are computationally complex to compute and require efficient solutions that scale with large datasets. Previously, two specific approaches have been proposed for efficient computation of optimal location queries. However, they both assume p-norm distance (namely, L1 and L2/Euclidean); hence, they are not applicable where sites and objects are located on spatial networks. In this article, we focus on optimal network location (ONL) queries, i.e., optimal location queries in which objects and sites reside on a spatial network. We introduce two complementary approaches, namely EONL (short for Expansion-based ONL) and BONL (short for Bound-based ONL), which enable efficient computation of ONL queries with datasets of uniform and skewed distributions, respectively. Moreover, with an extensive experimental study we verify and compare the efficiency of our proposed approaches with real world datasets, and we demonstrate the importance of considering network distance (rather than p-norm distance) with ONL queries. 相似文献
6.
ProDA employs wavelets to support exact, approximate, and progressive OLAP queries on large multidimensional datasets, while keeping update costs relatively low. ProDA not only supports online execution of ad hoc analytical queries on massive datasets, but also extends the set of supported analytical queries to include the entire family of polynomial aggregate queries as well as the new class of plot queries. 相似文献
7.
Ali Khoshgozaran Ali Khodaei Mehdi Sharifzadeh Cyrus Shahabi 《Knowledge and Information Systems》2008,17(3):265-286
Vector data and in particular road networks are being queried, hosted and processed in many application domains such as in
mobile computing. Many client systems such as PDAs would prefer to receive the query results in unrasterized format without
introducing an overhead on overall system performance and result size. While several general vector data compression schemes
have been studied by different communities, we propose a novel approach in vector data compression which is easily integrated
within a geospatial query processing system. It uses line aggregation to reduce the number of relevant tuples and Huffman
compression to achieve a multi-resolution compressed representation of a road network database. Our experiments performed
on an end-to-end prototype verify that our approach exhibits fast query processing on both client and server sides as well
as high compression ratio.
相似文献
Cyrus ShahabiEmail: |
8.
Zhi Li Kaveh Ahadi Keren Jiang Behzad Ahvazi Peng Li Anthony O.Anyia Ken Cadien Thomas Thundat 《Nano Research》2017,(5):1847-1860
Nanocellulose is a sustainable and eco-friendly nanomaterial derived from renewable biomass.In this study,we utilized the structural advantages of two types of nanocellulose and fabricated freestanding carbonized hybrid nanocellulose films as electrode materials for supercapacitors.The long cellulose nanofibrils (CNFs) formed a macroporous framework,and the short cellulose nanocrystals were assembled around the CNF framework and generated micro/mesopores.This two-level hierarchical porous structure was successfully preserved during carbonization because of a thin atomic layer deposited (ALD) Al2O3 conformal coating,which effectively prevented the aggregation of nanocellulose.These carbonized,partially graphitized nanocellulose fibers were interconnected,forming an integrated and highly conductive network with a large specific surface area of 1,244 m2·g-1.The two-level hierarchical porous structure facilitated fast ion transport in the film.When tested as an electrode material with a high mass loading of 4 mg·cm-2 for supercapacitors,the hierarchical porous carbon film derived from hybrid nanocellulose exhibited a specific capacitance of 170 F.g-1and extraordinary performance at high current densities.Even at a very high current of 50 A·g-1,it retained 65% of its original specific capacitance,which makes it a promising electrode material for high-power applications. 相似文献
9.
Dome structures provide cost-effective solutions for covering large areas without intermediate supports. In this article,
simple procedures are developed to reach the configuration of the geodesic domes. A new definition of dome optimization problems
is given which consists of finding optimal sections for elements (size optimization), optimal height for the crown (geometry
optimization) and the optimum number of elements (topology optimization) under determined loading conditions. In order to
find the optimum design, the recently developed meta-heuristic algorithm, known as the Charged System Search (CSS), is applied
to the optimum design of geodesic domes. The CSS takes into account the nonlinear response of the domes. Using CSS, the optimum
design of the geodesic domes is efficiently performed. 相似文献
10.
In a number of prior papers we described and explored a new pattern recognition method called Margin-Setting that accomplishes
excellent generalization using very few training samples. The result was a multi-round classifier with each round consisting
of a set of hyperspheres such that if a datum fell within a certain hypersphere, it was labeled with one particular class.
Margin-Setting achieves concurrent low Vapnik-Chervonenkis (VC) dimension and high accuracy which is a consequence of partitioning
the training set into smaller sets that make this possible. This paper extends Margin-Setting from hyperspheres to hyperellipsoids
resulting in improved performance. 相似文献