全文获取类型
收费全文 | 539篇 |
免费 | 25篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 7篇 |
综合类 | 2篇 |
化学工业 | 69篇 |
金属工艺 | 18篇 |
机械仪表 | 15篇 |
建筑科学 | 36篇 |
矿业工程 | 2篇 |
能源动力 | 26篇 |
轻工业 | 37篇 |
水利工程 | 16篇 |
石油天然气 | 4篇 |
无线电 | 61篇 |
一般工业技术 | 142篇 |
冶金工业 | 47篇 |
原子能技术 | 5篇 |
自动化技术 | 80篇 |
出版年
2023年 | 6篇 |
2022年 | 8篇 |
2021年 | 22篇 |
2020年 | 24篇 |
2019年 | 25篇 |
2018年 | 25篇 |
2017年 | 30篇 |
2016年 | 23篇 |
2015年 | 23篇 |
2014年 | 34篇 |
2013年 | 58篇 |
2012年 | 34篇 |
2011年 | 26篇 |
2010年 | 36篇 |
2009年 | 25篇 |
2008年 | 20篇 |
2007年 | 20篇 |
2006年 | 12篇 |
2005年 | 7篇 |
2004年 | 10篇 |
2003年 | 3篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 9篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 9篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1976年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有567条查询结果,搜索用时 31 毫秒
1.
A. Kaveh V. Kalatjari 《International journal for numerical methods in engineering》2003,58(5):771-791
In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
2.
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. 相似文献
3.
Airframe riveting is a critical process that requires high levels of process monitoring and quality assurance due to the very
high risk associated with the failure of such joints. This paper describes the development of the enabling technology developed
for a machine vision-based process monitoring system. One of the key factors affecting the performance of a machine vision
system is the quality of the lighting. In the application described in this paper the available lighting was severely limited
by the confined space in which the system had to operate. The problem was also compounded by the reflective nature of the
objects to be examined. The initial images obtained were not suitable for further processing due to the presence of significant
shadows and specular reflections. A novel solution to this problem based on multiple wavelength illumination and signal processing
is presented along with results from experimental trials of the approach. 相似文献
4.
A. Kaveh H. A. Rahimi Bondarabady 《International journal for numerical methods in engineering》2004,60(11):1803-1815
This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
5.
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. 相似文献
6.
Kaveh Ali Biabani Hamedani Kiarash Zaerreza Ataollah 《Engineering with Computers》2021,37(4):3265-3282
Engineering with Computers - In this paper, a recently developed meta-heuristic algorithm, shuffled shepherd optimization algorithm (SSOA), is employed for optimal design of reinforced concrete... 相似文献
7.
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 相似文献
8.
9.
Mojtaba Kaveh Vahid Majazi Dalfard Sajjad Amiri 《Neural computing & applications》2014,24(5):1179-1190
In the present paper, the dynamic facilities layout problem is studied in presence of ambiguity of information flow. Product demand (and consequently material flow) is defined as fuzzy numbers with different membership functions. The problem is modeled in fuzzy programming. Three models of expected value, chance-constrained programming and dependent-chance programming and two hybrid intelligent algorithms are then presented. At the end, efficiency of algorithms for solving fuzzy models of dynamic facilities layout is shown through some numerical examples. 相似文献
10.
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. 相似文献