全文获取类型
收费全文 | 115篇 |
免费 | 7篇 |
专业分类
电工技术 | 11篇 |
化学工业 | 5篇 |
金属工艺 | 24篇 |
机械仪表 | 5篇 |
建筑科学 | 1篇 |
能源动力 | 6篇 |
轻工业 | 7篇 |
水利工程 | 1篇 |
无线电 | 2篇 |
一般工业技术 | 15篇 |
冶金工业 | 7篇 |
自动化技术 | 38篇 |
出版年
2024年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 1篇 |
2018年 | 7篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 4篇 |
2013年 | 16篇 |
2012年 | 8篇 |
2011年 | 7篇 |
2010年 | 6篇 |
2009年 | 6篇 |
2008年 | 3篇 |
2007年 | 5篇 |
2006年 | 4篇 |
2005年 | 2篇 |
2003年 | 2篇 |
2002年 | 1篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1986年 | 1篇 |
排序方式: 共有122条查询结果,搜索用时 15 毫秒
61.
The Quadratic Assignment Problem (QAP) is a difficult and important problem studied in the domain of combinatorial optimisation. It is possible to solve QAP instances with 10--20 facilities using exhaustive parallel algorithms within a few days on a cluster machine. However, large QAP instances with more than 100 facilities are not solvable using exhaustive techniques. We have explored a variety of Genetic Algorithm crossover operators for this problem and verified its performance experimentally using well-known instances from the QAPLIB library. By increasing the number of processors, generations and population sizes we have been able to find solutions that are the same as (or very close to) the best reported solutions for large QAP instances in QAPLIB. In order to parallelise the Genetic Algorithm we generate and evolve separate solution pools on each cluster processor, using an island model. This model exchanges 10% of each processor’s solutions at the initial stages of optimisation. We show experimentally that both execution times and solution qualities are improved for large QAP instances by using our Island Parallel Genetic Algorithm. 相似文献
62.
Efficient carrier collection in the core/shell nanowire (nanorod) arrays requires a high quality interface between core and shell materials. A highly conformal shell layer around nanorods can lead to fast dynamic response in photoconductive devices by a radial charge flow. Therefore, choice of the deposition technique for the conformal shell layer becomes crucial. In this study, the dynamic response of indium sulfide (In2S3) nanorods/silver (Ag) core/shell devices is compared in which Ag shell layers are deposited by different physical vapor deposition (PVD) techniques. In2S3 nanorods are fabricated by glancing angle deposition. The core/shell devices with Ag shell sputtered at a relatively high working gas pressure (≈3 × 10−2 mbar) produce the highest photocurrent compared to other devices in which more directional incident flux (with working gas pressure of ≈3 × 10−3 mbar) is utilized for Ag shell layer. The reduced transit times indicate a conformal shell achieved by the high pressure sputtering technique that has a wide angular distribution flux. In addition, a more directional flux yet with a small angle (≈30°) incidence with respect to the substrate surface normal also helps increase the photocurrent. Such simple and scalable PVD techniques are shown to offer alternative fabrication approaches in producing high quality core/shell nanostructures. 相似文献
63.
Parallel clustering of high dimensional data by integrating multi-objective genetic algorithm with divide and conquer 总被引:2,自引:2,他引:0
This paper applies divide and conquer approach in an iterative way to handle the clustering process. The target is a parallelized
effective and efficient approach that produces the intended clustering result. We achieve scalability by first partitioning
a large dataset into subsets of manageable sizes based on the specifications of the machine to be used in the clustering process;
then cluster the partitions separately in parallel. The centroid of each obtained cluster is treated like the root of a tree
with instances in its cluster as leaves. The partitioning and clustering process is iteratively applied on the centroids with
the trees growing up until we get the final clustering; the outcome is a forest with one tree per cluster. Finally, a conquer
process is performed to get the actual intended clustering, where each instance (leaf node) belongs to the final cluster represented
by the root of its tree. We use multi-objective genetic algorithm combined with validity indices to decide on the number of
classes. This approach fits well for interactive online clustering. It facilitates for incremental clustering because chunks
of instances are clustered as stand alone sets, and then the results are merged with existing clusters. This is attractive
and feasible because we consider the clustering of only centroids after the first clustering stage. The reported test results
demonstrate the applicability and effectiveness of the proposed approach. 相似文献
64.
Tansel Yucelen Wassim M. Haddad 《International Journal of Adaptive Control and Signal Processing》2012,26(11):1024-1055
In this paper, a new adaptive control architecture for linear and nonlinear uncertain dynamical systems is developed to address the problem of high‐gain adaptive control. Specifically, the proposed framework involves a new and novel controller architecture involving a modification term in the update law that minimizes an error criterion involving the distance between the weighted regressor vector and the weighted system error states. This modification term allows for fast adaptation without hindering system robustness. In particular, we show that the governing tracking closed‐loop system error equation approximates a Hurwitz linear time‐invariant dynamical system with input–output signals. This key feature of our framework allows for robust stability analysis of the proposed adaptive control law using system theory. We further show that by properly choosing the design parameters in the modification term, we can guarantee a desired bandwidth of the adaptive controller, guaranteed transient closed‐loop performance, and an a priori characterization of the size of the ultimate bound of the closed‐loop system trajectories. Several illustrative numerical examples are provided to demonstrate the efficacy of the proposed approach. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
65.
Tansel Tunçay Süleyman Tekeli Dursun Özyürek Derya Dişpinar 《International Journal of Cast Metals Research》2017,30(1):20-29
Cooling conditions and inclusions are of the most important factors that affect mechanical properties of cast aluminium alloys. This study investigated the effect of secondary dendrite arm spacing (SDAS) on the shape of pores (i.e. bifilm unravelling) and the mechanical properties of cast A356 alloy. Different cooling conditions were established by electrolytic copper chill, H13 steel chill and insulated ceramic that was placed in the mould cavity. SDAS and shape of pores were investigated by optical microscopy. The fracture surfaces of tensile test samples were analysed by SEM and EDX. Weibull two-parameter statistical method was used to assess the tensile properties. Results show that mechanical properties were dominantly affected by pore morphology that was formed by bifilms. Increasing the cooling rate (i.e. decreasing SDAS), the unravelling of bifilms delayed which decreased porosity formation significantly. 相似文献
66.
Tansel A.U. Arkun M.E. Ozsoyoglu G. 《IEEE transactions on pattern analysis and machine intelligence》1989,15(4):464-478
The authors propose a graphical query language, Time-by-Example (TBE), which has suitable constructs for interacting with historical relational databases in a natural way. TBE is user-friendly. It follows the graphical, two-dimensional approach of such previous languages as Query-by-Example (QBE), Aggregation-by-Example (ABE), and Summary-Table-by-Example (STBE). TBE also uses the hierarchical window (subquery) concept of ABE and STBE. TBE manipulates triple-valued (set-triple-valued) attributes and historical relations. Set-theoretic expressions are followed to deal with time intervals. The BNF specification for TBE is given 相似文献
67.
The efficiency of metaheuristic algorithms depends significantly on the number of fitness value evaluations performed on candidate solutions. In addition to various intelligent techniques used to obtain better results, parallelization of calculations can substantially improve the solutions in cases where the problem is NP-hard and requires many evaluations. This study proposes a new parallel tabu search method for solving the Maximum Vertex Weight Clique Problem (MVWCP) on the Non-Uniform Memory Access (NUMA) architectures using the OpenMP parallel programming paradigm. Achieving scalability in the NUMA architectures presents significant challenges due to the high complexity of their memory systems, which can lead to performance loss. However, our proposed Tabu-NUMA algorithm provides up to speed-up with 64 cores for ten basic problem instances in DIMACS-W and BHOSLIB-W benchmarks. And it improves the performance of the serial Multi Neighborhood Tabu Search (MN/TS) algorithm for 38 problem instances in DIMACS-W and BHOSLIB-W benchmarks. We further evaluate our algorithm on larger datasets with thousands of edges and vertices from Network Data Repository benchmark problem instances, and we report significant improvements in terms of speed up. Our results confirm that the Tabu-NUMA algorithm is among the best recent algorithms for solving MVWCP on the NUMA architectures. 相似文献
68.
The caching of frequently accessed data items on the client side is an effective technique to improve performance in a mobile
environment. Caching data in a wireless mobile computer can significantly reduce the bandwidth requirement. However, cache
content needs to be validated; classical cache invalidation strategies are not suitable for mobile environments due to the
disconnection frequency and mobility of the mobile clients. Attractive cache invalidation techniques are based on invalidation
reports (IRs). But, IR-based cache invalidation schemes result in considerable consumption of uplink and download bandwidth.
In this paper, we address these problems by presenting a new energy-efficient cache invalidation method for the wireless mobile
environment. The new cache invalidation scheme is called Adaptive Energy Efficient Cache Invalidation Scheme (AEECIS). The
algorithm is adaptive since it changes the data dissemination strategy based on the current conditions. To reduce the bandwidth
requirement, the server transmits in one of three modes: slow, fast or super-fast. The mode is selected based on thresholds specified for time and the number of clients requesting updated objects. An efficient
implementation of AEECIS is presented and simulations have been carried out to evaluate its caching effectiveness. The results
demonstrate that it can substantially improve mobile caching by reducing the communication bandwidth (thus energy consumption)
for query processing. Also, the reported results demonstrate that compared to previous IR-based schemes, AEECIS can significantly
improve the bandwidth consumption and the number of uplink requests.
相似文献
Reda AlhajjEmail: |
69.
K. Merve Dogan Tansel Yucelen Jonathan A. Muse 《International Journal of Adaptive Control and Signal Processing》2021,35(3):342-356
While adaptive control methods have the capability to suppress the effect of system uncertainties without excessive reliance on dynamical system models, their stability can be adversely affected in the presence of coupled dynamics. Motivated by this standpoint, the contribution of this article is a decoupling approach for model reference adaptive control algorithms. The key feature of the proposed framework is that it guarantees asymptotic convergence between the trajectories of an uncertain dynamical system and a given reference model without relying on any measurements from the coupled dynamics under a tight sufficient stability condition. We also provide a generalization to address the uncertainty in the control effectiveness matrix, where the resulting sufficient stability condition in this case relies on linear matrix inequalities. Finally, numerical examples are provided to illustrate the efficacy of the presented theoretical results. 相似文献
70.
Hilal Isleroglu Tansel Kemerlı-Kalbaran Özgül Özdestan-Ocak Ali Üren Figen Kaymak-Ertekin 《International Journal of Food Properties》2016,19(5):1139-1153
Beef (Semitendinosus muscle) was cooked in natural convection, forced convection and steam assisted hybrid oven and saturated steam oven at different oven temperatures until the geometric center of samples reached different end temperatures. Heterocyclic amine (HCA) compounds formation, soluble protein degradation kinetics, cook value, changes in fat content, surface colour and overall acceptance of cooked beef were determined. Soluble protein degradation of beef was considered as first order reaction kinetics and the reaction rate constants, k, were determined in the range of 0.014-0.052 min?1. In steam assisted hybrid oven had higher reaction rate constants compared to that of the convection ovens. The effect of cooking temperature on soluble protein degradation for natural convection, forced convection and steam assisted hybrid oven followed the Arrhenius type of equation with activation energies of 12.45, 14.57 and 60.16 kJ/mol, respectively. Lower HCAs contents, shorter cooking times, lower cook values and lower fat retention were obtained by steam assisted hybrid oven cooking. Steam assisted hybrid cooking could be considered as an alternative cooking method to obtain a healthier product without compromising the eating habits of conventional methods due to better appearance (moderate burned surface) than saturated steam oven samples and a product retaining the most of the nutritional values. 相似文献