全文获取类型
收费全文 | 1668篇 |
免费 | 92篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 21篇 |
综合类 | 3篇 |
化学工业 | 423篇 |
金属工艺 | 53篇 |
机械仪表 | 87篇 |
建筑科学 | 78篇 |
矿业工程 | 3篇 |
能源动力 | 185篇 |
轻工业 | 194篇 |
水利工程 | 9篇 |
石油天然气 | 5篇 |
无线电 | 123篇 |
一般工业技术 | 273篇 |
冶金工业 | 57篇 |
原子能技术 | 7篇 |
自动化技术 | 244篇 |
出版年
2024年 | 8篇 |
2023年 | 13篇 |
2022年 | 28篇 |
2021年 | 53篇 |
2020年 | 55篇 |
2019年 | 63篇 |
2018年 | 66篇 |
2017年 | 70篇 |
2016年 | 72篇 |
2015年 | 50篇 |
2014年 | 74篇 |
2013年 | 145篇 |
2012年 | 91篇 |
2011年 | 128篇 |
2010年 | 94篇 |
2009年 | 128篇 |
2008年 | 115篇 |
2007年 | 102篇 |
2006年 | 68篇 |
2005年 | 49篇 |
2004年 | 27篇 |
2003年 | 32篇 |
2002年 | 34篇 |
2001年 | 29篇 |
2000年 | 22篇 |
1999年 | 24篇 |
1998年 | 23篇 |
1997年 | 15篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 11篇 |
1993年 | 4篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 4篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1969年 | 1篇 |
1956年 | 1篇 |
排序方式: 共有1765条查询结果,搜索用时 343 毫秒
31.
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. 相似文献
32.
33.
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. 相似文献
34.
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%). 相似文献
35.
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. 相似文献
36.
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. 相似文献
37.
This article aims to explore the impact of the integration of risk factors into delayed milestones for construction projects. A simulation model was developed to determine the impact of schedule variability on cost estimation. To generate random scenarios a Monte Carlo Simulation (MCS) technique was applied. The developed model computes the cost impact of delayed milestone in the expected budget. Using a risk integration approach revealed the critical time frame that may lead to a budget deficit for a project. As a result, a number of cost-sensitive risk factors and schedule delays were identified for the critical time period where the risk of budget deficit increases. The method of integration proposed in this article highlights the priority of risk factors and schedule delays for construction contracts involving Payments at Event Occurrences (PEO). Consequently, the developed method can be useful for practitioners in anticipation of potential increase of costs, hence, prevention of failure due to budget deficit. 相似文献
38.
Saadettin Erhan Kesen Sanchoy K. Das Zülal Güngör 《Computers & Operations Research》2010,37(6):1148-1156
We present a genetic algorithm (GA) based heuristic approach for job scheduling in virtual manufacturing cells (VMCs). In a VMC, machines are dedicated to a part as in a regular cell, but machines are not physically relocated in a contiguous area. Cell configurations are therefore temporary, and assignments are made to optimize the scheduling objective under changing demand conditions. We consider the case where there are multiple jobs with different processing routes. There are multiple machine types with several identical machines in each type and are located in different locations in the shop floor. Scheduling objective is weighted makespan and total traveling distance minimization. The scheduling decisions are the (i) assignment of jobs to the machines, and (ii) the job start time at each machine. To evaluate the effectiveness of the GA heuristic we compare it with a mixed integer programming (MIP) solution. This is done on a wide range of benchmark problem. Computational results show that GA is promising in finding good solutions in very shorter times and can be substituted in the place of MIP model. 相似文献
39.
This paper proposes the Mobility-Aware Resource Reservation Protocol (MARSVP) in which mobility and QoS signaling are performed as a single functional block. The key concept of MARSVP is to convey mobility-specific information (binding updates and their associated acknowledgments) by using newly defined RSVP objects embedded in existing RSVP messages. An appealing feature of MARSVP is that it adheres to the current RSVP standard (RFC 2205) and thus requires minimal changes to end nodes without affecting any of the conventional RSVP routers in between. The proposed mechanism is evaluated using a simulation model for application-level performance and an analytical model for network-level signaling cost. Simulation results indicate a 27.9% improvement in QoS interruption when using Mobile IPv6 (MIPv6), 12.5% when using Hierarchical Mobile IPv6 (HMIPv6), and no improvement when using Fast Handovers for MIPv6 (FMIPv6). On the network-level, signaling cost savings of 9.4% and 11.9% are achieved for MIPv6 and HMIPv6, respectively, while FMIPv6 achieves savings of 17.9% when using Voice-over-IP traffic and 26.7% for Video-over-IP traffic. The results of the conducted studies indicate MARSVP’s superiority to conventional RSVP when deployed over wireless networks. 相似文献
40.
In this paper, classification rule mining which is one of the most studied tasks in data mining community has been modeled as a multi-objective optimization problem with predictive accuracy and comprehensibility objectives. A multi-objective chaotic particle swarm optimization (PSO) method has been introduced as a search strategy to mine classification rules within datasets. The used extension to PSO uses similarity measure for neighborhood and far-neighborhood search to store the global best particles found in multi-objective manner. For the bi-objective problem of rule mining of high accuracy/comprehensibility, the multi-objective approach is intended to allow the PSO algorithm to return an approximation to the upper accuracy/comprehensibility border, containing solutions that are spread across the border. The experimental results show the efficiency of the algorithm. 相似文献