全文获取类型
收费全文 | 1863篇 |
免费 | 72篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 45篇 |
综合类 | 1篇 |
化学工业 | 329篇 |
金属工艺 | 44篇 |
机械仪表 | 49篇 |
建筑科学 | 32篇 |
矿业工程 | 4篇 |
能源动力 | 81篇 |
轻工业 | 89篇 |
水利工程 | 12篇 |
石油天然气 | 7篇 |
无线电 | 357篇 |
一般工业技术 | 378篇 |
冶金工业 | 212篇 |
原子能技术 | 11篇 |
自动化技术 | 293篇 |
出版年
2024年 | 8篇 |
2023年 | 21篇 |
2022年 | 43篇 |
2021年 | 84篇 |
2020年 | 56篇 |
2019年 | 71篇 |
2018年 | 73篇 |
2017年 | 67篇 |
2016年 | 77篇 |
2015年 | 38篇 |
2014年 | 63篇 |
2013年 | 139篇 |
2012年 | 71篇 |
2011年 | 76篇 |
2010年 | 70篇 |
2009年 | 80篇 |
2008年 | 58篇 |
2007年 | 66篇 |
2006年 | 66篇 |
2005年 | 44篇 |
2004年 | 34篇 |
2003年 | 28篇 |
2002年 | 43篇 |
2001年 | 29篇 |
2000年 | 24篇 |
1999年 | 38篇 |
1998年 | 56篇 |
1997年 | 43篇 |
1996年 | 47篇 |
1995年 | 32篇 |
1994年 | 25篇 |
1993年 | 25篇 |
1992年 | 23篇 |
1991年 | 25篇 |
1990年 | 12篇 |
1989年 | 22篇 |
1988年 | 15篇 |
1987年 | 21篇 |
1986年 | 13篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 13篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 10篇 |
1974年 | 6篇 |
1971年 | 4篇 |
排序方式: 共有1944条查询结果,搜索用时 15 毫秒
41.
Santanu Sarkar 《Information Processing Letters》2010,110(5):178-340
In this paper, we consider RSA with N=pq, where p,q are of same bit size, i.e., q<p<2q. We study the weaknesses of RSA when multiple encryption and decryption exponents are considered with same RSA modulus N. A decade back, Howgrave-Graham and Seifert (CQRE 1999) studied this problem in detail and presented the bounds on the decryption exponents for which RSA is weak. For the case of two decryption exponents, the bound was N0.357. We have exploited a different lattice based technique to show that RSA is weak beyond this bound. Our analysis provides improved results and it shows that for two exponents, RSA is weak when the RSA decryption exponents are less than N0.416. Moreover, we get further improvement in the bound when some of the most significant bits (MSBs) of the decryption exponents are same (but unknown). 相似文献
42.
Yang Ruiduo Sarkar Sudeep Loeding Barbara 《IEEE transactions on pattern analysis and machine intelligence》2010,32(3):462-477
We consider two crucial problems in continuous sign language recognition from unaided video sequences. At the sentence level, we consider the movement epenthesis (me) problem and at the feature level, we consider the problem of hand segmentation and grouping. We construct a framework that can handle both of these problems based on an enhanced, nested version of the dynamic programming approach. To address movement epenthesis, a dynamic programming (DP) process employs a virtual me option that does not need explicit models. We call this the enhanced level building (eLB) algorithm. This formulation also allows the incorporation of grammar models. Nested within this eLB is another DP that handles the problem of selecting among multiple hand candidates. We demonstrate our ideas on four American Sign Language data sets with simple background, with the signer wearing short sleeves, with complex background, and across signers. We compared the performance with Conditional Random Fields (CRF) and Latent Dynamic-CRF-based approaches. The experiments show more than 40 percent improvement over CRF or LDCRF approaches in terms of the frame labeling rate. We show the flexibility of our approach when handling a changing context. We also find a 70 percent improvement in sign recognition rate over the unenhanced DP matching algorithm that does not accommodate the me effect. 相似文献
43.
Proportionate fair schedulers provide an effective methodology for scheduling recurrent real-time tasks on multiprocessors. However, a drawback in these schedulers is that they ignore a task’s affinity towards the processor where it was executed last, causing frequent inter-processor task migrations which ultimately results in increased execution times. This paper presents Partition Oriented Frame Based Fair Scheduler (POFBFS), an efficient proportional fair scheduler for periodic firm and soft real-time tasks that ensures a bounded number of task migrations. Experimental results reveal that POFBFS can achieve 3 to 100 times reduction in the number of migrations suffered with respect to the General-ERfair algorithm (for a set of 25 to 100 tasks running on 2 to 8 processors) while simultaneously maintaining high fairness accuracy. 相似文献
44.
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. 相似文献
45.
Pre-processing is one of the vital steps for developing robust and efficient recognition system. Better pre-processing not
only aid in better data selection but also in significant reduction of computational complexity. Further an efficient frame
selection technique can improve the overall performance of the system. Pre-quantization (PQ) is the technique of selecting
less number of frames in the pre-processing stage to reduce the computational burden in the post processing stages of speaker
identification (SI). In this paper, we develop PQ techniques based on spectral entropy and spectral shape to pick suitable
frames containing speaker specific information that varies from frame to frame depending on spoken text and environmental
conditions. The attempt is to exploit the statistical properties of distributions of speech frames at the pre-processing stage
of speaker recognition. Our aim is not only to reduce the frame rate but also to maintain identification accuracy reasonably
high. Further we have also analyzed the robustness of our proposed techniques on noisy utterances. To establish the efficacy
of our proposed methods, we used two different databases, POLYCOST (telephone speech) and YOHO (microphone speech). 相似文献
46.
Biswajit Sarkar Shib Sankar Sana Kripasindhu Chaudhuri 《Expert systems with applications》2011,38(11):13543-13548
The paper deals with an economic manufacturing quantity (EMQ) model for time-dependent (quadratic) demand pattern. Every manufacturing sector wants to produce perfect quality items. But in long run process, there may arise different types of difficulties like labor problem, machinery capabilities problems, etc., due to that the machinery systems shift from in-control state to out-of-control state as a result the manufacturing systems produce imperfect quality items. The imperfect items are reworked at a cost to become the perfect one. The rework cost may be reduced by improvements in product reliability i.e., the production process depend on time and also the reliability parameter. We want to determine the optimal product reliability and production rate that achieves the biggest total integrated profit for an imperfect manufacturing process using Euler–Lagrange theory to build up the necessary and sufficient conditions for optimality of the dynamic variables. Finally, a numerical example is discussed to test the model which is illustrated graphically also. 相似文献
47.
48.
Ram Kumar Anandini Devi Abahan Sarkar F. A. Talukdar 《Microsystem Technologies》2016,22(11):2681-2690
A highly linear 5.5 GHz low noise amplifier (LNA) has been designed exploiting source inductive degeneration topology by using post distortion linearization techniques in 0.18 m CMOS technology. This technique improves the input third order intercept point \((IIP_{3})\) of a low noise amplifier. For enhancing the linearity, this technique used a diode connected MOSFET as IMD sinker and forward body biased which is done in cadence tool. The proposed low noise amplifier achieves high \(IIP_{3}\) by using two transistors, main and auxiliary transistors. Also source inductive degeneration topology is employed in the proposed LNA to optimize the noise figure (NF) and \(S_{11}\) at high frequency. In order to reduce power consumption and threshold voltage, Forward Body Biased technique was implemented. In this paper, the first section discusses the most widely used eight linearization techniques and in the second section, the proposed circuit is represented along with its employed topology, techniques and the simulated results. The proposed LNA achieves a simulated third order input intercept \((IIP_{3})\) of 9.20 dBm while consuming 10.8 mW from a power supply of 1.8 V. it also exhibits a measured gain of 11.34 dB and NF, NF of 2.33 dB. 相似文献
49.
In this study, novel designs of single‐band and tri‐band pattern reconfigurable antennas are proposed. The design of single‐band pattern reconfigurable antenna is accomplished by the use of varactor diodes with the parasitic elements placed on both sides of the driven conventional printed dipole antenna. By tuning the capacitance of varactor, the antenna operates in four different configurations of radiation pattern which include bi‐directional end‐fire, broadside, and uni‐directional end‐fire radiation patterns. The tri‐band pattern reconfigurable antenna design is achieved by the use of parasitic elements on both sides of a tri‐band driven dipole antenna. Dual‐band LC resonators are used as loading elements along the arms of printed dipole to get two lower order modes in addition to the reference dipole mode, resulting in a triband operation of the driven element. The electrical lengths of the parasitic elements with respect to the tri‐band driven element are controlled by suitably embedding varactor and PIN diodes with them. The proposed tri‐band antenna operates in ten different configurations of radiation patterns in the three operating bands. Fully functional prototypes of single‐band and tri‐band pattern reconfigurable antennas along with the DC bias networks have been fabricated to validate the results obtained in simulation. 相似文献
50.
Robbert?Jongeling Proshanta?Sarkar Subhajit?Datta Alexander?SerebrenikEmail authorView authors OrcID profile 《Empirical Software Engineering》2017,22(5):2543-2584
Recent years have seen an increasing attention to social aspects of software engineering, including studies of emotions and sentiments experienced and expressed by the software developers. Most of these studies reuse existing sentiment analysis tools such as SentiStrength and NLTK. However, these tools have been trained on product reviews and movie reviews and, therefore, their results might not be applicable in the software engineering domain. In this paper we study whether the sentiment analysis tools agree with the sentiment recognized by human evaluators (as reported in an earlier study) as well as with each other. Furthermore, we evaluate the impact of the choice of a sentiment analysis tool on software engineering studies by conducting a simple study of differences in issue resolution times for positive, negative and neutral texts. We repeat the study for seven datasets (issue trackers and Stack Overflow questions) and different sentiment analysis tools and observe that the disagreement between the tools can lead to diverging conclusions. Finally, we perform two replications of previously published studies and observe that the results of those studies cannot be confirmed when a different sentiment analysis tool is used. 相似文献