全文获取类型
收费全文 | 1436篇 |
免费 | 85篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 18篇 |
综合类 | 3篇 |
化学工业 | 313篇 |
金属工艺 | 45篇 |
机械仪表 | 65篇 |
建筑科学 | 78篇 |
矿业工程 | 2篇 |
能源动力 | 183篇 |
轻工业 | 196篇 |
水利工程 | 6篇 |
石油天然气 | 4篇 |
无线电 | 110篇 |
一般工业技术 | 224篇 |
冶金工业 | 59篇 |
原子能技术 | 4篇 |
自动化技术 | 216篇 |
出版年
2024年 | 7篇 |
2023年 | 16篇 |
2022年 | 28篇 |
2021年 | 52篇 |
2020年 | 51篇 |
2019年 | 66篇 |
2018年 | 63篇 |
2017年 | 65篇 |
2016年 | 63篇 |
2015年 | 52篇 |
2014年 | 64篇 |
2013年 | 139篇 |
2012年 | 76篇 |
2011年 | 115篇 |
2010年 | 82篇 |
2009年 | 105篇 |
2008年 | 97篇 |
2007年 | 75篇 |
2006年 | 56篇 |
2005年 | 44篇 |
2004年 | 18篇 |
2003年 | 26篇 |
2002年 | 23篇 |
2001年 | 22篇 |
2000年 | 19篇 |
1999年 | 16篇 |
1998年 | 22篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1978年 | 2篇 |
1974年 | 1篇 |
1956年 | 1篇 |
排序方式: 共有1526条查询结果,搜索用时 31 毫秒
21.
22.
23.
Ahmet?Erdem?Sar?yüceEmail author Bu?ra?Gedik Gabriela?Jacques-Silva Kun-Lung?Wu ümit?V.??atalyürek 《Data mining and knowledge discovery》2016,30(4):819-847
A community within a graph can be broadly defined as a set of vertices that exhibit high cohesiveness (relatively high number of edges within the set) and low conductance (relatively low number of edges leaving the set). Community detection is a fundamental graph processing analytic that can be applied to several application domains, including social networks. In this context, communities are often overlapping, as a person can be involved in more than one community (e.g., friends, and family); and evolving, since the structure of the network changes. We address the problem of streaming overlapping community detection, where the goal is to maintain communities in the presence of streaming updates. This way, the communities can be updated more efficiently. To this end, we introduce SONIC—a find-and-merge type of community detection algorithm that can efficiently handle streaming updates. SONIC first detects when graph updates yield significant community changes. Upon the detection, it updates the communities via an incremental merge procedure. The SONIC algorithm incorporates two additional techniques to speed-up the incremental merge; min-hashing and inverted indexes. Results show that SONIC can provide high quality overlapping communities, while handling streaming updates several orders of magnitude faster than the alternatives performing from-scratch computation. 相似文献
24.
25.
26.
Asmaa Al-Naqi Ahmet T. Erdogan Tughrul Arslan 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2013,17(7):1145-1157
This paper presents a new adaptive algorithm that aims to control the exploration/exploitation trade-off dynamically. The algorithm is designed based on three-dimensional cellular genetic algorithms (3D-cGAs). In this study, our methodology is based on the change in the global selection pressure induced by dynamic tuning of the local selection rate. The parameter tuning of the local selection method is a way to define the global selection pressure. A diversity speed measure is used to guide the algorithm. Therefore, the integration of existing techniques helps in achieving our aims. A benchmark of well-known continuous test functions and real world problems was selected to investigate the effectiveness of the algorithm proposed. In addition, we provide a comparison between the proposed algorithm and other static and dynamic algorithms in order to study the different effects on the performance of the algorithms. Overall, the results show that the proposed algorithm provides the most desirable performance in terms of efficiency, efficacy, and speed for most problems considered. The results also confirm that problems of various characteristics require different selection pressures, which are difficult to be identified. 相似文献
27.
Abstract: Application of the Doppler ultrasound technique in the diagnosis of heart diseases has been increasing in the last decade since it is non‐invasive, practicable and reliable. In this study, a new approach based on the discrete hidden Markov model (DHMM) is proposed for the diagnosis of heart valve disorders. For the calculation of hidden Markov model (HMM) parameters according to the maximum likelihood approach, HMM parameters belonging to each class are calculated by using training samples that only belong to their own classes. In order to calculate the parameters of DHMMs, not only training samples of the related class but also training samples of other classes are included in the calculation. Therefore HMM parameters that reflect a class's characteristics are more represented than other class parameters. For this aim, the approach was to use a hybrid method by adapting the Rocchio algorithm. The proposed system was used in the classification of the Doppler signals obtained from aortic and mitral heart valves of 215 subjects. The performance of this classification approach was compared with the classification performances in previous studies which used the same data set and the efficiency of the new approach was tested. The total classification accuracy of the proposed approach (95.12%) is higher than the total accuracy rate of standard DHMM (94.31%), continuous HMM (93.5%) and support vector machine (92.67%) classifiers employed in our previous studies and comparable with the performance levels of classifications using artificial neural networks (95.12%) and fuzzy‐C‐means/CHMM (95.12%). 相似文献
28.
The scale of large neuronal network simulations is memory limited due to the need to store connectivity information: connectivity storage grows as the square of neuron number up to anatomically relevant limits. Using the NEURON simulator as a discrete-event simulator (no integration), we explored the consequences of avoiding the space costs of connectivity through regenerating connectivity parameters when needed: just in time after a presynaptic cell fires. We explored various strategies for automated generation of one or more of the basic static connectivity parameters: delays, postsynaptic cell identities, and weights, as well as run-time connectivity state: the event queue. Comparison of the JitCon implementation to NEURON's standard NetCon connectivity method showed substantial space savings, with associated run-time penalty. Although JitCon saved space by eliminating connectivity parameters, larger simulations were still memory limited due to growth of the synaptic event queue. We therefore designed a JitEvent algorithm that added items to the queue only when required: instead of alerting multiple postsynaptic cells, a spiking presynaptic cell posted a callback event at the shortest synaptic delay time. At the time of the callback, this same presynaptic cell directly notified the first postsynaptic cell and generated another self-callback for the next delay time. The JitEvent implementation yielded substantial additional time and space savings. We conclude that just-in-time strategies are necessary for very large network simulations but that a variety of alternative strategies should be considered whose optimality will depend on the characteristics of the simulation to be run. 相似文献
29.
Nedim Muzoğlu Ahmet Mesrur Halefoğlu Muhammed Onur Avci Melike Kaya Karaaslan Bekir Sıddık Binboğa Yarman 《Expert Systems》2023,40(1):e13141
Since the first case of COVID-19 was reported in December 2019, many studies have been carried out on artificial intelligence for the rapid diagnosis of the disease to support health services. Therefore, in this study, we present a powerful approach to detect COVID-19 and COVID-19 findings from computed tomography images using pre-trained models using two different datasets. COVID-19, influenza A (H1N1) pneumonia, bacterial pneumonia and healthy lung image classes were used in the first dataset. Consolidation, crazy-paving pattern, ground-glass opacity, ground-glass opacity and consolidation, ground-glass opacity and nodule classes were used in the second dataset. The study consists of four steps. In the first two steps, distinctive features were extracted from the final layers of the pre-trained ShuffleNet, GoogLeNet and MobileNetV2 models trained with the datasets. In the next steps, the most relevant features were selected from the models using the Sine–Cosine optimization algorithm. Then, the hyperparameters of the Support Vector Machines were optimized with the Bayesian optimization algorithm and used to reclassify the feature subset that achieved the highest accuracy in the third step. The overall accuracy obtained for the first and second datasets is 99.46% and 99.82%, respectively. Finally, the performance of the results visualized with Occlusion Sensitivity Maps was compared with Gradient-weighted class activation mapping. The approach proposed in this paper outperformed other methods in detecting COVID-19 from multiclass viral pneumonia. Moreover, detecting the stages of COVID-19 in the lungs was an innovative and successful approach. 相似文献
30.
The assembly line worker assignment and balancing problem type-II (ALWABP-2) occurs when workers and tasks (where task times depend on workers’ skills) are to be simultaneously assigned to a fixed number of workstations with the goal of minimising the cycle time. In this study, a two-phase variable neighbourhood search (VNS) algorithm is proposed to solve the ALWABP-2 due to the NP-hard nature of this problem. In the first phase of the algorithm, a VNS approach is applied to assign tasks to workstations with the aim of minimising the cycle time while in the second phase, a variable neighbourhood descent method is applied to assign workers to workstations. The performance of the proposed algorithm is tested on well-known benchmark instances. In addition, the proposed algorithm has been used to solve a real case study from a consumer electronics company that manufactures LCD TVs. The results show that the algorithm is superior to the methods reported in the literature in terms of its higher efficiency and robustness. Furthermore, the algorithm is easy to implement and significantly improves the performance of the final assembly line for the investigated LCD TV real case study. 相似文献