全文获取类型
收费全文 | 1561篇 |
免费 | 57篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 31篇 |
综合类 | 1篇 |
化学工业 | 306篇 |
金属工艺 | 39篇 |
机械仪表 | 35篇 |
建筑科学 | 22篇 |
矿业工程 | 5篇 |
能源动力 | 82篇 |
轻工业 | 93篇 |
水利工程 | 11篇 |
石油天然气 | 1篇 |
无线电 | 195篇 |
一般工业技术 | 318篇 |
冶金工业 | 257篇 |
原子能技术 | 7篇 |
自动化技术 | 219篇 |
出版年
2023年 | 14篇 |
2022年 | 26篇 |
2021年 | 53篇 |
2020年 | 36篇 |
2019年 | 35篇 |
2018年 | 55篇 |
2017年 | 45篇 |
2016年 | 48篇 |
2015年 | 38篇 |
2014年 | 58篇 |
2013年 | 116篇 |
2012年 | 53篇 |
2011年 | 71篇 |
2010年 | 56篇 |
2009年 | 57篇 |
2008年 | 81篇 |
2007年 | 66篇 |
2006年 | 44篇 |
2005年 | 50篇 |
2004年 | 35篇 |
2003年 | 25篇 |
2002年 | 27篇 |
2001年 | 18篇 |
2000年 | 16篇 |
1999年 | 21篇 |
1998年 | 60篇 |
1997年 | 41篇 |
1996年 | 45篇 |
1995年 | 28篇 |
1994年 | 23篇 |
1993年 | 27篇 |
1992年 | 21篇 |
1991年 | 20篇 |
1990年 | 14篇 |
1989年 | 14篇 |
1988年 | 11篇 |
1987年 | 12篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1984年 | 14篇 |
1983年 | 19篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1979年 | 8篇 |
1978年 | 9篇 |
1977年 | 13篇 |
1976年 | 14篇 |
1974年 | 9篇 |
1973年 | 8篇 |
1972年 | 6篇 |
排序方式: 共有1622条查询结果,搜索用时 15 毫秒
21.
Sanjukta Chatterjee 《Computer Physics Communications》2008,179(8):555-561
A new class of transforms, tailored for the hypergeometric series, is proposed and tested on a number of series. From a knowledge of a given number of terms of a sequence, these transforms reproduce the functions with a better accuracy than the Levin-like transforms. Though there exists a correlation between the approximative power of a rational approximant and its ability to predict the leading terms of a series, there are exceptions to this, especially in the case of divergent series. The new transforms can, in most cases, predict a number of extra terms not used in the construction of the approximants. 相似文献
22.
The increasing penetration rate of electric kickboard vehicles has been popularized and promoted primarily because of its clean and efficient features. Electric kickboards are gradually growing in popularity in tourist and education-centric localities. In the upcoming arrival of electric kickboard vehicles, deploying a customer rental service is essential. Due to its free-floating nature, the shared electric kickboard is a common and practical means of transportation. Relocation plans for shared electric kickboards are required to increase the quality of service, and forecasting demand for their use in a specific region is crucial. Predicting demand accurately with small data is troublesome. Extensive data is necessary for training machine learning algorithms for effective prediction. Data generation is a method for expanding the amount of data that will be further accessible for training. In this work, we proposed a model that takes time-series customers’ electric kickboard demand data as input, pre-processes it, and generates synthetic data according to the original data distribution using generative adversarial networks (GAN). The electric kickboard mobility demand prediction error was reduced when we combined synthetic data with the original data. We proposed Tabular-GAN-Modified-WGAN-GP for generating synthetic data for better prediction results. We modified The Wasserstein GAN-gradient penalty (GP) with the RMSprop optimizer and then employed Spectral Normalization (SN) to improve training stability and faster convergence. Finally, we applied a regression-based blending ensemble technique that can help us to improve performance of demand prediction. We used various evaluation criteria and visual representations to compare our proposed model’s performance. Synthetic data generated by our suggested GAN model is also evaluated. The TGAN-Modified-WGAN-GP model mitigates the overfitting and mode collapse problem, and it also converges faster than previous GAN models for synthetic data creation. The presented model’s performance is compared to existing ensemble and baseline models. The experimental findings imply that combining synthetic and actual data can significantly reduce prediction error rates in the mean absolute percentage error (MAPE) of 4.476 and increase prediction accuracy. 相似文献
23.
Selection of a robot for a specific industrial application is one of the most challenging problems in real time manufacturing environment. It has become more and more complicated due to increase in complexity, advanced features and facilities that are continuously being incorporated into the robots by different manufacturers. At present, different types of industrial robots with diverse capabilities, features, facilities and specifications are available in the market. Manufacturing environment, product design, production system and cost involved are some of the most influencing factors that directly affect the robot selection decision. The decision maker needs to identify and select the best suited robot in order to achieve the desired output with minimum cost and specific application ability. This paper attempts to solve the robot selection problem using two most appropriate multi-criteria decision-making (MCDM) methods and compares their relative performance for a given industrial application. The first MCDM approach is ‘VIsekriterijumsko KOmpromisno Rangiranje’ (VIKOR), a compromise ranking method and the other one is ‘ELimination and Et Choice Translating REality’ (ELECTRE), an outranking method. Two real time examples are cited in order to demonstrate and validate the applicability and potentiality of both these MCDM methods. It is observed that the relative rankings of the alternative robots as obtained using these two MCDM methods match quite well with those as derived by the past researchers. 相似文献
24.
Santosh Biswas Dipankar Sarkar Siddhartha Mukhopadhyay Amit Patra 《Discrete Event Dynamic Systems》2010,20(3):349-376
Failure diagnosability has been widely studied for discrete event system (DES) models because of modeling simplicity and computational
efficiency due to abstraction. In the literature it is often held that for diagnosability, such models can be used not only
for systems that fall naturally in the class of DES but also for the ones traditionally treated as continuous variable dynamic
systems. A class of algorithms for failure diagnosability of DES models has been successfully developed for systems where
fairness is not a part of the model. These algorithms are based on detecting cycles in the normal and the failure model that
look identical. However, there exist systems with all transitions fair where the diagnosability condition that hinges upon
this feature renders many failures non-diagnosable although they may actually be diagnosable by transitions out of a cycle.
Hence, the diagnosability conditions based on cycle detection need to be modified to hold for many real-world systems where
all transitions are fair. In this work, however, it is shown by means of an example that a system may have some transitions
fair and some unfair. A new failure diagnosability mechanism is proposed for DES models with both fair and unfair transitions.
Time complexity for deciding diagnosability of DES models with fair and unfair transitions is analyzed and compared with the
time complexities of other DES diagnosability analysis methods reported in the literature. 相似文献
25.
Akhilesh Chander Amitava Chatterjee Patrick Siarry 《Expert systems with applications》2011,38(5):4998-5004
In this paper, we present a new variant of Particle Swarm Optimization (PSO) for image segmentation using optimal multi-level thresholding. Some objective functions which are very efficient for bi-level thresholding purpose are not suitable for multi-level thresholding due to the exponential growth of computational complexity. The present paper also proposes an iterative scheme that is practically more suitable for obtaining initial values of candidate multilevel thresholds. This self iterative scheme is proposed to find the suitable number of thresholds that should be used to segment an image. This iterative scheme is based on the well known Otsu’s method, which shows a linear growth of computational complexity. The thresholds resulting from the iterative scheme are taken as initial thresholds and the particles are created randomly around these thresholds, for the proposed PSO variant. The proposed PSO algorithm makes a new contribution in adapting ‘social’ and ‘momentum’ components of the velocity equation for particle move updates. The proposed segmentation method is employed for four benchmark images and the performances obtained outperform results obtained with well known methods, like Gaussian-smoothing method (Lim, Y. K., & Lee, S. U. (1990). On the color image segmentation algorithm based on the thresholding and the fuzzy c-means techniques. Pattern Recognition, 23, 935–952; Tsai, D. M. (1995). A fast thresholding selection procedure for multimodal and unimodal histograms. Pattern Recognition Letters, 16, 653–666), Symmetry-duality method (Yin, P. Y., & Chen, L. H. (1993). New method for multilevel thresholding using the symmetry and duality of the histogram. Journal of Electronics and Imaging, 2, 337–344), GA-based algorithm (Yin, P. -Y. (1999). A fast scheme for optimal thresholding using genetic algorithms. Signal Processing, 72, 85–95) and the basic PSO variant employing linearly decreasing inertia weight factor. 相似文献
26.
Bhattacharya D Saha S Basu S Chakravarty S Chakravarty A Banerjee D Chakrabarti A 《Proteomics. Clinical applications》2010,4(5):480-488
Purpose: In (hemoglobin, Hb) HbEβ‐thalassemia, HbE (β‐26 Glu→Lys) interacts with β‐thalassemia to produce clinical manifestation of varying severity. This is the first proteomic effort to study changes in protein levels of erythrocytes isolated from HbEβ‐thalassemic patients compared to normal. Experimental design: We have used 2‐DE and MALDI‐MS/MS‐based techniques to investigate the differential proteome profiling of membrane and Hb‐depleted fraction of cytosolic proteins of erythrocytes isolated from the peripheral blood samples of HbEβ‐thalassemia patients and normal volunteers. Results: Our study showed that redox regulators such as peroxiredoxin 2, Cu‐Zn superoxide dismutase and thioredoxin and chaperones such as α‐hemoglobin stabilizing protein and HSP‐70 were upregulated in HbEβ‐thalassemia. We have also observed larger amounts of membrane associated globin chains and indications of disruption of spectrin‐based junctional complex in the membrane skeleton of HbEβ‐thalassemic erythrocytes upon detection of low molecular weight fragments of β‐spectrin and decrease in β‐actin and dematin content. Conclusion and clinical relevance: We have observed interesting changes in the proteomic levels of redox regulators and chaperons in the thalassemic hemolysates and have observed strong correlation or association of the extent of such proteomic changes with HbE levels. This could be important in understanding the role of HbE in disease progression and pathophysiology. 相似文献
27.
28.
Though the network quality-of-service (QoS) metrics are defined in terms of technical parameters (e.g., delay, jitter, bandwidth), they are rather subjective when it comes to the end user. Oftentimes, the end user finds it difficult to express his desired QoS in such technical parameters, though he has a fair idea of what QoS he desires. In this paper, we show how translation functions can be devised and used to translate the user inputs to networking parameters that are used by various layers of the protocol stack. In particular, we consider an ad hoc network and show an interface design that uses translation functions to map user supplied inputs to parameters at the medium access control (MAC) and routing layers. These parameters, in turn, choose the right strategies that particular layer functionality can adopt, such that the QoS desired by the user is achieved. We also compute the associated costs due to the different strategies adopted. We implement the interface on ns-2 and conduct simulation experiments with randomly scattered IEEE 802.11 enabled nodes. Results show the functionality of the interface and demonstrate how delay, throughput, and network lifetime are affected when the end user seeks different levels of QoS. 相似文献
29.
Shelly Aggarwal Braineard Eladi Paul Amitava DasGupta Dhiman Chatterjee 《Microfluidics and nanofluidics》2017,21(1):2
In this paper, performance of piezoelectrically actuated pyramidal valveless micropumps is studied experimentally in detail. Valveless micropumps based on silicon and glass substrate are fabricated using MEMS technology. Two different sizes of micropumps having overall dimensions of 5 mm × 5 mm × 1 mm and 10 mm × 10 mm × 1 mm are fabricated and characterized. In the fabricated micropumps, the thickness of silicon diaphragm is <20 µm which gives the advantage of operating pump at low voltage with excellent stability and consistency. The performance of micropumps in terms of flowrate and backpressure is evaluated for a wide range of driving frequency and actuating voltages. The maximum flowrate of water in the 10-mm micropump is 355 µl/min and backpressure of 3.1 kPa at zero flowrate for an applied voltage of 80 V at frequency 1.05 kHz. The reported micropumps have low footprint, high flowrate and backpressure. Thus, these micropumps are especially suited for biological applications as these can withstand adequate amount of backpressure. Comparative study of the performance of these micropumps with those available in the literature brings out the efficacy of these micropumps. 相似文献
30.
Chatterjee R. Ryder B.G. Landi W.A. 《IEEE transactions on pattern analysis and machine intelligence》2001,27(6):481-512
At each program point, points-to analysis for statically typed object oriented programming languages (e.g., Java, C++) determines those objects to which a reference may refer (or a pointer may point) during execution. Points-to analysis is necessary for any semantics based software tools for object oriented systems. Our new complexity results for points-to analysis distinguish the difficulty of intraprocedural and interprocedural points-to analyses for languages with combinations of single-level types (i.e., types with data members only of primitive type), exceptions with or without subtyping, and dynamic dispatch. Our results include: 1) the first polynomial-time algorithm for points-to analysis in the presence of exceptions that handles a robust subset of Java without threads and can be applied to C++; 2) proof that the above algorithm is safe, in general, and provably precise on programs with single-level types and exceptions without subtyping, but not dynamic dispatch, thus, this case is in P; 3) proof that an interprocedural points-to analysis problem with single-level types and exceptions with subtyping, but without dynamic dispatch, is PSPACE-hard, while the intraprocedural problem is PSPACE-complete. Other complexity characterizations of points-to analysis in programs without exceptions are presented, including an algorithm with worst-case bound of O(n5 ), which improves over the O(n7) worst-case bound achievable from previous approaches of T. Reps et al. (1995) and W.A. Landi and B.G. Ryder (1991) 相似文献